./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e19ca921 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/safe032_power.oepc_power.opt_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 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-e19ca92 [2021-12-22 13:32:44,849 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 13:32:44,851 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 13:32:44,912 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 13:32:44,913 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 13:32:44,914 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 13:32:44,914 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 13:32:44,915 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 13:32:44,916 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 13:32:44,917 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 13:32:44,918 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 13:32:44,931 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 13:32:44,932 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 13:32:44,936 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 13:32:44,937 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 13:32:44,938 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 13:32:44,940 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 13:32:44,941 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 13:32:44,942 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 13:32:44,944 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 13:32:44,946 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 13:32:44,947 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 13:32:44,948 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 13:32:44,949 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 13:32:44,953 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 13:32:44,955 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 13:32:44,955 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 13:32:44,956 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 13:32:44,957 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 13:32:44,958 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 13:32:44,958 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 13:32:44,958 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 13:32:44,960 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 13:32:44,960 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 13:32:44,961 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 13:32:44,961 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 13:32:44,962 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 13:32:44,963 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 13:32:44,963 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 13:32:44,963 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 13:32:44,964 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 13:32:44,965 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-22 13:32:44,991 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 13:32:44,992 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 13:32:44,992 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 13:32:44,992 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 13:32:44,993 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-22 13:32:44,993 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-22 13:32:44,993 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 13:32:44,994 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 13:32:44,994 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 13:32:44,994 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 13:32:44,995 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-22 13:32:44,995 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 13:32:44,995 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-22 13:32:44,995 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 13:32:44,995 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-22 13:32:44,995 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-22 13:32:44,995 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-22 13:32:44,996 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-22 13:32:44,996 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-22 13:32:44,996 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 13:32:44,996 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-22 13:32:44,996 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 13:32:44,996 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 13:32:44,996 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-22 13:32:44,997 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 13:32:44,997 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 13:32:44,997 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-22 13:32:44,997 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-22 13:32:44,997 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-22 13:32:44,998 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-22 13:32:44,998 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-22 13:32:44,998 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-22 13:32:44,998 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-22 13:32:44,998 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 13:32:44,998 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 -> 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87 [2021-12-22 13:32:45,211 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 13:32:45,229 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 13:32:45,231 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 13:32:45,232 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 13:32:45,234 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 13:32:45,235 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2021-12-22 13:32:45,277 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0b8fdcbd/000bd4789e9044648603221e9d574844/FLAGa72a73b6b [2021-12-22 13:32:45,698 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 13:32:45,700 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2021-12-22 13:32:45,715 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0b8fdcbd/000bd4789e9044648603221e9d574844/FLAGa72a73b6b [2021-12-22 13:32:46,033 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0b8fdcbd/000bd4789e9044648603221e9d574844 [2021-12-22 13:32:46,035 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 13:32:46,036 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 13:32:46,037 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 13:32:46,037 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 13:32:46,039 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 13:32:46,040 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 01:32:46" (1/1) ... [2021-12-22 13:32:46,040 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77c4cf0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:32:46, skipping insertion in model container [2021-12-22 13:32:46,040 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 01:32:46" (1/1) ... [2021-12-22 13:32:46,045 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 13:32:46,084 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 13:32:46,229 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/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2021-12-22 13:32:46,398 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 13:32:46,405 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 13:32:46,414 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/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2021-12-22 13:32:46,487 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 13:32:46,511 INFO L208 MainTranslator]: Completed translation [2021-12-22 13:32:46,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:32:46 WrapperNode [2021-12-22 13:32:46,512 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 13:32:46,513 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 13:32:46,513 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 13:32:46,513 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 13:32:46,518 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:32:46" (1/1) ... [2021-12-22 13:32:46,564 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:32:46" (1/1) ... [2021-12-22 13:32:46,594 INFO L137 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 274 [2021-12-22 13:32:46,595 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 13:32:46,596 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 13:32:46,596 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 13:32:46,596 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 13:32:46,602 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:32:46" (1/1) ... [2021-12-22 13:32:46,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:32:46" (1/1) ... [2021-12-22 13:32:46,606 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:32:46" (1/1) ... [2021-12-22 13:32:46,606 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:32:46" (1/1) ... [2021-12-22 13:32:46,614 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:32:46" (1/1) ... [2021-12-22 13:32:46,617 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:32:46" (1/1) ... [2021-12-22 13:32:46,620 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:32:46" (1/1) ... [2021-12-22 13:32:46,624 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 13:32:46,625 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 13:32:46,625 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 13:32:46,625 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 13:32:46,626 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:32:46" (1/1) ... [2021-12-22 13:32:46,637 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 13:32:46,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 13:32:46,701 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-22 13:32:46,721 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-22 13:32:46,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-22 13:32:46,755 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-22 13:32:46,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-22 13:32:46,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-22 13:32:46,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-22 13:32:46,756 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-12-22 13:32:46,757 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-12-22 13:32:46,757 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-12-22 13:32:46,757 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-12-22 13:32:46,757 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-12-22 13:32:46,758 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-12-22 13:32:46,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-22 13:32:46,758 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-22 13:32:46,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 13:32:46,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 13:32:46,760 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-22 13:32:46,924 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 13:32:46,935 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 13:32:47,449 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 13:32:47,844 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 13:32:47,844 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-22 13:32:47,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 01:32:47 BoogieIcfgContainer [2021-12-22 13:32:47,846 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 13:32:47,848 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-22 13:32:47,848 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-22 13:32:47,850 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-22 13:32:47,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 01:32:46" (1/3) ... [2021-12-22 13:32:47,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@163d2aa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 01:32:47, skipping insertion in model container [2021-12-22 13:32:47,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:32:46" (2/3) ... [2021-12-22 13:32:47,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@163d2aa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 01:32:47, skipping insertion in model container [2021-12-22 13:32:47,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 01:32:47" (3/3) ... [2021-12-22 13:32:47,854 INFO L111 eAbstractionObserver]: Analyzing ICFG safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2021-12-22 13:32:47,858 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-22 13:32:47,859 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-22 13:32:47,859 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-22 13:32:47,859 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-22 13:32:47,912 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,912 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,912 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,912 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,913 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,913 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,913 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,913 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,913 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,914 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,914 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,914 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,914 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,915 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,915 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,915 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,915 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,915 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,916 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,916 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,916 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,917 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,917 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,917 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,917 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,917 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,918 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,918 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,918 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,918 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,918 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,918 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,918 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,919 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,919 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,919 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,919 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,919 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,919 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,919 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,920 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,920 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,920 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,920 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,920 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,920 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,923 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,923 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,923 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,923 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,923 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,924 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,924 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,924 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,924 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,924 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,924 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,924 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,924 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,925 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,925 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,925 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,925 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,925 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,925 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,925 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,926 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,926 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,926 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,926 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,926 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,927 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,927 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,927 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,927 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,927 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,927 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,928 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,928 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,929 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,930 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,931 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,931 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,931 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,935 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,935 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,935 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,935 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,936 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,939 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,940 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,940 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,940 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,940 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,940 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,940 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,941 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,941 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,941 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,941 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,942 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,942 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,942 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,942 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,943 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,943 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,943 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,943 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,943 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,943 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,944 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,944 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,944 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,944 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,944 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,944 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,945 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,945 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,945 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,945 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,945 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,945 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,945 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,945 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,946 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,946 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,946 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,946 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,946 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,946 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,946 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,946 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,947 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,947 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,947 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,947 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,947 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,947 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,947 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,947 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,948 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,948 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,948 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,948 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,948 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,948 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,948 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,948 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,951 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,951 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,951 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,951 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,951 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,952 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,952 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,953 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,953 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,953 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,953 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,953 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,953 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,953 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,953 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,954 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,954 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,954 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,954 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,954 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,954 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,954 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,954 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,955 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,955 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,955 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,955 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,955 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,955 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,955 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,955 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,956 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,956 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,956 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,956 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,956 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,956 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,956 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,959 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,959 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,959 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,959 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,959 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,959 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,959 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,960 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,960 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,960 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,960 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,961 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,961 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,961 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,961 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,962 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,962 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,962 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,962 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,962 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,963 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,965 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,966 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,966 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,966 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,966 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,966 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,966 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,967 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,967 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,968 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,968 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,968 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,968 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,969 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,969 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,969 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,969 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,969 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,969 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,969 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,970 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,970 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,970 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,970 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,970 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,970 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,971 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,971 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,976 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,976 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,976 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,979 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,979 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,979 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,980 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,980 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,980 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,980 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,980 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,980 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,981 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,981 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,981 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,981 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,981 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,981 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,982 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,982 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,982 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,982 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,982 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,982 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,982 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,983 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,983 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,983 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,983 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,983 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,983 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,983 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,984 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,984 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,984 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,984 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,984 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,984 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,984 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,984 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,985 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,985 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,986 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,986 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,986 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,986 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,986 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,986 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,986 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,987 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,987 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,987 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,987 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,987 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,988 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,988 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,988 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,988 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,988 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,988 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,988 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,989 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,989 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,989 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,989 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,989 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,989 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,989 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,990 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,990 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,990 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,990 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,990 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,990 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,990 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,990 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,991 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,991 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,991 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,991 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,991 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:47,992 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-12-22 13:32:48,039 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-22 13:32:48,045 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-22 13:32:48,045 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-12-22 13:32:48,055 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 243 flow [2021-12-22 13:32:48,086 INFO L129 PetriNetUnfolder]: 2/111 cut-off events. [2021-12-22 13:32:48,086 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-22 13:32:48,089 INFO L84 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2021-12-22 13:32:48,089 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 114 transitions, 243 flow [2021-12-22 13:32:48,092 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 111 transitions, 231 flow [2021-12-22 13:32:48,102 INFO L129 PetriNetUnfolder]: 0/74 cut-off events. [2021-12-22 13:32:48,102 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-22 13:32:48,102 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:32:48,103 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] [2021-12-22 13:32:48,103 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:32:48,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:32:48,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1547640948, now seen corresponding path program 1 times [2021-12-22 13:32:48,113 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:32:48,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637244075] [2021-12-22 13:32:48,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:32:48,114 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:32:48,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:32:48,343 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-22 13:32:48,344 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:32:48,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637244075] [2021-12-22 13:32:48,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637244075] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:32:48,344 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:32:48,345 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 13:32:48,346 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47121128] [2021-12-22 13:32:48,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:32:48,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 13:32:48,366 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:32:48,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 13:32:48,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 13:32:48,427 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 114 [2021-12-22 13:32:48,430 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 111 transitions, 231 flow. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 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-22 13:32:48,431 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:32:48,431 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 114 [2021-12-22 13:32:48,431 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:32:48,597 INFO L129 PetriNetUnfolder]: 126/549 cut-off events. [2021-12-22 13:32:48,598 INFO L130 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2021-12-22 13:32:48,600 INFO L84 FinitePrefix]: Finished finitePrefix Result has 785 conditions, 549 events. 126/549 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2889 event pairs, 34 based on Foata normal form. 24/540 useless extension candidates. Maximal degree in co-relation 734. Up to 141 conditions per place. [2021-12-22 13:32:48,603 INFO L132 encePairwiseOnDemand]: 109/114 looper letters, 16 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2021-12-22 13:32:48,604 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 113 transitions, 271 flow [2021-12-22 13:32:48,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 13:32:48,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-22 13:32:48,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 317 transitions. [2021-12-22 13:32:48,614 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9269005847953217 [2021-12-22 13:32:48,614 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 317 transitions. [2021-12-22 13:32:48,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 317 transitions. [2021-12-22 13:32:48,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:32:48,617 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 317 transitions. [2021-12-22 13:32:48,620 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 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-22 13:32:48,624 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:32:48,624 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:32:48,625 INFO L186 Difference]: Start difference. First operand has 119 places, 111 transitions, 231 flow. Second operand 3 states and 317 transitions. [2021-12-22 13:32:48,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 113 transitions, 271 flow [2021-12-22 13:32:48,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 113 transitions, 268 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-12-22 13:32:48,630 INFO L242 Difference]: Finished difference. Result has 116 places, 107 transitions, 224 flow [2021-12-22 13:32:48,632 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=116, PETRI_TRANSITIONS=107} [2021-12-22 13:32:48,634 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, -3 predicate places. [2021-12-22 13:32:48,634 INFO L470 AbstractCegarLoop]: Abstraction has has 116 places, 107 transitions, 224 flow [2021-12-22 13:32:48,635 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 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-22 13:32:48,635 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:32:48,635 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] [2021-12-22 13:32:48,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-22 13:32:48,635 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:32:48,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:32:48,636 INFO L85 PathProgramCache]: Analyzing trace with hash 84128766, now seen corresponding path program 1 times [2021-12-22 13:32:48,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:32:48,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333624236] [2021-12-22 13:32:48,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:32:48,637 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:32:48,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:32:48,855 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-22 13:32:48,856 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:32:48,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333624236] [2021-12-22 13:32:48,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333624236] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:32:48,856 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:32:48,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 13:32:48,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459098352] [2021-12-22 13:32:48,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:32:48,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 13:32:48,858 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:32:48,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 13:32:48,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 13:32:48,859 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 114 [2021-12-22 13:32:48,860 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 107 transitions, 224 flow. Second operand has 6 states, 6 states have (on average 93.83333333333333) internal successors, (563), 6 states have internal predecessors, (563), 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-22 13:32:48,860 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:32:48,860 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 114 [2021-12-22 13:32:48,860 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:32:49,318 INFO L129 PetriNetUnfolder]: 418/1209 cut-off events. [2021-12-22 13:32:49,319 INFO L130 PetriNetUnfolder]: For 80/80 co-relation queries the response was YES. [2021-12-22 13:32:49,321 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1985 conditions, 1209 events. 418/1209 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 8118 event pairs, 70 based on Foata normal form. 0/1173 useless extension candidates. Maximal degree in co-relation 1934. Up to 267 conditions per place. [2021-12-22 13:32:49,323 INFO L132 encePairwiseOnDemand]: 108/114 looper letters, 20 selfloop transitions, 2 changer transitions 48/148 dead transitions. [2021-12-22 13:32:49,324 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 148 transitions, 440 flow [2021-12-22 13:32:49,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-22 13:32:49,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-22 13:32:49,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 889 transitions. [2021-12-22 13:32:49,328 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8664717348927875 [2021-12-22 13:32:49,328 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 889 transitions. [2021-12-22 13:32:49,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 889 transitions. [2021-12-22 13:32:49,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:32:49,329 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 889 transitions. [2021-12-22 13:32:49,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.77777777777777) internal successors, (889), 9 states have internal predecessors, (889), 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-22 13:32:49,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:32:49,334 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:32:49,334 INFO L186 Difference]: Start difference. First operand has 116 places, 107 transitions, 224 flow. Second operand 9 states and 889 transitions. [2021-12-22 13:32:49,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 148 transitions, 440 flow [2021-12-22 13:32:49,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 148 transitions, 422 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-22 13:32:49,337 INFO L242 Difference]: Finished difference. Result has 129 places, 95 transitions, 216 flow [2021-12-22 13:32:49,338 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=216, PETRI_PLACES=129, PETRI_TRANSITIONS=95} [2021-12-22 13:32:49,338 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 10 predicate places. [2021-12-22 13:32:49,339 INFO L470 AbstractCegarLoop]: Abstraction has has 129 places, 95 transitions, 216 flow [2021-12-22 13:32:49,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.83333333333333) internal successors, (563), 6 states have internal predecessors, (563), 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-22 13:32:49,339 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:32:49,339 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] [2021-12-22 13:32:49,340 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-22 13:32:49,340 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:32:49,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:32:49,340 INFO L85 PathProgramCache]: Analyzing trace with hash -854671236, now seen corresponding path program 1 times [2021-12-22 13:32:49,341 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:32:49,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755873032] [2021-12-22 13:32:49,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:32:49,341 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:32:49,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:32:49,505 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-22 13:32:49,506 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:32:49,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755873032] [2021-12-22 13:32:49,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755873032] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:32:49,506 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:32:49,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 13:32:49,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517909654] [2021-12-22 13:32:49,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:32:49,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 13:32:49,507 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:32:49,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 13:32:49,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 13:32:49,509 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2021-12-22 13:32:49,509 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 95 transitions, 216 flow. Second operand has 6 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:32:49,509 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:32:49,510 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2021-12-22 13:32:49,510 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:32:49,839 INFO L129 PetriNetUnfolder]: 524/1135 cut-off events. [2021-12-22 13:32:49,839 INFO L130 PetriNetUnfolder]: For 272/272 co-relation queries the response was YES. [2021-12-22 13:32:49,842 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2305 conditions, 1135 events. 524/1135 cut-off events. For 272/272 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 6111 event pairs, 282 based on Foata normal form. 24/1100 useless extension candidates. Maximal degree in co-relation 2247. Up to 536 conditions per place. [2021-12-22 13:32:49,845 INFO L132 encePairwiseOnDemand]: 107/114 looper letters, 25 selfloop transitions, 3 changer transitions 37/141 dead transitions. [2021-12-22 13:32:49,845 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 141 transitions, 463 flow [2021-12-22 13:32:49,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-22 13:32:49,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-22 13:32:49,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 877 transitions. [2021-12-22 13:32:49,847 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.854775828460039 [2021-12-22 13:32:49,848 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 877 transitions. [2021-12-22 13:32:49,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 877 transitions. [2021-12-22 13:32:49,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:32:49,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 877 transitions. [2021-12-22 13:32:49,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.44444444444444) internal successors, (877), 9 states have internal predecessors, (877), 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-22 13:32:49,851 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:32:49,852 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:32:49,852 INFO L186 Difference]: Start difference. First operand has 129 places, 95 transitions, 216 flow. Second operand 9 states and 877 transitions. [2021-12-22 13:32:49,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 141 transitions, 463 flow [2021-12-22 13:32:49,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 141 transitions, 429 flow, removed 14 selfloop flow, removed 8 redundant places. [2021-12-22 13:32:49,858 INFO L242 Difference]: Finished difference. Result has 118 places, 97 transitions, 243 flow [2021-12-22 13:32:49,858 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=243, PETRI_PLACES=118, PETRI_TRANSITIONS=97} [2021-12-22 13:32:49,859 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, -1 predicate places. [2021-12-22 13:32:49,859 INFO L470 AbstractCegarLoop]: Abstraction has has 118 places, 97 transitions, 243 flow [2021-12-22 13:32:49,860 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:32:49,860 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:32:49,860 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-22 13:32:49,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-22 13:32:49,860 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:32:49,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:32:49,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1519173115, now seen corresponding path program 1 times [2021-12-22 13:32:49,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:32:49,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350589895] [2021-12-22 13:32:49,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:32:49,861 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:32:49,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:32:50,121 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-22 13:32:50,121 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:32:50,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350589895] [2021-12-22 13:32:50,121 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350589895] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:32:50,122 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:32:50,122 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-22 13:32:50,122 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005466337] [2021-12-22 13:32:50,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:32:50,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-22 13:32:50,123 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:32:50,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-22 13:32:50,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-12-22 13:32:50,124 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 114 [2021-12-22 13:32:50,125 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 97 transitions, 243 flow. Second operand has 12 states, 12 states have (on average 87.58333333333333) internal successors, (1051), 12 states have internal predecessors, (1051), 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-22 13:32:50,125 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:32:50,125 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 114 [2021-12-22 13:32:50,126 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:32:50,834 INFO L129 PetriNetUnfolder]: 417/993 cut-off events. [2021-12-22 13:32:50,835 INFO L130 PetriNetUnfolder]: For 795/795 co-relation queries the response was YES. [2021-12-22 13:32:50,838 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2301 conditions, 993 events. 417/993 cut-off events. For 795/795 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5381 event pairs, 49 based on Foata normal form. 27/961 useless extension candidates. Maximal degree in co-relation 2237. Up to 308 conditions per place. [2021-12-22 13:32:50,842 INFO L132 encePairwiseOnDemand]: 100/114 looper letters, 29 selfloop transitions, 12 changer transitions 38/153 dead transitions. [2021-12-22 13:32:50,842 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 153 transitions, 550 flow [2021-12-22 13:32:50,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-22 13:32:50,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2021-12-22 13:32:50,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1630 transitions. [2021-12-22 13:32:50,846 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7943469785575049 [2021-12-22 13:32:50,846 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1630 transitions. [2021-12-22 13:32:50,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1630 transitions. [2021-12-22 13:32:50,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:32:50,847 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1630 transitions. [2021-12-22 13:32:50,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 90.55555555555556) internal successors, (1630), 18 states have internal predecessors, (1630), 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-22 13:32:50,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 114.0) internal successors, (2166), 19 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:32:50,854 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 114.0) internal successors, (2166), 19 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:32:50,854 INFO L186 Difference]: Start difference. First operand has 118 places, 97 transitions, 243 flow. Second operand 18 states and 1630 transitions. [2021-12-22 13:32:50,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 153 transitions, 550 flow [2021-12-22 13:32:50,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 153 transitions, 529 flow, removed 9 selfloop flow, removed 4 redundant places. [2021-12-22 13:32:50,860 INFO L242 Difference]: Finished difference. Result has 138 places, 104 transitions, 335 flow [2021-12-22 13:32:50,861 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=335, PETRI_PLACES=138, PETRI_TRANSITIONS=104} [2021-12-22 13:32:50,862 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 19 predicate places. [2021-12-22 13:32:50,862 INFO L470 AbstractCegarLoop]: Abstraction has has 138 places, 104 transitions, 335 flow [2021-12-22 13:32:50,863 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 87.58333333333333) internal successors, (1051), 12 states have internal predecessors, (1051), 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-22 13:32:50,863 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:32:50,863 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:32:50,863 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-22 13:32:50,863 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:32:50,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:32:50,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1270785456, now seen corresponding path program 1 times [2021-12-22 13:32:50,864 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:32:50,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697513804] [2021-12-22 13:32:50,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:32:50,865 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:32:50,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:32:50,992 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-22 13:32:50,993 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:32:50,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697513804] [2021-12-22 13:32:50,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697513804] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:32:50,993 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:32:50,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 13:32:50,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566552572] [2021-12-22 13:32:50,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:32:50,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 13:32:50,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:32:50,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 13:32:50,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 13:32:50,995 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2021-12-22 13:32:50,996 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 104 transitions, 335 flow. Second operand has 6 states, 6 states have (on average 92.5) internal successors, (555), 6 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:32:50,996 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:32:50,996 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2021-12-22 13:32:50,996 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:32:51,396 INFO L129 PetriNetUnfolder]: 569/1297 cut-off events. [2021-12-22 13:32:51,396 INFO L130 PetriNetUnfolder]: For 4490/4498 co-relation queries the response was YES. [2021-12-22 13:32:51,401 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5017 conditions, 1297 events. 569/1297 cut-off events. For 4490/4498 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 7685 event pairs, 182 based on Foata normal form. 20/1238 useless extension candidates. Maximal degree in co-relation 4944. Up to 467 conditions per place. [2021-12-22 13:32:51,407 INFO L132 encePairwiseOnDemand]: 108/114 looper letters, 36 selfloop transitions, 3 changer transitions 29/145 dead transitions. [2021-12-22 13:32:51,407 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 145 transitions, 821 flow [2021-12-22 13:32:51,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-22 13:32:51,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-22 13:32:51,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 870 transitions. [2021-12-22 13:32:51,410 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.847953216374269 [2021-12-22 13:32:51,410 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 870 transitions. [2021-12-22 13:32:51,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 870 transitions. [2021-12-22 13:32:51,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:32:51,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 870 transitions. [2021-12-22 13:32:51,412 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 96.66666666666667) internal successors, (870), 9 states have internal predecessors, (870), 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-22 13:32:51,413 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:32:51,414 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:32:51,414 INFO L186 Difference]: Start difference. First operand has 138 places, 104 transitions, 335 flow. Second operand 9 states and 870 transitions. [2021-12-22 13:32:51,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 145 transitions, 821 flow [2021-12-22 13:32:51,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 145 transitions, 758 flow, removed 24 selfloop flow, removed 10 redundant places. [2021-12-22 13:32:51,423 INFO L242 Difference]: Finished difference. Result has 134 places, 104 transitions, 332 flow [2021-12-22 13:32:51,423 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=332, PETRI_PLACES=134, PETRI_TRANSITIONS=104} [2021-12-22 13:32:51,424 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 15 predicate places. [2021-12-22 13:32:51,424 INFO L470 AbstractCegarLoop]: Abstraction has has 134 places, 104 transitions, 332 flow [2021-12-22 13:32:51,424 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.5) internal successors, (555), 6 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:32:51,424 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:32:51,424 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] [2021-12-22 13:32:51,425 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-22 13:32:51,425 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:32:51,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:32:51,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1859241053, now seen corresponding path program 1 times [2021-12-22 13:32:51,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:32:51,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462072899] [2021-12-22 13:32:51,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:32:51,426 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:32:51,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:32:51,707 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-22 13:32:51,707 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:32:51,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462072899] [2021-12-22 13:32:51,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462072899] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:32:51,708 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:32:51,708 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-22 13:32:51,708 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945049379] [2021-12-22 13:32:51,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:32:51,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-22 13:32:51,709 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:32:51,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-22 13:32:51,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-12-22 13:32:51,710 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 114 [2021-12-22 13:32:51,711 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 104 transitions, 332 flow. Second operand has 13 states, 13 states have (on average 87.53846153846153) internal successors, (1138), 13 states have internal predecessors, (1138), 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-22 13:32:51,711 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:32:51,712 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 114 [2021-12-22 13:32:51,712 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:32:52,302 INFO L129 PetriNetUnfolder]: 545/1364 cut-off events. [2021-12-22 13:32:52,303 INFO L130 PetriNetUnfolder]: For 5430/5526 co-relation queries the response was YES. [2021-12-22 13:32:52,308 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5228 conditions, 1364 events. 545/1364 cut-off events. For 5430/5526 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 8532 event pairs, 78 based on Foata normal form. 27/1262 useless extension candidates. Maximal degree in co-relation 5152. Up to 535 conditions per place. [2021-12-22 13:32:52,313 INFO L132 encePairwiseOnDemand]: 101/114 looper letters, 38 selfloop transitions, 20 changer transitions 25/157 dead transitions. [2021-12-22 13:32:52,314 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 157 transitions, 905 flow [2021-12-22 13:32:52,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-22 13:32:52,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-12-22 13:32:52,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1366 transitions. [2021-12-22 13:32:52,317 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7988304093567251 [2021-12-22 13:32:52,317 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1366 transitions. [2021-12-22 13:32:52,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1366 transitions. [2021-12-22 13:32:52,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:32:52,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1366 transitions. [2021-12-22 13:32:52,320 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 91.06666666666666) internal successors, (1366), 15 states have internal predecessors, (1366), 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-22 13:32:52,322 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:32:52,322 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:32:52,322 INFO L186 Difference]: Start difference. First operand has 134 places, 104 transitions, 332 flow. Second operand 15 states and 1366 transitions. [2021-12-22 13:32:52,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 157 transitions, 905 flow [2021-12-22 13:32:52,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 157 transitions, 868 flow, removed 17 selfloop flow, removed 7 redundant places. [2021-12-22 13:32:52,330 INFO L242 Difference]: Finished difference. Result has 144 places, 115 transitions, 476 flow [2021-12-22 13:32:52,331 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=476, PETRI_PLACES=144, PETRI_TRANSITIONS=115} [2021-12-22 13:32:52,331 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 25 predicate places. [2021-12-22 13:32:52,331 INFO L470 AbstractCegarLoop]: Abstraction has has 144 places, 115 transitions, 476 flow [2021-12-22 13:32:52,332 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 87.53846153846153) internal successors, (1138), 13 states have internal predecessors, (1138), 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-22 13:32:52,332 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:32:52,332 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] [2021-12-22 13:32:52,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-22 13:32:52,332 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:32:52,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:32:52,333 INFO L85 PathProgramCache]: Analyzing trace with hash 153497483, now seen corresponding path program 2 times [2021-12-22 13:32:52,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:32:52,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014646317] [2021-12-22 13:32:52,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:32:52,333 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:32:52,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:32:52,600 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-22 13:32:52,600 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:32:52,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014646317] [2021-12-22 13:32:52,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014646317] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:32:52,600 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:32:52,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-12-22 13:32:52,600 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288869000] [2021-12-22 13:32:52,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:32:52,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-22 13:32:52,603 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:32:52,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-22 13:32:52,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2021-12-22 13:32:52,604 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 114 [2021-12-22 13:32:52,605 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 115 transitions, 476 flow. Second operand has 15 states, 15 states have (on average 86.4) internal successors, (1296), 15 states have internal predecessors, (1296), 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-22 13:32:52,605 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:32:52,605 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 114 [2021-12-22 13:32:52,605 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:32:53,154 INFO L129 PetriNetUnfolder]: 563/1378 cut-off events. [2021-12-22 13:32:53,154 INFO L130 PetriNetUnfolder]: For 10183/10815 co-relation queries the response was YES. [2021-12-22 13:32:53,161 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6670 conditions, 1378 events. 563/1378 cut-off events. For 10183/10815 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 8493 event pairs, 80 based on Foata normal form. 52/1293 useless extension candidates. Maximal degree in co-relation 6586. Up to 548 conditions per place. [2021-12-22 13:32:53,167 INFO L132 encePairwiseOnDemand]: 100/114 looper letters, 32 selfloop transitions, 24 changer transitions 26/155 dead transitions. [2021-12-22 13:32:53,167 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 155 transitions, 1086 flow [2021-12-22 13:32:53,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-22 13:32:53,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-12-22 13:32:53,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1434 transitions. [2021-12-22 13:32:53,170 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7861842105263158 [2021-12-22 13:32:53,170 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1434 transitions. [2021-12-22 13:32:53,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1434 transitions. [2021-12-22 13:32:53,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:32:53,171 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1434 transitions. [2021-12-22 13:32:53,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 89.625) internal successors, (1434), 16 states have internal predecessors, (1434), 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-22 13:32:53,176 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 114.0) internal successors, (1938), 17 states have internal predecessors, (1938), 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-22 13:32:53,176 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 114.0) internal successors, (1938), 17 states have internal predecessors, (1938), 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-22 13:32:53,176 INFO L186 Difference]: Start difference. First operand has 144 places, 115 transitions, 476 flow. Second operand 16 states and 1434 transitions. [2021-12-22 13:32:53,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 155 transitions, 1086 flow [2021-12-22 13:32:53,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 155 transitions, 986 flow, removed 46 selfloop flow, removed 10 redundant places. [2021-12-22 13:32:53,188 INFO L242 Difference]: Finished difference. Result has 150 places, 117 transitions, 562 flow [2021-12-22 13:32:53,188 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=562, PETRI_PLACES=150, PETRI_TRANSITIONS=117} [2021-12-22 13:32:53,189 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 31 predicate places. [2021-12-22 13:32:53,189 INFO L470 AbstractCegarLoop]: Abstraction has has 150 places, 117 transitions, 562 flow [2021-12-22 13:32:53,190 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 86.4) internal successors, (1296), 15 states have internal predecessors, (1296), 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-22 13:32:53,190 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:32:53,190 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] [2021-12-22 13:32:53,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-22 13:32:53,190 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:32:53,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:32:53,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1585920861, now seen corresponding path program 3 times [2021-12-22 13:32:53,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:32:53,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029383168] [2021-12-22 13:32:53,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:32:53,191 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:32:53,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:32:53,413 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-22 13:32:53,413 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:32:53,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029383168] [2021-12-22 13:32:53,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029383168] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:32:53,414 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:32:53,414 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-22 13:32:53,414 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623828359] [2021-12-22 13:32:53,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:32:53,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-22 13:32:53,414 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:32:53,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-22 13:32:53,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-12-22 13:32:53,416 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 114 [2021-12-22 13:32:53,416 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 117 transitions, 562 flow. Second operand has 12 states, 12 states have (on average 85.83333333333333) internal successors, (1030), 12 states have internal predecessors, (1030), 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-22 13:32:53,416 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:32:53,417 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 114 [2021-12-22 13:32:53,417 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:32:54,037 INFO L129 PetriNetUnfolder]: 529/1398 cut-off events. [2021-12-22 13:32:54,037 INFO L130 PetriNetUnfolder]: For 13087/14313 co-relation queries the response was YES. [2021-12-22 13:32:54,044 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7294 conditions, 1398 events. 529/1398 cut-off events. For 13087/14313 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 9446 event pairs, 125 based on Foata normal form. 46/1321 useless extension candidates. Maximal degree in co-relation 7206. Up to 532 conditions per place. [2021-12-22 13:32:54,049 INFO L132 encePairwiseOnDemand]: 103/114 looper letters, 39 selfloop transitions, 13 changer transitions 27/151 dead transitions. [2021-12-22 13:32:54,050 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 151 transitions, 1193 flow [2021-12-22 13:32:54,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-22 13:32:54,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-22 13:32:54,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1156 transitions. [2021-12-22 13:32:54,052 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7800269905533064 [2021-12-22 13:32:54,053 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1156 transitions. [2021-12-22 13:32:54,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1156 transitions. [2021-12-22 13:32:54,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:32:54,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1156 transitions. [2021-12-22 13:32:54,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 88.92307692307692) internal successors, (1156), 13 states have internal predecessors, (1156), 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-22 13:32:54,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:32:54,058 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:32:54,058 INFO L186 Difference]: Start difference. First operand has 150 places, 117 transitions, 562 flow. Second operand 13 states and 1156 transitions. [2021-12-22 13:32:54,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 151 transitions, 1193 flow [2021-12-22 13:32:54,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 151 transitions, 1021 flow, removed 76 selfloop flow, removed 13 redundant places. [2021-12-22 13:32:54,070 INFO L242 Difference]: Finished difference. Result has 150 places, 118 transitions, 589 flow [2021-12-22 13:32:54,070 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=589, PETRI_PLACES=150, PETRI_TRANSITIONS=118} [2021-12-22 13:32:54,070 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 31 predicate places. [2021-12-22 13:32:54,071 INFO L470 AbstractCegarLoop]: Abstraction has has 150 places, 118 transitions, 589 flow [2021-12-22 13:32:54,071 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 85.83333333333333) internal successors, (1030), 12 states have internal predecessors, (1030), 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-22 13:32:54,071 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:32:54,071 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-22 13:32:54,072 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-22 13:32:54,072 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:32:54,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:32:54,072 INFO L85 PathProgramCache]: Analyzing trace with hash -78862206, now seen corresponding path program 1 times [2021-12-22 13:32:54,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:32:54,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032336290] [2021-12-22 13:32:54,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:32:54,073 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:32:54,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:32:54,373 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-22 13:32:54,374 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:32:54,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032336290] [2021-12-22 13:32:54,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032336290] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:32:54,374 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:32:54,374 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-12-22 13:32:54,374 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146538005] [2021-12-22 13:32:54,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:32:54,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-22 13:32:54,375 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:32:54,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-22 13:32:54,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2021-12-22 13:32:54,377 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 114 [2021-12-22 13:32:54,378 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 118 transitions, 589 flow. Second operand has 16 states, 16 states have (on average 84.5) internal successors, (1352), 16 states have internal predecessors, (1352), 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-22 13:32:54,378 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:32:54,378 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 114 [2021-12-22 13:32:54,378 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:32:55,392 INFO L129 PetriNetUnfolder]: 536/1585 cut-off events. [2021-12-22 13:32:55,392 INFO L130 PetriNetUnfolder]: For 13063/14663 co-relation queries the response was YES. [2021-12-22 13:32:55,399 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7758 conditions, 1585 events. 536/1585 cut-off events. For 13063/14663 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 11961 event pairs, 57 based on Foata normal form. 111/1586 useless extension candidates. Maximal degree in co-relation 7669. Up to 536 conditions per place. [2021-12-22 13:32:55,404 INFO L132 encePairwiseOnDemand]: 97/114 looper letters, 35 selfloop transitions, 23 changer transitions 52/181 dead transitions. [2021-12-22 13:32:55,405 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 181 transitions, 1517 flow [2021-12-22 13:32:55,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-22 13:32:55,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2021-12-22 13:32:55,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1661 transitions. [2021-12-22 13:32:55,408 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7668513388734995 [2021-12-22 13:32:55,408 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1661 transitions. [2021-12-22 13:32:55,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1661 transitions. [2021-12-22 13:32:55,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:32:55,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1661 transitions. [2021-12-22 13:32:55,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 87.42105263157895) internal successors, (1661), 19 states have internal predecessors, (1661), 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-22 13:32:55,414 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 114.0) internal successors, (2280), 20 states have internal predecessors, (2280), 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-22 13:32:55,414 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 114.0) internal successors, (2280), 20 states have internal predecessors, (2280), 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-22 13:32:55,414 INFO L186 Difference]: Start difference. First operand has 150 places, 118 transitions, 589 flow. Second operand 19 states and 1661 transitions. [2021-12-22 13:32:55,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 181 transitions, 1517 flow [2021-12-22 13:32:55,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 181 transitions, 1398 flow, removed 52 selfloop flow, removed 10 redundant places. [2021-12-22 13:32:55,430 INFO L242 Difference]: Finished difference. Result has 163 places, 124 transitions, 740 flow [2021-12-22 13:32:55,430 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=740, PETRI_PLACES=163, PETRI_TRANSITIONS=124} [2021-12-22 13:32:55,430 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 44 predicate places. [2021-12-22 13:32:55,431 INFO L470 AbstractCegarLoop]: Abstraction has has 163 places, 124 transitions, 740 flow [2021-12-22 13:32:55,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 84.5) internal successors, (1352), 16 states have internal predecessors, (1352), 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-22 13:32:55,431 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:32:55,431 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-22 13:32:55,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-22 13:32:55,432 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:32:55,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:32:55,432 INFO L85 PathProgramCache]: Analyzing trace with hash 529644052, now seen corresponding path program 2 times [2021-12-22 13:32:55,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:32:55,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460785679] [2021-12-22 13:32:55,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:32:55,433 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:32:55,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:32:55,625 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-22 13:32:55,626 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:32:55,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460785679] [2021-12-22 13:32:55,626 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460785679] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:32:55,626 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:32:55,626 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-22 13:32:55,626 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920443904] [2021-12-22 13:32:55,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:32:55,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-22 13:32:55,627 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:32:55,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-22 13:32:55,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-12-22 13:32:55,628 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 114 [2021-12-22 13:32:55,629 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 124 transitions, 740 flow. Second operand has 10 states, 10 states have (on average 85.4) internal successors, (854), 10 states have internal predecessors, (854), 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-22 13:32:55,629 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:32:55,629 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 114 [2021-12-22 13:32:55,629 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:32:56,170 INFO L129 PetriNetUnfolder]: 481/1417 cut-off events. [2021-12-22 13:32:56,170 INFO L130 PetriNetUnfolder]: For 15430/17838 co-relation queries the response was YES. [2021-12-22 13:32:56,180 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8346 conditions, 1417 events. 481/1417 cut-off events. For 15430/17838 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 10262 event pairs, 102 based on Foata normal form. 85/1388 useless extension candidates. Maximal degree in co-relation 8250. Up to 625 conditions per place. [2021-12-22 13:32:56,192 INFO L132 encePairwiseOnDemand]: 103/114 looper letters, 53 selfloop transitions, 29 changer transitions 20/173 dead transitions. [2021-12-22 13:32:56,193 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 173 transitions, 1713 flow [2021-12-22 13:32:56,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-22 13:32:56,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-22 13:32:56,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 970 transitions. [2021-12-22 13:32:56,197 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.773524720893142 [2021-12-22 13:32:56,197 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 970 transitions. [2021-12-22 13:32:56,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 970 transitions. [2021-12-22 13:32:56,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:32:56,198 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 970 transitions. [2021-12-22 13:32:56,200 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 88.18181818181819) internal successors, (970), 11 states have internal predecessors, (970), 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-22 13:32:56,201 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:32:56,202 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:32:56,202 INFO L186 Difference]: Start difference. First operand has 163 places, 124 transitions, 740 flow. Second operand 11 states and 970 transitions. [2021-12-22 13:32:56,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 173 transitions, 1713 flow [2021-12-22 13:32:56,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 173 transitions, 1499 flow, removed 87 selfloop flow, removed 14 redundant places. [2021-12-22 13:32:56,219 INFO L242 Difference]: Finished difference. Result has 155 places, 143 transitions, 1035 flow [2021-12-22 13:32:56,220 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1035, PETRI_PLACES=155, PETRI_TRANSITIONS=143} [2021-12-22 13:32:56,222 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 36 predicate places. [2021-12-22 13:32:56,222 INFO L470 AbstractCegarLoop]: Abstraction has has 155 places, 143 transitions, 1035 flow [2021-12-22 13:32:56,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 85.4) internal successors, (854), 10 states have internal predecessors, (854), 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-22 13:32:56,225 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:32:56,225 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-22 13:32:56,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-22 13:32:56,225 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:32:56,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:32:56,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1019708772, now seen corresponding path program 3 times [2021-12-22 13:32:56,226 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:32:56,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896458484] [2021-12-22 13:32:56,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:32:56,226 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:32:56,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:32:56,521 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-22 13:32:56,522 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:32:56,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896458484] [2021-12-22 13:32:56,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896458484] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:32:56,522 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:32:56,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-12-22 13:32:56,523 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513666228] [2021-12-22 13:32:56,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:32:56,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-22 13:32:56,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:32:56,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-22 13:32:56,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2021-12-22 13:32:56,525 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 114 [2021-12-22 13:32:56,526 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 143 transitions, 1035 flow. Second operand has 16 states, 16 states have (on average 83.5625) internal successors, (1337), 16 states have internal predecessors, (1337), 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-22 13:32:56,526 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:32:56,526 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 114 [2021-12-22 13:32:56,526 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:32:57,179 INFO L129 PetriNetUnfolder]: 471/1418 cut-off events. [2021-12-22 13:32:57,179 INFO L130 PetriNetUnfolder]: For 12982/16946 co-relation queries the response was YES. [2021-12-22 13:32:57,185 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8002 conditions, 1418 events. 471/1418 cut-off events. For 12982/16946 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 10249 event pairs, 87 based on Foata normal form. 98/1394 useless extension candidates. Maximal degree in co-relation 7910. Up to 562 conditions per place. [2021-12-22 13:32:57,189 INFO L132 encePairwiseOnDemand]: 99/114 looper letters, 50 selfloop transitions, 29 changer transitions 33/182 dead transitions. [2021-12-22 13:32:57,190 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 182 transitions, 1745 flow [2021-12-22 13:32:57,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-22 13:32:57,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2021-12-22 13:32:57,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1548 transitions. [2021-12-22 13:32:57,192 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7543859649122807 [2021-12-22 13:32:57,192 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1548 transitions. [2021-12-22 13:32:57,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1548 transitions. [2021-12-22 13:32:57,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:32:57,193 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1548 transitions. [2021-12-22 13:32:57,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 86.0) internal successors, (1548), 18 states have internal predecessors, (1548), 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-22 13:32:57,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 114.0) internal successors, (2166), 19 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:32:57,197 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 114.0) internal successors, (2166), 19 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:32:57,198 INFO L186 Difference]: Start difference. First operand has 155 places, 143 transitions, 1035 flow. Second operand 18 states and 1548 transitions. [2021-12-22 13:32:57,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 182 transitions, 1745 flow [2021-12-22 13:32:57,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 182 transitions, 1692 flow, removed 25 selfloop flow, removed 5 redundant places. [2021-12-22 13:32:57,209 INFO L242 Difference]: Finished difference. Result has 170 places, 140 transitions, 1032 flow [2021-12-22 13:32:57,210 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1006, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1032, PETRI_PLACES=170, PETRI_TRANSITIONS=140} [2021-12-22 13:32:57,210 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 51 predicate places. [2021-12-22 13:32:57,210 INFO L470 AbstractCegarLoop]: Abstraction has has 170 places, 140 transitions, 1032 flow [2021-12-22 13:32:57,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 83.5625) internal successors, (1337), 16 states have internal predecessors, (1337), 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-22 13:32:57,211 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:32:57,211 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-22 13:32:57,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-22 13:32:57,211 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:32:57,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:32:57,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1125697522, now seen corresponding path program 4 times [2021-12-22 13:32:57,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:32:57,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746510935] [2021-12-22 13:32:57,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:32:57,212 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:32:57,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:32:57,454 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-22 13:32:57,454 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:32:57,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746510935] [2021-12-22 13:32:57,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746510935] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:32:57,455 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:32:57,455 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-22 13:32:57,455 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114036556] [2021-12-22 13:32:57,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:32:57,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-22 13:32:57,455 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:32:57,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-22 13:32:57,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-12-22 13:32:57,456 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 114 [2021-12-22 13:32:57,457 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 140 transitions, 1032 flow. Second operand has 10 states, 10 states have (on average 88.1) internal successors, (881), 10 states have internal predecessors, (881), 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-22 13:32:57,457 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:32:57,457 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 114 [2021-12-22 13:32:57,457 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:32:58,120 INFO L129 PetriNetUnfolder]: 450/1402 cut-off events. [2021-12-22 13:32:58,120 INFO L130 PetriNetUnfolder]: For 15629/21494 co-relation queries the response was YES. [2021-12-22 13:32:58,127 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8149 conditions, 1402 events. 450/1402 cut-off events. For 15629/21494 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 10291 event pairs, 67 based on Foata normal form. 62/1358 useless extension candidates. Maximal degree in co-relation 8052. Up to 554 conditions per place. [2021-12-22 13:32:58,146 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 56 selfloop transitions, 22 changer transitions 21/173 dead transitions. [2021-12-22 13:32:58,146 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 173 transitions, 1728 flow [2021-12-22 13:32:58,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-22 13:32:58,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-12-22 13:32:58,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1086 transitions. [2021-12-22 13:32:58,149 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.793859649122807 [2021-12-22 13:32:58,149 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1086 transitions. [2021-12-22 13:32:58,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1086 transitions. [2021-12-22 13:32:58,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:32:58,149 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1086 transitions. [2021-12-22 13:32:58,156 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 90.5) internal successors, (1086), 12 states have internal predecessors, (1086), 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-22 13:32:58,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 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-22 13:32:58,160 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 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-22 13:32:58,160 INFO L186 Difference]: Start difference. First operand has 170 places, 140 transitions, 1032 flow. Second operand 12 states and 1086 transitions. [2021-12-22 13:32:58,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 173 transitions, 1728 flow [2021-12-22 13:32:58,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 173 transitions, 1586 flow, removed 41 selfloop flow, removed 17 redundant places. [2021-12-22 13:32:58,182 INFO L242 Difference]: Finished difference. Result has 163 places, 146 transitions, 1156 flow [2021-12-22 13:32:58,183 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=944, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1156, PETRI_PLACES=163, PETRI_TRANSITIONS=146} [2021-12-22 13:32:58,185 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 44 predicate places. [2021-12-22 13:32:58,185 INFO L470 AbstractCegarLoop]: Abstraction has has 163 places, 146 transitions, 1156 flow [2021-12-22 13:32:58,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 88.1) internal successors, (881), 10 states have internal predecessors, (881), 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-22 13:32:58,185 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:32:58,185 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-22 13:32:58,186 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-22 13:32:58,187 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:32:58,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:32:58,188 INFO L85 PathProgramCache]: Analyzing trace with hash -2046886782, now seen corresponding path program 5 times [2021-12-22 13:32:58,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:32:58,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394483602] [2021-12-22 13:32:58,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:32:58,188 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:32:58,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:32:58,519 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-22 13:32:58,520 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:32:58,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394483602] [2021-12-22 13:32:58,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394483602] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:32:58,520 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:32:58,520 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-12-22 13:32:58,520 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538879695] [2021-12-22 13:32:58,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:32:58,521 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-22 13:32:58,522 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:32:58,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-22 13:32:58,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2021-12-22 13:32:58,525 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 114 [2021-12-22 13:32:58,526 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 146 transitions, 1156 flow. Second operand has 16 states, 16 states have (on average 81.6875) internal successors, (1307), 16 states have internal predecessors, (1307), 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-22 13:32:58,526 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:32:58,526 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 114 [2021-12-22 13:32:58,527 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:32:59,245 INFO L129 PetriNetUnfolder]: 404/1355 cut-off events. [2021-12-22 13:32:59,246 INFO L130 PetriNetUnfolder]: For 14404/21448 co-relation queries the response was YES. [2021-12-22 13:32:59,253 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7853 conditions, 1355 events. 404/1355 cut-off events. For 14404/21448 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 10735 event pairs, 73 based on Foata normal form. 76/1328 useless extension candidates. Maximal degree in co-relation 7754. Up to 421 conditions per place. [2021-12-22 13:32:59,277 INFO L132 encePairwiseOnDemand]: 101/114 looper letters, 55 selfloop transitions, 19 changer transitions 42/184 dead transitions. [2021-12-22 13:32:59,278 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 184 transitions, 1899 flow [2021-12-22 13:32:59,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-22 13:32:59,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-12-22 13:32:59,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1429 transitions. [2021-12-22 13:32:59,280 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.737358101135191 [2021-12-22 13:32:59,280 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1429 transitions. [2021-12-22 13:32:59,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1429 transitions. [2021-12-22 13:32:59,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:32:59,280 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1429 transitions. [2021-12-22 13:32:59,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 84.05882352941177) internal successors, (1429), 17 states have internal predecessors, (1429), 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-22 13:32:59,284 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 114.0) internal successors, (2052), 18 states have internal predecessors, (2052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:32:59,284 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 114.0) internal successors, (2052), 18 states have internal predecessors, (2052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:32:59,284 INFO L186 Difference]: Start difference. First operand has 163 places, 146 transitions, 1156 flow. Second operand 17 states and 1429 transitions. [2021-12-22 13:32:59,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 184 transitions, 1899 flow [2021-12-22 13:32:59,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 184 transitions, 1800 flow, removed 43 selfloop flow, removed 10 redundant places. [2021-12-22 13:32:59,325 INFO L242 Difference]: Finished difference. Result has 171 places, 135 transitions, 962 flow [2021-12-22 13:32:59,325 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1109, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=962, PETRI_PLACES=171, PETRI_TRANSITIONS=135} [2021-12-22 13:32:59,326 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 52 predicate places. [2021-12-22 13:32:59,326 INFO L470 AbstractCegarLoop]: Abstraction has has 171 places, 135 transitions, 962 flow [2021-12-22 13:32:59,326 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 81.6875) internal successors, (1307), 16 states have internal predecessors, (1307), 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-22 13:32:59,326 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:32:59,326 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-22 13:32:59,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-22 13:32:59,327 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:32:59,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:32:59,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1955626832, now seen corresponding path program 1 times [2021-12-22 13:32:59,327 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:32:59,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338852441] [2021-12-22 13:32:59,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:32:59,328 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:32:59,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:32:59,399 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-22 13:32:59,400 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:32:59,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338852441] [2021-12-22 13:32:59,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338852441] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:32:59,400 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:32:59,400 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 13:32:59,400 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295415948] [2021-12-22 13:32:59,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:32:59,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 13:32:59,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:32:59,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 13:32:59,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 13:32:59,402 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 114 [2021-12-22 13:32:59,402 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 135 transitions, 962 flow. Second operand has 6 states, 6 states have (on average 90.66666666666667) internal successors, (544), 6 states have internal predecessors, (544), 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-22 13:32:59,402 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:32:59,402 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 114 [2021-12-22 13:32:59,402 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:33:00,435 INFO L129 PetriNetUnfolder]: 3251/6195 cut-off events. [2021-12-22 13:33:00,435 INFO L130 PetriNetUnfolder]: For 57011/57286 co-relation queries the response was YES. [2021-12-22 13:33:00,460 INFO L84 FinitePrefix]: Finished finitePrefix Result has 29199 conditions, 6195 events. 3251/6195 cut-off events. For 57011/57286 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 47458 event pairs, 102 based on Foata normal form. 150/6126 useless extension candidates. Maximal degree in co-relation 29107. Up to 1875 conditions per place. [2021-12-22 13:33:00,472 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 74 selfloop transitions, 6 changer transitions 158/314 dead transitions. [2021-12-22 13:33:00,473 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 314 transitions, 3697 flow [2021-12-22 13:33:00,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 13:33:00,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-22 13:33:00,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 978 transitions. [2021-12-22 13:33:00,475 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8578947368421053 [2021-12-22 13:33:00,475 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 978 transitions. [2021-12-22 13:33:00,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 978 transitions. [2021-12-22 13:33:00,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:33:00,475 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 978 transitions. [2021-12-22 13:33:00,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 97.8) internal successors, (978), 10 states have internal predecessors, (978), 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-22 13:33:00,478 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:33:00,478 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:33:00,478 INFO L186 Difference]: Start difference. First operand has 171 places, 135 transitions, 962 flow. Second operand 10 states and 978 transitions. [2021-12-22 13:33:00,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 314 transitions, 3697 flow [2021-12-22 13:33:00,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 314 transitions, 3462 flow, removed 39 selfloop flow, removed 20 redundant places. [2021-12-22 13:33:00,503 INFO L242 Difference]: Finished difference. Result has 158 places, 128 transitions, 787 flow [2021-12-22 13:33:00,503 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=881, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=787, PETRI_PLACES=158, PETRI_TRANSITIONS=128} [2021-12-22 13:33:00,504 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 39 predicate places. [2021-12-22 13:33:00,504 INFO L470 AbstractCegarLoop]: Abstraction has has 158 places, 128 transitions, 787 flow [2021-12-22 13:33:00,504 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.66666666666667) internal successors, (544), 6 states have internal predecessors, (544), 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-22 13:33:00,504 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:33:00,504 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-22 13:33:00,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-22 13:33:00,504 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:33:00,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:33:00,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1706371020, now seen corresponding path program 1 times [2021-12-22 13:33:00,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:33:00,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696548975] [2021-12-22 13:33:00,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:33:00,506 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:33:00,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:33:00,604 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-22 13:33:00,605 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:33:00,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696548975] [2021-12-22 13:33:00,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696548975] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:33:00,605 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:33:00,605 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-22 13:33:00,605 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280767326] [2021-12-22 13:33:00,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:33:00,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 13:33:00,606 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:33:00,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 13:33:00,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-22 13:33:00,607 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 114 [2021-12-22 13:33:00,607 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 128 transitions, 787 flow. Second operand has 7 states, 7 states have (on average 90.42857142857143) internal successors, (633), 7 states have internal predecessors, (633), 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-22 13:33:00,607 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:33:00,607 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 114 [2021-12-22 13:33:00,607 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:33:01,172 INFO L129 PetriNetUnfolder]: 1090/2610 cut-off events. [2021-12-22 13:33:01,173 INFO L130 PetriNetUnfolder]: For 20824/20913 co-relation queries the response was YES. [2021-12-22 13:33:01,199 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12863 conditions, 2610 events. 1090/2610 cut-off events. For 20824/20913 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 19592 event pairs, 21 based on Foata normal form. 132/2713 useless extension candidates. Maximal degree in co-relation 12780. Up to 663 conditions per place. [2021-12-22 13:33:01,203 INFO L132 encePairwiseOnDemand]: 105/114 looper letters, 59 selfloop transitions, 9 changer transitions 112/256 dead transitions. [2021-12-22 13:33:01,203 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 256 transitions, 2845 flow [2021-12-22 13:33:01,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 13:33:01,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-22 13:33:01,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 976 transitions. [2021-12-22 13:33:01,208 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.856140350877193 [2021-12-22 13:33:01,208 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 976 transitions. [2021-12-22 13:33:01,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 976 transitions. [2021-12-22 13:33:01,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:33:01,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 976 transitions. [2021-12-22 13:33:01,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 97.6) internal successors, (976), 10 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:33:01,213 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:33:01,214 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:33:01,214 INFO L186 Difference]: Start difference. First operand has 158 places, 128 transitions, 787 flow. Second operand 10 states and 976 transitions. [2021-12-22 13:33:01,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 256 transitions, 2845 flow [2021-12-22 13:33:01,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 256 transitions, 2760 flow, removed 15 selfloop flow, removed 6 redundant places. [2021-12-22 13:33:01,232 INFO L242 Difference]: Finished difference. Result has 161 places, 120 transitions, 692 flow [2021-12-22 13:33:01,233 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=716, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=692, PETRI_PLACES=161, PETRI_TRANSITIONS=120} [2021-12-22 13:33:01,233 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 42 predicate places. [2021-12-22 13:33:01,233 INFO L470 AbstractCegarLoop]: Abstraction has has 161 places, 120 transitions, 692 flow [2021-12-22 13:33:01,234 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.42857142857143) internal successors, (633), 7 states have internal predecessors, (633), 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-22 13:33:01,234 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:33:01,234 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-22 13:33:01,234 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-22 13:33:01,234 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:33:01,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:33:01,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1896302775, now seen corresponding path program 1 times [2021-12-22 13:33:01,235 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:33:01,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591881879] [2021-12-22 13:33:01,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:33:01,235 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:33:01,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:33:01,422 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-22 13:33:01,422 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:33:01,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591881879] [2021-12-22 13:33:01,424 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591881879] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:33:01,424 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:33:01,424 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-22 13:33:01,424 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274333329] [2021-12-22 13:33:01,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:33:01,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-22 13:33:01,425 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:33:01,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-22 13:33:01,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-12-22 13:33:01,427 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 114 [2021-12-22 13:33:01,427 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 120 transitions, 692 flow. Second operand has 10 states, 10 states have (on average 85.5) internal successors, (855), 10 states have internal predecessors, (855), 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-22 13:33:01,427 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:33:01,427 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 114 [2021-12-22 13:33:01,428 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:33:01,995 INFO L129 PetriNetUnfolder]: 221/1170 cut-off events. [2021-12-22 13:33:01,996 INFO L130 PetriNetUnfolder]: For 5726/5974 co-relation queries the response was YES. [2021-12-22 13:33:02,002 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4731 conditions, 1170 events. 221/1170 cut-off events. For 5726/5974 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 9242 event pairs, 43 based on Foata normal form. 56/1192 useless extension candidates. Maximal degree in co-relation 4636. Up to 274 conditions per place. [2021-12-22 13:33:02,004 INFO L132 encePairwiseOnDemand]: 102/114 looper letters, 44 selfloop transitions, 17 changer transitions 12/149 dead transitions. [2021-12-22 13:33:02,005 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 149 transitions, 1082 flow [2021-12-22 13:33:02,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-22 13:33:02,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-22 13:33:02,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1141 transitions. [2021-12-22 13:33:02,006 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7699055330634278 [2021-12-22 13:33:02,007 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1141 transitions. [2021-12-22 13:33:02,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1141 transitions. [2021-12-22 13:33:02,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:33:02,007 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1141 transitions. [2021-12-22 13:33:02,008 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 87.76923076923077) internal successors, (1141), 13 states have internal predecessors, (1141), 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-22 13:33:02,010 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:33:02,010 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:33:02,010 INFO L186 Difference]: Start difference. First operand has 161 places, 120 transitions, 692 flow. Second operand 13 states and 1141 transitions. [2021-12-22 13:33:02,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 149 transitions, 1082 flow [2021-12-22 13:33:02,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 149 transitions, 968 flow, removed 36 selfloop flow, removed 15 redundant places. [2021-12-22 13:33:02,024 INFO L242 Difference]: Finished difference. Result has 162 places, 125 transitions, 725 flow [2021-12-22 13:33:02,024 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=600, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=725, PETRI_PLACES=162, PETRI_TRANSITIONS=125} [2021-12-22 13:33:02,025 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 43 predicate places. [2021-12-22 13:33:02,025 INFO L470 AbstractCegarLoop]: Abstraction has has 162 places, 125 transitions, 725 flow [2021-12-22 13:33:02,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 85.5) internal successors, (855), 10 states have internal predecessors, (855), 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-22 13:33:02,025 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:33:02,025 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-22 13:33:02,026 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-22 13:33:02,026 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:33:02,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:33:02,026 INFO L85 PathProgramCache]: Analyzing trace with hash -167958605, now seen corresponding path program 2 times [2021-12-22 13:33:02,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:33:02,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171795785] [2021-12-22 13:33:02,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:33:02,027 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:33:02,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:33:02,153 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-22 13:33:02,154 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:33:02,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171795785] [2021-12-22 13:33:02,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171795785] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:33:02,154 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:33:02,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-22 13:33:02,154 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242945272] [2021-12-22 13:33:02,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:33:02,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 13:33:02,155 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:33:02,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 13:33:02,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-12-22 13:33:02,156 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 114 [2021-12-22 13:33:02,156 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 125 transitions, 725 flow. Second operand has 9 states, 9 states have (on average 88.44444444444444) internal successors, (796), 9 states have internal predecessors, (796), 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-22 13:33:02,156 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:33:02,156 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 114 [2021-12-22 13:33:02,156 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:33:02,509 INFO L129 PetriNetUnfolder]: 245/1356 cut-off events. [2021-12-22 13:33:02,509 INFO L130 PetriNetUnfolder]: For 5225/5401 co-relation queries the response was YES. [2021-12-22 13:33:02,516 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4510 conditions, 1356 events. 245/1356 cut-off events. For 5225/5401 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 11392 event pairs, 40 based on Foata normal form. 48/1366 useless extension candidates. Maximal degree in co-relation 4420. Up to 278 conditions per place. [2021-12-22 13:33:02,518 INFO L132 encePairwiseOnDemand]: 103/114 looper letters, 43 selfloop transitions, 11 changer transitions 12/145 dead transitions. [2021-12-22 13:33:02,519 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 145 transitions, 1053 flow [2021-12-22 13:33:02,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-22 13:33:02,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-12-22 13:33:02,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1080 transitions. [2021-12-22 13:33:02,521 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7894736842105263 [2021-12-22 13:33:02,521 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1080 transitions. [2021-12-22 13:33:02,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1080 transitions. [2021-12-22 13:33:02,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:33:02,521 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1080 transitions. [2021-12-22 13:33:02,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 90.0) internal successors, (1080), 12 states have internal predecessors, (1080), 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-22 13:33:02,524 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 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-22 13:33:02,524 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 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-22 13:33:02,524 INFO L186 Difference]: Start difference. First operand has 162 places, 125 transitions, 725 flow. Second operand 12 states and 1080 transitions. [2021-12-22 13:33:02,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 145 transitions, 1053 flow [2021-12-22 13:33:02,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 145 transitions, 988 flow, removed 26 selfloop flow, removed 9 redundant places. [2021-12-22 13:33:02,532 INFO L242 Difference]: Finished difference. Result has 165 places, 127 transitions, 764 flow [2021-12-22 13:33:02,533 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=764, PETRI_PLACES=165, PETRI_TRANSITIONS=127} [2021-12-22 13:33:02,533 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 46 predicate places. [2021-12-22 13:33:02,533 INFO L470 AbstractCegarLoop]: Abstraction has has 165 places, 127 transitions, 764 flow [2021-12-22 13:33:02,533 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 88.44444444444444) internal successors, (796), 9 states have internal predecessors, (796), 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-22 13:33:02,533 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:33:02,534 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-22 13:33:02,534 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-22 13:33:02,534 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:33:02,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:33:02,534 INFO L85 PathProgramCache]: Analyzing trace with hash 435034293, now seen corresponding path program 3 times [2021-12-22 13:33:02,534 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:33:02,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481022150] [2021-12-22 13:33:02,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:33:02,535 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:33:02,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:33:02,628 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-22 13:33:02,628 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:33:02,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481022150] [2021-12-22 13:33:02,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481022150] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:33:02,629 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:33:02,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 13:33:02,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073787012] [2021-12-22 13:33:02,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:33:02,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 13:33:02,629 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:33:02,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 13:33:02,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-22 13:33:02,630 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 114 [2021-12-22 13:33:02,631 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 127 transitions, 764 flow. Second operand has 8 states, 8 states have (on average 90.375) internal successors, (723), 8 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:33:02,631 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:33:02,631 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 114 [2021-12-22 13:33:02,631 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:33:02,957 INFO L129 PetriNetUnfolder]: 374/1368 cut-off events. [2021-12-22 13:33:02,957 INFO L130 PetriNetUnfolder]: For 11046/11173 co-relation queries the response was YES. [2021-12-22 13:33:02,963 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5839 conditions, 1368 events. 374/1368 cut-off events. For 11046/11173 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 10896 event pairs, 3 based on Foata normal form. 72/1431 useless extension candidates. Maximal degree in co-relation 5802. Up to 287 conditions per place. [2021-12-22 13:33:02,966 INFO L132 encePairwiseOnDemand]: 105/114 looper letters, 50 selfloop transitions, 12 changer transitions 46/185 dead transitions. [2021-12-22 13:33:02,966 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 185 transitions, 1841 flow [2021-12-22 13:33:02,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-22 13:33:02,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-22 13:33:02,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1032 transitions. [2021-12-22 13:33:02,968 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8229665071770335 [2021-12-22 13:33:02,968 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1032 transitions. [2021-12-22 13:33:02,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1032 transitions. [2021-12-22 13:33:02,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:33:02,969 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1032 transitions. [2021-12-22 13:33:02,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 93.81818181818181) internal successors, (1032), 11 states have internal predecessors, (1032), 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-22 13:33:02,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:33:02,972 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:33:02,972 INFO L186 Difference]: Start difference. First operand has 165 places, 127 transitions, 764 flow. Second operand 11 states and 1032 transitions. [2021-12-22 13:33:02,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 185 transitions, 1841 flow [2021-12-22 13:33:02,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 185 transitions, 1490 flow, removed 140 selfloop flow, removed 15 redundant places. [2021-12-22 13:33:02,985 INFO L242 Difference]: Finished difference. Result has 160 places, 123 transitions, 641 flow [2021-12-22 13:33:02,986 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=641, PETRI_PLACES=160, PETRI_TRANSITIONS=123} [2021-12-22 13:33:02,986 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 41 predicate places. [2021-12-22 13:33:02,986 INFO L470 AbstractCegarLoop]: Abstraction has has 160 places, 123 transitions, 641 flow [2021-12-22 13:33:02,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 90.375) internal successors, (723), 8 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:33:02,987 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:33:02,987 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:33:02,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-22 13:33:02,987 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:33:02,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:33:02,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1412627892, now seen corresponding path program 1 times [2021-12-22 13:33:02,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:33:02,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142758445] [2021-12-22 13:33:02,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:33:02,988 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:33:03,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:33:03,266 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-22 13:33:03,266 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:33:03,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142758445] [2021-12-22 13:33:03,267 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142758445] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:33:03,267 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:33:03,267 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-12-22 13:33:03,267 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589635781] [2021-12-22 13:33:03,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:33:03,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-22 13:33:03,267 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:33:03,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-22 13:33:03,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2021-12-22 13:33:03,268 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 114 [2021-12-22 13:33:03,269 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 123 transitions, 641 flow. Second operand has 17 states, 17 states have (on average 83.58823529411765) internal successors, (1421), 17 states have internal predecessors, (1421), 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-22 13:33:03,269 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:33:03,269 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 114 [2021-12-22 13:33:03,269 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:33:03,563 INFO L129 PetriNetUnfolder]: 95/674 cut-off events. [2021-12-22 13:33:03,563 INFO L130 PetriNetUnfolder]: For 2077/2192 co-relation queries the response was YES. [2021-12-22 13:33:03,566 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2196 conditions, 674 events. 95/674 cut-off events. For 2077/2192 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 5018 event pairs, 2 based on Foata normal form. 18/675 useless extension candidates. Maximal degree in co-relation 2105. Up to 133 conditions per place. [2021-12-22 13:33:03,567 INFO L132 encePairwiseOnDemand]: 97/114 looper letters, 32 selfloop transitions, 13 changer transitions 13/133 dead transitions. [2021-12-22 13:33:03,567 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 133 transitions, 809 flow [2021-12-22 13:33:03,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-22 13:33:03,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-12-22 13:33:03,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1275 transitions. [2021-12-22 13:33:03,569 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7456140350877193 [2021-12-22 13:33:03,569 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1275 transitions. [2021-12-22 13:33:03,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1275 transitions. [2021-12-22 13:33:03,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:33:03,569 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1275 transitions. [2021-12-22 13:33:03,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 85.0) internal successors, (1275), 15 states have internal predecessors, (1275), 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-22 13:33:03,572 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:33:03,573 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:33:03,573 INFO L186 Difference]: Start difference. First operand has 160 places, 123 transitions, 641 flow. Second operand 15 states and 1275 transitions. [2021-12-22 13:33:03,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 133 transitions, 809 flow [2021-12-22 13:33:03,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 133 transitions, 685 flow, removed 43 selfloop flow, removed 18 redundant places. [2021-12-22 13:33:03,580 INFO L242 Difference]: Finished difference. Result has 158 places, 119 transitions, 522 flow [2021-12-22 13:33:03,580 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=522, PETRI_PLACES=158, PETRI_TRANSITIONS=119} [2021-12-22 13:33:03,580 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 39 predicate places. [2021-12-22 13:33:03,580 INFO L470 AbstractCegarLoop]: Abstraction has has 158 places, 119 transitions, 522 flow [2021-12-22 13:33:03,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 83.58823529411765) internal successors, (1421), 17 states have internal predecessors, (1421), 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-22 13:33:03,581 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:33:03,581 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:33:03,581 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-22 13:33:03,581 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:33:03,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:33:03,582 INFO L85 PathProgramCache]: Analyzing trace with hash -531343430, now seen corresponding path program 2 times [2021-12-22 13:33:03,582 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:33:03,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218337570] [2021-12-22 13:33:03,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:33:03,582 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:33:03,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:33:03,771 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-22 13:33:03,771 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:33:03,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218337570] [2021-12-22 13:33:03,771 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218337570] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:33:03,771 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:33:03,772 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-22 13:33:03,772 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518903190] [2021-12-22 13:33:03,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:33:03,772 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-22 13:33:03,772 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:33:03,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-22 13:33:03,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-12-22 13:33:03,773 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 114 [2021-12-22 13:33:03,774 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 119 transitions, 522 flow. Second operand has 11 states, 11 states have (on average 85.36363636363636) internal successors, (939), 11 states have internal predecessors, (939), 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-22 13:33:03,774 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:33:03,774 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 114 [2021-12-22 13:33:03,774 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:33:04,027 INFO L129 PetriNetUnfolder]: 93/662 cut-off events. [2021-12-22 13:33:04,027 INFO L130 PetriNetUnfolder]: For 841/890 co-relation queries the response was YES. [2021-12-22 13:33:04,030 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1500 conditions, 662 events. 93/662 cut-off events. For 841/890 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4847 event pairs, 2 based on Foata normal form. 9/654 useless extension candidates. Maximal degree in co-relation 1475. Up to 92 conditions per place. [2021-12-22 13:33:04,031 INFO L132 encePairwiseOnDemand]: 101/114 looper letters, 29 selfloop transitions, 15 changer transitions 13/132 dead transitions. [2021-12-22 13:33:04,031 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 132 transitions, 736 flow [2021-12-22 13:33:04,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-22 13:33:04,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-22 13:33:04,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 957 transitions. [2021-12-22 13:33:04,033 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7631578947368421 [2021-12-22 13:33:04,033 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 957 transitions. [2021-12-22 13:33:04,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 957 transitions. [2021-12-22 13:33:04,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:33:04,033 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 957 transitions. [2021-12-22 13:33:04,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 87.0) internal successors, (957), 11 states have internal predecessors, (957), 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-22 13:33:04,036 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:33:04,036 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:33:04,036 INFO L186 Difference]: Start difference. First operand has 158 places, 119 transitions, 522 flow. Second operand 11 states and 957 transitions. [2021-12-22 13:33:04,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 132 transitions, 736 flow [2021-12-22 13:33:04,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 132 transitions, 662 flow, removed 22 selfloop flow, removed 15 redundant places. [2021-12-22 13:33:04,040 INFO L242 Difference]: Finished difference. Result has 151 places, 119 transitions, 523 flow [2021-12-22 13:33:04,040 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=523, PETRI_PLACES=151, PETRI_TRANSITIONS=119} [2021-12-22 13:33:04,041 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 32 predicate places. [2021-12-22 13:33:04,041 INFO L470 AbstractCegarLoop]: Abstraction has has 151 places, 119 transitions, 523 flow [2021-12-22 13:33:04,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 85.36363636363636) internal successors, (939), 11 states have internal predecessors, (939), 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-22 13:33:04,041 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:33:04,042 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:33:04,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-22 13:33:04,042 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:33:04,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:33:04,042 INFO L85 PathProgramCache]: Analyzing trace with hash -870122366, now seen corresponding path program 3 times [2021-12-22 13:33:04,042 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:33:04,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803060871] [2021-12-22 13:33:04,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:33:04,043 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:33:04,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:33:04,165 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-22 13:33:04,165 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:33:04,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803060871] [2021-12-22 13:33:04,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803060871] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:33:04,166 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:33:04,166 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 13:33:04,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998059162] [2021-12-22 13:33:04,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:33:04,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 13:33:04,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:33:04,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 13:33:04,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-22 13:33:04,167 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 114 [2021-12-22 13:33:04,168 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 119 transitions, 523 flow. Second operand has 8 states, 8 states have (on average 89.75) internal successors, (718), 8 states have internal predecessors, (718), 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-22 13:33:04,168 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:33:04,168 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 114 [2021-12-22 13:33:04,168 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:33:04,337 INFO L129 PetriNetUnfolder]: 45/393 cut-off events. [2021-12-22 13:33:04,337 INFO L130 PetriNetUnfolder]: For 546/559 co-relation queries the response was YES. [2021-12-22 13:33:04,339 INFO L84 FinitePrefix]: Finished finitePrefix Result has 906 conditions, 393 events. 45/393 cut-off events. For 546/559 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2146 event pairs, 2 based on Foata normal form. 9/395 useless extension candidates. Maximal degree in co-relation 881. Up to 65 conditions per place. [2021-12-22 13:33:04,339 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 30 selfloop transitions, 9 changer transitions 14/132 dead transitions. [2021-12-22 13:33:04,340 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 132 transitions, 743 flow [2021-12-22 13:33:04,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-22 13:33:04,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-22 13:33:04,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 820 transitions. [2021-12-22 13:33:04,341 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7992202729044834 [2021-12-22 13:33:04,341 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 820 transitions. [2021-12-22 13:33:04,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 820 transitions. [2021-12-22 13:33:04,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:33:04,341 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 820 transitions. [2021-12-22 13:33:04,342 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 91.11111111111111) internal successors, (820), 9 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:33:04,343 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:33:04,344 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:33:04,344 INFO L186 Difference]: Start difference. First operand has 151 places, 119 transitions, 523 flow. Second operand 9 states and 820 transitions. [2021-12-22 13:33:04,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 132 transitions, 743 flow [2021-12-22 13:33:04,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 132 transitions, 681 flow, removed 18 selfloop flow, removed 11 redundant places. [2021-12-22 13:33:04,347 INFO L242 Difference]: Finished difference. Result has 149 places, 118 transitions, 499 flow [2021-12-22 13:33:04,347 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=499, PETRI_PLACES=149, PETRI_TRANSITIONS=118} [2021-12-22 13:33:04,348 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 30 predicate places. [2021-12-22 13:33:04,348 INFO L470 AbstractCegarLoop]: Abstraction has has 149 places, 118 transitions, 499 flow [2021-12-22 13:33:04,348 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 89.75) internal successors, (718), 8 states have internal predecessors, (718), 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-22 13:33:04,348 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:33:04,348 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:33:04,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-22 13:33:04,349 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:33:04,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:33:04,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1328193492, now seen corresponding path program 4 times [2021-12-22 13:33:04,349 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:33:04,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185789101] [2021-12-22 13:33:04,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:33:04,350 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:33:04,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:33:04,523 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-22 13:33:04,523 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:33:04,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185789101] [2021-12-22 13:33:04,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185789101] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:33:04,524 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:33:04,524 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-22 13:33:04,524 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040840609] [2021-12-22 13:33:04,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:33:04,524 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-22 13:33:04,525 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:33:04,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-22 13:33:04,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-12-22 13:33:04,526 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 114 [2021-12-22 13:33:04,526 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 118 transitions, 499 flow. Second operand has 11 states, 11 states have (on average 87.18181818181819) internal successors, (959), 11 states have internal predecessors, (959), 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-22 13:33:04,526 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:33:04,526 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 114 [2021-12-22 13:33:04,526 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:33:04,742 INFO L129 PetriNetUnfolder]: 39/368 cut-off events. [2021-12-22 13:33:04,742 INFO L130 PetriNetUnfolder]: For 414/425 co-relation queries the response was YES. [2021-12-22 13:33:04,743 INFO L84 FinitePrefix]: Finished finitePrefix Result has 807 conditions, 368 events. 39/368 cut-off events. For 414/425 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1953 event pairs, 0 based on Foata normal form. 8/371 useless extension candidates. Maximal degree in co-relation 783. Up to 44 conditions per place. [2021-12-22 13:33:04,744 INFO L132 encePairwiseOnDemand]: 102/114 looper letters, 25 selfloop transitions, 10 changer transitions 20/131 dead transitions. [2021-12-22 13:33:04,744 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 131 transitions, 708 flow [2021-12-22 13:33:04,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-22 13:33:04,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-12-22 13:33:04,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1065 transitions. [2021-12-22 13:33:04,746 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7785087719298246 [2021-12-22 13:33:04,746 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1065 transitions. [2021-12-22 13:33:04,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1065 transitions. [2021-12-22 13:33:04,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:33:04,746 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1065 transitions. [2021-12-22 13:33:04,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 88.75) internal successors, (1065), 12 states have internal predecessors, (1065), 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-22 13:33:04,749 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 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-22 13:33:04,749 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 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-22 13:33:04,749 INFO L186 Difference]: Start difference. First operand has 149 places, 118 transitions, 499 flow. Second operand 12 states and 1065 transitions. [2021-12-22 13:33:04,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 131 transitions, 708 flow [2021-12-22 13:33:04,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 131 transitions, 618 flow, removed 24 selfloop flow, removed 11 redundant places. [2021-12-22 13:33:04,753 INFO L242 Difference]: Finished difference. Result has 149 places, 111 transitions, 414 flow [2021-12-22 13:33:04,753 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=414, PETRI_PLACES=149, PETRI_TRANSITIONS=111} [2021-12-22 13:33:04,754 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 30 predicate places. [2021-12-22 13:33:04,754 INFO L470 AbstractCegarLoop]: Abstraction has has 149 places, 111 transitions, 414 flow [2021-12-22 13:33:04,754 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 87.18181818181819) internal successors, (959), 11 states have internal predecessors, (959), 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-22 13:33:04,754 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:33:04,754 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:33:04,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-22 13:33:04,755 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:33:04,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:33:04,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1544419612, now seen corresponding path program 5 times [2021-12-22 13:33:04,755 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:33:04,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399296005] [2021-12-22 13:33:04,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:33:04,756 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:33:04,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:33:04,938 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-22 13:33:04,938 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:33:04,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399296005] [2021-12-22 13:33:04,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399296005] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:33:04,939 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:33:04,939 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-22 13:33:04,940 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302999937] [2021-12-22 13:33:04,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:33:04,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-22 13:33:04,942 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:33:04,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-22 13:33:04,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-22 13:33:04,943 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 114 [2021-12-22 13:33:04,943 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 111 transitions, 414 flow. Second operand has 10 states, 10 states have (on average 87.4) internal successors, (874), 10 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:33:04,943 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:33:04,943 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 114 [2021-12-22 13:33:04,943 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:33:05,127 INFO L129 PetriNetUnfolder]: 29/287 cut-off events. [2021-12-22 13:33:05,127 INFO L130 PetriNetUnfolder]: For 154/157 co-relation queries the response was YES. [2021-12-22 13:33:05,128 INFO L84 FinitePrefix]: Finished finitePrefix Result has 577 conditions, 287 events. 29/287 cut-off events. For 154/157 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1255 event pairs, 0 based on Foata normal form. 1/283 useless extension candidates. Maximal degree in co-relation 554. Up to 34 conditions per place. [2021-12-22 13:33:05,129 INFO L132 encePairwiseOnDemand]: 105/114 looper letters, 23 selfloop transitions, 3 changer transitions 21/123 dead transitions. [2021-12-22 13:33:05,129 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 123 transitions, 598 flow [2021-12-22 13:33:05,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 13:33:05,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-22 13:33:05,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 891 transitions. [2021-12-22 13:33:05,130 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.781578947368421 [2021-12-22 13:33:05,130 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 891 transitions. [2021-12-22 13:33:05,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 891 transitions. [2021-12-22 13:33:05,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:33:05,131 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 891 transitions. [2021-12-22 13:33:05,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 89.1) internal successors, (891), 10 states have internal predecessors, (891), 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-22 13:33:05,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:33:05,136 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:33:05,136 INFO L186 Difference]: Start difference. First operand has 149 places, 111 transitions, 414 flow. Second operand 10 states and 891 transitions. [2021-12-22 13:33:05,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 123 transitions, 598 flow [2021-12-22 13:33:05,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 123 transitions, 524 flow, removed 15 selfloop flow, removed 15 redundant places. [2021-12-22 13:33:05,139 INFO L242 Difference]: Finished difference. Result has 138 places, 102 transitions, 302 flow [2021-12-22 13:33:05,139 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=302, PETRI_PLACES=138, PETRI_TRANSITIONS=102} [2021-12-22 13:33:05,139 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 19 predicate places. [2021-12-22 13:33:05,139 INFO L470 AbstractCegarLoop]: Abstraction has has 138 places, 102 transitions, 302 flow [2021-12-22 13:33:05,140 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 87.4) internal successors, (874), 10 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:33:05,140 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:33:05,140 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:33:05,140 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-22 13:33:05,140 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:33:05,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:33:05,140 INFO L85 PathProgramCache]: Analyzing trace with hash -227522288, now seen corresponding path program 6 times [2021-12-22 13:33:05,141 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:33:05,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772543850] [2021-12-22 13:33:05,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:33:05,141 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:33:05,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 13:33:05,185 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 13:33:05,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 13:33:05,277 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 13:33:05,277 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-22 13:33:05,278 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2021-12-22 13:33:05,279 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2021-12-22 13:33:05,280 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2021-12-22 13:33:05,280 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2021-12-22 13:33:05,280 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2021-12-22 13:33:05,281 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2021-12-22 13:33:05,281 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-22 13:33:05,283 INFO L732 BasicCegarLoop]: Path program histogram: [6, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:33:05,287 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-12-22 13:33:05,287 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-22 13:33:05,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 01:33:05 BasicIcfg [2021-12-22 13:33:05,372 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-22 13:33:05,372 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-22 13:33:05,373 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-22 13:33:05,373 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-22 13:33:05,373 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 01:32:47" (3/4) ... [2021-12-22 13:33:05,374 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-22 13:33:05,441 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-22 13:33:05,441 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-22 13:33:05,442 INFO L158 Benchmark]: Toolchain (without parser) took 19405.75ms. Allocated memory was 94.4MB in the beginning and 654.3MB in the end (delta: 559.9MB). Free memory was 62.8MB in the beginning and 420.0MB in the end (delta: -357.2MB). Peak memory consumption was 200.9MB. Max. memory is 16.1GB. [2021-12-22 13:33:05,442 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 94.4MB. Free memory was 53.2MB in the beginning and 53.2MB in the end (delta: 39.1kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 13:33:05,442 INFO L158 Benchmark]: CACSL2BoogieTranslator took 475.45ms. Allocated memory is still 94.4MB. Free memory was 62.6MB in the beginning and 55.5MB in the end (delta: 7.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-22 13:33:05,442 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.41ms. Allocated memory is still 94.4MB. Free memory was 55.5MB in the beginning and 52.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-22 13:33:05,442 INFO L158 Benchmark]: Boogie Preprocessor took 28.27ms. Allocated memory is still 94.4MB. Free memory was 52.5MB in the beginning and 49.5MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-22 13:33:05,443 INFO L158 Benchmark]: RCFGBuilder took 1221.87ms. Allocated memory was 94.4MB in the beginning and 151.0MB in the end (delta: 56.6MB). Free memory was 49.5MB in the beginning and 114.4MB in the end (delta: -64.9MB). Peak memory consumption was 43.5MB. Max. memory is 16.1GB. [2021-12-22 13:33:05,443 INFO L158 Benchmark]: TraceAbstraction took 17524.59ms. Allocated memory was 151.0MB in the beginning and 654.3MB in the end (delta: 503.3MB). Free memory was 113.3MB in the beginning and 460.8MB in the end (delta: -347.5MB). Peak memory consumption was 155.8MB. Max. memory is 16.1GB. [2021-12-22 13:33:05,443 INFO L158 Benchmark]: Witness Printer took 68.69ms. Allocated memory is still 654.3MB. Free memory was 460.8MB in the beginning and 420.0MB in the end (delta: 40.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2021-12-22 13:33:05,444 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.20ms. Allocated memory is still 94.4MB. Free memory was 53.2MB in the beginning and 53.2MB in the end (delta: 39.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 475.45ms. Allocated memory is still 94.4MB. Free memory was 62.6MB in the beginning and 55.5MB in the end (delta: 7.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.41ms. Allocated memory is still 94.4MB. Free memory was 55.5MB in the beginning and 52.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.27ms. Allocated memory is still 94.4MB. Free memory was 52.5MB in the beginning and 49.5MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1221.87ms. Allocated memory was 94.4MB in the beginning and 151.0MB in the end (delta: 56.6MB). Free memory was 49.5MB in the beginning and 114.4MB in the end (delta: -64.9MB). Peak memory consumption was 43.5MB. Max. memory is 16.1GB. * TraceAbstraction took 17524.59ms. Allocated memory was 151.0MB in the beginning and 654.3MB in the end (delta: 503.3MB). Free memory was 113.3MB in the beginning and 460.8MB in the end (delta: -347.5MB). Peak memory consumption was 155.8MB. Max. memory is 16.1GB. * Witness Printer took 68.69ms. Allocated memory is still 654.3MB. Free memory was 460.8MB in the beginning and 420.0MB in the end (delta: 40.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L715] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L716] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L718] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L719] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L720] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L721] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L722] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L723] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L724] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L725] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L726] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L727] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L728] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L729] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L730] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L731] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L732] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L733] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L734] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L736] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L737] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L738] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L849] 0 pthread_t t2537; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2537={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L850] FCALL, FORK 0 pthread_create(&t2537, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2537, ((void *)0), P0, ((void *)0))=-2, t2537={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L851] 0 pthread_t t2538; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2537={5:0}, t2538={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L852] FCALL, FORK 0 pthread_create(&t2538, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2538, ((void *)0), P1, ((void *)0))=-1, t2537={5:0}, t2538={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L853] 0 pthread_t t2539; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2537={5:0}, t2538={6:0}, t2539={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L854] FCALL, FORK 0 pthread_create(&t2539, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2539, ((void *)0), P2, ((void *)0))=0, t2537={5:0}, t2538={6:0}, t2539={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L812] 3 x$w_buff1 = x$w_buff0 [L813] 3 x$w_buff0 = 2 [L814] 3 x$w_buff1_used = x$w_buff0_used [L815] 3 x$w_buff0_used = (_Bool)1 [L816] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L816] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L817] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L818] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L819] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L820] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L752] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L753] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used) [L754] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L755] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L756] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L757] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=69, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L772] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=69, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L775] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L778] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L779] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 x$flush_delayed = weak$$choice2 [L785] 2 x$mem_tmp = x [L786] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L786] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L787] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L787] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0) [L787] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L788] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L788] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1) [L788] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L789] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L789] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used) [L789] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L790] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L790] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L791] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2) [L791] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L792] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L792] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L792] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = x [L794] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L794] 2 x = x$flush_delayed ? x$mem_tmp : x [L795] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=68, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L798] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L798] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L798] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L799] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L799] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L800] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L800] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L801] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L802] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L802] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=68, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=68, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_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=68, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537={5:0}, t2538={6:0}, t2539={3:0}, weak$$choice0=68, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_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=68, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L871] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L872] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L872] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L872] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L872] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L873] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L873] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L873] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L873] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L874] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L874] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L874] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L874] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L875] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L875] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L876] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L876] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L876] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L877] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L877] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L879] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537={5:0}, t2538={6:0}, t2539={3:0}, weak$$choice0=66, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L882] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_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=66, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 850]: 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: 854]: 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: 852]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 141 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 17.2s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 12.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1075 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1075 mSDsluCounter, 1517 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2118 mSDsCounter, 633 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4213 IncrementalHoareTripleChecker+Invalid, 4846 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 633 mSolverCounterUnsat, 245 mSDtfsCounter, 4213 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 391 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 338 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 935 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1156occurred in iteration=12, InterpolantAutomatonStates: 282, 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.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 1973 NumberOfCodeBlocks, 1973 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1862 ConstructedInterpolants, 0 QuantifiedInterpolants, 11795 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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-22 13:33:05,486 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