/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix051_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-11 20:13:15,869 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-11 20:13:15,870 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-11 20:13:15,887 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-11 20:13:15,888 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-11 20:13:15,893 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-11 20:13:15,895 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-11 20:13:15,899 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-11 20:13:15,900 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-11 20:13:15,903 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-11 20:13:15,904 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-11 20:13:15,905 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-11 20:13:15,905 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-11 20:13:15,907 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-11 20:13:15,907 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-11 20:13:15,908 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-11 20:13:15,909 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-11 20:13:15,910 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-11 20:13:15,913 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-11 20:13:15,918 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-11 20:13:15,919 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-11 20:13:15,920 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-11 20:13:15,921 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-11 20:13:15,922 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-11 20:13:15,927 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-11 20:13:15,927 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-11 20:13:15,927 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-11 20:13:15,928 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-11 20:13:15,929 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-11 20:13:15,929 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-11 20:13:15,929 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-11 20:13:15,930 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-11 20:13:15,931 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-11 20:13:15,931 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-11 20:13:15,932 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-11 20:13:15,932 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-11 20:13:15,933 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-11 20:13:15,933 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-11 20:13:15,933 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-11 20:13:15,933 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-11 20:13:15,934 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-11 20:13:15,934 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2021-03-11 20:13:15,964 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-11 20:13:15,964 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-11 20:13:15,966 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-11 20:13:15,966 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-11 20:13:15,967 INFO L138 SettingsManager]: * Use SBE=true [2021-03-11 20:13:15,967 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-11 20:13:15,967 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-11 20:13:15,967 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-11 20:13:15,967 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-11 20:13:15,967 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-11 20:13:15,968 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-11 20:13:15,968 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-11 20:13:15,968 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-11 20:13:15,968 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-11 20:13:15,968 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-11 20:13:15,968 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-11 20:13:15,968 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-11 20:13:15,969 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-11 20:13:15,969 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-11 20:13:15,969 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-11 20:13:15,969 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-11 20:13:15,969 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 20:13:15,969 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-11 20:13:15,969 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-11 20:13:15,970 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-11 20:13:15,970 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-11 20:13:15,970 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-11 20:13:15,970 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-11 20:13:15,970 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 [2021-03-11 20:13:16,207 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-11 20:13:16,226 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-11 20:13:16,227 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-11 20:13:16,228 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-11 20:13:16,229 INFO L275 PluginConnector]: CDTParser initialized [2021-03-11 20:13:16,229 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix051_rmo.opt.i [2021-03-11 20:13:16,271 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c9455681/63f734040a8e41ef88441de5ba434ce5/FLAG13771a6be [2021-03-11 20:13:16,836 INFO L306 CDTParser]: Found 1 translation units. [2021-03-11 20:13:16,836 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix051_rmo.opt.i [2021-03-11 20:13:16,845 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c9455681/63f734040a8e41ef88441de5ba434ce5/FLAG13771a6be [2021-03-11 20:13:17,000 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c9455681/63f734040a8e41ef88441de5ba434ce5 [2021-03-11 20:13:17,002 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-11 20:13:17,006 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-11 20:13:17,008 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-11 20:13:17,008 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-11 20:13:17,011 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-11 20:13:17,011 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 08:13:17" (1/1) ... [2021-03-11 20:13:17,012 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a00c49b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:13:17, skipping insertion in model container [2021-03-11 20:13:17,012 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 08:13:17" (1/1) ... [2021-03-11 20:13:17,017 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-11 20:13:17,061 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-11 20:13:17,169 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix051_rmo.opt.i[948,961] [2021-03-11 20:13:17,362 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 20:13:17,370 INFO L203 MainTranslator]: Completed pre-run [2021-03-11 20:13:17,377 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix051_rmo.opt.i[948,961] [2021-03-11 20:13:17,409 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 20:13:17,447 INFO L208 MainTranslator]: Completed translation [2021-03-11 20:13:17,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:13:17 WrapperNode [2021-03-11 20:13:17,447 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-11 20:13:17,448 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-11 20:13:17,448 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-11 20:13:17,448 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-11 20:13:17,452 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:13:17" (1/1) ... [2021-03-11 20:13:17,462 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:13:17" (1/1) ... [2021-03-11 20:13:17,477 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-11 20:13:17,477 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-11 20:13:17,478 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-11 20:13:17,478 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-11 20:13:17,483 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:13:17" (1/1) ... [2021-03-11 20:13:17,483 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:13:17" (1/1) ... [2021-03-11 20:13:17,485 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:13:17" (1/1) ... [2021-03-11 20:13:17,485 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:13:17" (1/1) ... [2021-03-11 20:13:17,491 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:13:17" (1/1) ... [2021-03-11 20:13:17,492 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:13:17" (1/1) ... [2021-03-11 20:13:17,494 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:13:17" (1/1) ... [2021-03-11 20:13:17,496 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-11 20:13:17,497 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-11 20:13:17,497 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-11 20:13:17,497 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-11 20:13:17,509 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:13:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 20:13:17,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-11 20:13:17,566 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-11 20:13:17,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-11 20:13:17,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-11 20:13:17,568 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-11 20:13:17,568 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-11 20:13:17,568 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-11 20:13:17,568 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-11 20:13:17,569 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-11 20:13:17,569 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-11 20:13:17,569 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-11 20:13:17,569 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-11 20:13:17,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-11 20:13:17,569 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-11 20:13:17,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-11 20:13:17,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-11 20:13:17,570 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-11 20:13:18,793 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-11 20:13:18,793 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-11 20:13:18,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 08:13:18 BoogieIcfgContainer [2021-03-11 20:13:18,795 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-11 20:13:18,797 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-11 20:13:18,797 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-11 20:13:18,799 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-11 20:13:18,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 08:13:17" (1/3) ... [2021-03-11 20:13:18,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6370a7b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 08:13:18, skipping insertion in model container [2021-03-11 20:13:18,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:13:17" (2/3) ... [2021-03-11 20:13:18,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6370a7b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 08:13:18, skipping insertion in model container [2021-03-11 20:13:18,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 08:13:18" (3/3) ... [2021-03-11 20:13:18,802 INFO L111 eAbstractionObserver]: Analyzing ICFG mix051_rmo.opt.i [2021-03-11 20:13:18,806 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-11 20:13:18,809 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-11 20:13:18,809 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-11 20:13:18,840 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,840 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,840 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,840 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,841 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,841 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,841 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,841 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,841 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,841 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,841 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,841 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,842 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,842 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,842 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,842 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,843 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,843 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,843 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,843 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,844 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,844 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,844 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,844 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,844 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,844 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,844 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,844 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,844 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,845 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,845 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,845 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,845 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,845 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,845 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,845 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,845 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,845 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,845 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,845 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,845 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,846 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,846 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,846 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,846 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,846 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,846 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,846 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,846 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,846 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,846 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,846 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,846 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,846 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,846 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,846 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,847 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,847 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,847 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,847 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,847 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,847 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,847 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,847 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,847 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,847 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,849 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,849 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,849 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,849 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,849 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,849 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,849 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,850 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,850 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,850 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,850 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,850 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,850 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,850 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,850 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,851 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,851 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,851 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,851 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,851 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,851 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,853 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,855 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,855 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,855 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,856 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,862 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,862 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,862 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,862 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,862 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,863 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,863 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,863 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,863 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,863 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,863 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,863 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,863 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,863 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,863 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,863 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,863 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,863 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,863 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,863 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,864 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,864 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,864 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,864 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,864 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,864 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,864 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,864 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,864 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,864 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,864 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,864 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,864 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,864 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,865 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,865 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,865 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,865 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,866 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,866 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,866 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,866 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,868 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,868 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,868 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,868 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,869 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,869 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,869 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,869 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,869 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,869 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,869 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,869 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,869 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,869 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,869 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,869 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,869 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,869 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,870 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,870 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,870 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,870 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,870 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,870 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,870 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,870 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,870 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,870 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,870 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,870 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,870 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,871 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,871 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,871 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,871 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,871 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,871 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,871 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,871 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,871 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,872 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,872 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,872 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:18,872 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 20:13:18,884 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-11 20:13:18,906 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 20:13:18,907 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-11 20:13:18,907 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 20:13:18,907 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 20:13:18,907 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 20:13:18,907 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 20:13:18,907 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 20:13:18,907 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 20:13:18,917 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 124 places, 113 transitions, 246 flow [2021-03-11 20:13:18,956 INFO L129 PetriNetUnfolder]: 2/109 cut-off events. [2021-03-11 20:13:18,956 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:13:18,964 INFO L84 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2021-03-11 20:13:18,964 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 113 transitions, 246 flow [2021-03-11 20:13:18,967 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 109 transitions, 230 flow [2021-03-11 20:13:18,970 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 20:13:18,977 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 109 transitions, 230 flow [2021-03-11 20:13:18,978 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 109 transitions, 230 flow [2021-03-11 20:13:18,979 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 120 places, 109 transitions, 230 flow [2021-03-11 20:13:19,002 INFO L129 PetriNetUnfolder]: 2/109 cut-off events. [2021-03-11 20:13:19,002 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:13:19,003 INFO L84 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2021-03-11 20:13:19,005 INFO L116 LiptonReduction]: Number of co-enabled transitions 2300 [2021-03-11 20:13:20,344 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-03-11 20:13:20,693 WARN L205 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 86 [2021-03-11 20:13:20,801 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-11 20:13:22,266 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2021-03-11 20:13:22,478 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2021-03-11 20:13:22,583 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2021-03-11 20:13:22,890 WARN L205 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 122 [2021-03-11 20:13:23,024 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-03-11 20:13:23,322 WARN L205 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 122 [2021-03-11 20:13:23,458 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-03-11 20:13:23,461 INFO L131 LiptonReduction]: Checked pairs total: 5422 [2021-03-11 20:13:23,461 INFO L133 LiptonReduction]: Total number of compositions: 93 [2021-03-11 20:13:23,462 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4495 [2021-03-11 20:13:23,471 INFO L129 PetriNetUnfolder]: 0/17 cut-off events. [2021-03-11 20:13:23,471 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:13:23,471 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:13:23,471 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:13:23,471 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:13:23,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:13:23,474 INFO L82 PathProgramCache]: Analyzing trace with hash -137274662, now seen corresponding path program 1 times [2021-03-11 20:13:23,479 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:13:23,479 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835787006] [2021-03-11 20:13:23,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:13:23,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:13:23,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:23,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:13:23,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:13:23,648 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835787006] [2021-03-11 20:13:23,649 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:13:23,649 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 20:13:23,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326145457] [2021-03-11 20:13:23,654 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 20:13:23,654 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:13:23,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 20:13:23,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 20:13:23,663 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 206 [2021-03-11 20:13:23,665 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 0 states have call successors, (0), 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-03-11 20:13:23,665 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:13:23,665 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 206 [2021-03-11 20:13:23,666 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:13:23,693 INFO L129 PetriNetUnfolder]: 9/57 cut-off events. [2021-03-11 20:13:23,693 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:13:23,694 INFO L84 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 57 events. 9/57 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 152 event pairs, 3 based on Foata normal form. 6/57 useless extension candidates. Maximal degree in co-relation 81. Up to 17 conditions per place. [2021-03-11 20:13:23,695 INFO L132 encePairwiseOnDemand]: 202/206 looper letters, 5 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2021-03-11 20:13:23,695 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 28 transitions, 82 flow [2021-03-11 20:13:23,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 20:13:23,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 20:13:23,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 541 transitions. [2021-03-11 20:13:23,704 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8754045307443366 [2021-03-11 20:13:23,704 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 541 transitions. [2021-03-11 20:13:23,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 541 transitions. [2021-03-11 20:13:23,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:13:23,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 541 transitions. [2021-03-11 20:13:23,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 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-03-11 20:13:23,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 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-03-11 20:13:23,714 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 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-03-11 20:13:23,715 INFO L185 Difference]: Start difference. First operand has 40 places, 28 transitions, 68 flow. Second operand 3 states and 541 transitions. [2021-03-11 20:13:23,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 28 transitions, 82 flow [2021-03-11 20:13:23,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 28 transitions, 78 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-11 20:13:23,718 INFO L241 Difference]: Finished difference. Result has 37 places, 26 transitions, 64 flow [2021-03-11 20:13:23,719 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=37, PETRI_TRANSITIONS=26} [2021-03-11 20:13:23,719 INFO L335 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2021-03-11 20:13:23,719 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 64 flow [2021-03-11 20:13:23,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 0 states have call successors, (0), 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-03-11 20:13:23,720 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:13:23,720 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:13:23,720 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-11 20:13:23,720 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:13:23,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:13:23,720 INFO L82 PathProgramCache]: Analyzing trace with hash -738419360, now seen corresponding path program 1 times [2021-03-11 20:13:23,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:13:23,721 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228531755] [2021-03-11 20:13:23,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:13:23,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:13:23,791 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-11 20:13:23,792 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-11 20:13:23,799 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:23,800 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 20:13:23,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:13:23,805 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228531755] [2021-03-11 20:13:23,805 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:13:23,805 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 20:13:23,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768492296] [2021-03-11 20:13:23,810 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:13:23,810 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:13:23,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:13:23,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:13:23,813 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 206 [2021-03-11 20:13:23,814 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 158.75) internal successors, (635), 4 states have internal predecessors, (635), 0 states have call successors, (0), 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-03-11 20:13:23,814 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:13:23,814 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 206 [2021-03-11 20:13:23,814 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:13:23,968 INFO L129 PetriNetUnfolder]: 326/685 cut-off events. [2021-03-11 20:13:23,968 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:13:23,971 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1228 conditions, 685 events. 326/685 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 4226 event pairs, 108 based on Foata normal form. 0/629 useless extension candidates. Maximal degree in co-relation 1219. Up to 277 conditions per place. [2021-03-11 20:13:23,974 INFO L132 encePairwiseOnDemand]: 198/206 looper letters, 8 selfloop transitions, 6 changer transitions 15/46 dead transitions. [2021-03-11 20:13:23,974 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 46 transitions, 162 flow [2021-03-11 20:13:23,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:13:23,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:13:23,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 821 transitions. [2021-03-11 20:13:23,977 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7970873786407767 [2021-03-11 20:13:23,977 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 821 transitions. [2021-03-11 20:13:23,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 821 transitions. [2021-03-11 20:13:23,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:13:23,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 821 transitions. [2021-03-11 20:13:23,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 164.2) internal successors, (821), 5 states have internal predecessors, (821), 0 states have call successors, (0), 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-03-11 20:13:23,981 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 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-03-11 20:13:23,982 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 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-03-11 20:13:23,982 INFO L185 Difference]: Start difference. First operand has 37 places, 26 transitions, 64 flow. Second operand 5 states and 821 transitions. [2021-03-11 20:13:23,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 46 transitions, 162 flow [2021-03-11 20:13:23,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 46 transitions, 158 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-11 20:13:23,983 INFO L241 Difference]: Finished difference. Result has 43 places, 30 transitions, 118 flow [2021-03-11 20:13:23,983 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=118, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2021-03-11 20:13:23,984 INFO L335 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places. [2021-03-11 20:13:23,984 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 118 flow [2021-03-11 20:13:23,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 158.75) internal successors, (635), 4 states have internal predecessors, (635), 0 states have call successors, (0), 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-03-11 20:13:23,986 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:13:23,986 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:13:23,986 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-11 20:13:23,986 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:13:23,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:13:23,987 INFO L82 PathProgramCache]: Analyzing trace with hash -992170427, now seen corresponding path program 1 times [2021-03-11 20:13:23,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:13:23,987 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52640818] [2021-03-11 20:13:23,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:13:24,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:13:24,042 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:24,042 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:13:24,045 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:24,046 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:13:24,051 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:24,051 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:13:24,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:13:24,051 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52640818] [2021-03-11 20:13:24,051 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:13:24,052 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:13:24,052 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436837880] [2021-03-11 20:13:24,052 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:13:24,052 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:13:24,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:13:24,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:13:24,053 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 206 [2021-03-11 20:13:24,054 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 167.75) internal successors, (671), 4 states have internal predecessors, (671), 0 states have call successors, (0), 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-03-11 20:13:24,054 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:13:24,054 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 206 [2021-03-11 20:13:24,054 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:13:24,186 INFO L129 PetriNetUnfolder]: 651/1247 cut-off events. [2021-03-11 20:13:24,186 INFO L130 PetriNetUnfolder]: For 227/259 co-relation queries the response was YES. [2021-03-11 20:13:24,190 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2794 conditions, 1247 events. 651/1247 cut-off events. For 227/259 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 8744 event pairs, 323 based on Foata normal form. 88/1211 useless extension candidates. Maximal degree in co-relation 2781. Up to 696 conditions per place. [2021-03-11 20:13:24,195 INFO L132 encePairwiseOnDemand]: 199/206 looper letters, 10 selfloop transitions, 10 changer transitions 0/43 dead transitions. [2021-03-11 20:13:24,195 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 43 transitions, 184 flow [2021-03-11 20:13:24,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:13:24,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:13:24,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 857 transitions. [2021-03-11 20:13:24,197 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8320388349514564 [2021-03-11 20:13:24,197 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 857 transitions. [2021-03-11 20:13:24,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 857 transitions. [2021-03-11 20:13:24,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:13:24,197 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 857 transitions. [2021-03-11 20:13:24,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 171.4) internal successors, (857), 5 states have internal predecessors, (857), 0 states have call successors, (0), 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-03-11 20:13:24,200 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 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-03-11 20:13:24,200 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 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-03-11 20:13:24,200 INFO L185 Difference]: Start difference. First operand has 43 places, 30 transitions, 118 flow. Second operand 5 states and 857 transitions. [2021-03-11 20:13:24,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 43 transitions, 184 flow [2021-03-11 20:13:24,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 43 transitions, 170 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-11 20:13:24,204 INFO L241 Difference]: Finished difference. Result has 45 places, 39 transitions, 179 flow [2021-03-11 20:13:24,205 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=179, PETRI_PLACES=45, PETRI_TRANSITIONS=39} [2021-03-11 20:13:24,205 INFO L335 CegarLoopForPetriNet]: 40 programPoint places, 5 predicate places. [2021-03-11 20:13:24,205 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 39 transitions, 179 flow [2021-03-11 20:13:24,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 167.75) internal successors, (671), 4 states have internal predecessors, (671), 0 states have call successors, (0), 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-03-11 20:13:24,205 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:13:24,205 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:13:24,205 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-11 20:13:24,205 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:13:24,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:13:24,206 INFO L82 PathProgramCache]: Analyzing trace with hash 548908825, now seen corresponding path program 1 times [2021-03-11 20:13:24,206 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:13:24,206 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036258069] [2021-03-11 20:13:24,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:13:24,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:13:24,259 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:24,260 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:13:24,262 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:24,262 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:13:24,265 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:24,266 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:13:24,271 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:24,271 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:13:24,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:13:24,272 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036258069] [2021-03-11 20:13:24,272 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:13:24,272 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:13:24,272 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139978267] [2021-03-11 20:13:24,272 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:13:24,272 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:13:24,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:13:24,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:13:24,273 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 206 [2021-03-11 20:13:24,274 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 39 transitions, 179 flow. Second operand has 5 states, 5 states have (on average 167.8) internal successors, (839), 5 states have internal predecessors, (839), 0 states have call successors, (0), 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-03-11 20:13:24,274 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:13:24,274 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 206 [2021-03-11 20:13:24,274 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:13:24,390 INFO L129 PetriNetUnfolder]: 430/939 cut-off events. [2021-03-11 20:13:24,390 INFO L130 PetriNetUnfolder]: For 908/1453 co-relation queries the response was YES. [2021-03-11 20:13:24,393 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3336 conditions, 939 events. 430/939 cut-off events. For 908/1453 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 6795 event pairs, 96 based on Foata normal form. 249/1117 useless extension candidates. Maximal degree in co-relation 3320. Up to 640 conditions per place. [2021-03-11 20:13:24,397 INFO L132 encePairwiseOnDemand]: 199/206 looper letters, 10 selfloop transitions, 19 changer transitions 0/52 dead transitions. [2021-03-11 20:13:24,397 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 52 transitions, 313 flow [2021-03-11 20:13:24,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 20:13:24,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 20:13:24,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1200 transitions. [2021-03-11 20:13:24,399 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8321775312066574 [2021-03-11 20:13:24,399 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1200 transitions. [2021-03-11 20:13:24,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1200 transitions. [2021-03-11 20:13:24,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:13:24,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1200 transitions. [2021-03-11 20:13:24,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 171.42857142857142) internal successors, (1200), 7 states have internal predecessors, (1200), 0 states have call successors, (0), 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-03-11 20:13:24,403 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 206.0) internal successors, (1648), 8 states have internal predecessors, (1648), 0 states have call successors, (0), 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-03-11 20:13:24,404 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 206.0) internal successors, (1648), 8 states have internal predecessors, (1648), 0 states have call successors, (0), 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-03-11 20:13:24,404 INFO L185 Difference]: Start difference. First operand has 45 places, 39 transitions, 179 flow. Second operand 7 states and 1200 transitions. [2021-03-11 20:13:24,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 52 transitions, 313 flow [2021-03-11 20:13:24,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 52 transitions, 306 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-11 20:13:24,408 INFO L241 Difference]: Finished difference. Result has 52 places, 48 transitions, 306 flow [2021-03-11 20:13:24,408 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=306, PETRI_PLACES=52, PETRI_TRANSITIONS=48} [2021-03-11 20:13:24,408 INFO L335 CegarLoopForPetriNet]: 40 programPoint places, 12 predicate places. [2021-03-11 20:13:24,408 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 306 flow [2021-03-11 20:13:24,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 167.8) internal successors, (839), 5 states have internal predecessors, (839), 0 states have call successors, (0), 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-03-11 20:13:24,409 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:13:24,409 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:13:24,409 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-11 20:13:24,409 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:13:24,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:13:24,409 INFO L82 PathProgramCache]: Analyzing trace with hash 190918482, now seen corresponding path program 1 times [2021-03-11 20:13:24,410 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:13:24,410 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284590649] [2021-03-11 20:13:24,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:13:24,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:13:24,472 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:24,472 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:13:24,474 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:24,475 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:13:24,477 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:24,478 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:13:24,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:24,482 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:13:24,487 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:24,487 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:13:24,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:13:24,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284590649] [2021-03-11 20:13:24,488 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:13:24,488 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 20:13:24,488 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620838907] [2021-03-11 20:13:24,488 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 20:13:24,488 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:13:24,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 20:13:24,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-11 20:13:24,489 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 206 [2021-03-11 20:13:24,490 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 48 transitions, 306 flow. Second operand has 6 states, 6 states have (on average 167.83333333333334) internal successors, (1007), 6 states have internal predecessors, (1007), 0 states have call successors, (0), 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-03-11 20:13:24,490 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:13:24,490 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 206 [2021-03-11 20:13:24,490 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:13:24,612 INFO L129 PetriNetUnfolder]: 317/738 cut-off events. [2021-03-11 20:13:24,612 INFO L130 PetriNetUnfolder]: For 2504/3583 co-relation queries the response was YES. [2021-03-11 20:13:24,615 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3795 conditions, 738 events. 317/738 cut-off events. For 2504/3583 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 5287 event pairs, 20 based on Foata normal form. 323/1003 useless extension candidates. Maximal degree in co-relation 3776. Up to 579 conditions per place. [2021-03-11 20:13:24,618 INFO L132 encePairwiseOnDemand]: 199/206 looper letters, 6 selfloop transitions, 28 changer transitions 4/61 dead transitions. [2021-03-11 20:13:24,618 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 61 transitions, 508 flow [2021-03-11 20:13:24,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-11 20:13:24,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-11 20:13:24,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1543 transitions. [2021-03-11 20:13:24,622 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8322545846817692 [2021-03-11 20:13:24,622 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1543 transitions. [2021-03-11 20:13:24,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1543 transitions. [2021-03-11 20:13:24,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:13:24,623 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1543 transitions. [2021-03-11 20:13:24,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 171.44444444444446) internal successors, (1543), 9 states have internal predecessors, (1543), 0 states have call successors, (0), 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-03-11 20:13:24,627 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 206.0) internal successors, (2060), 10 states have internal predecessors, (2060), 0 states have call successors, (0), 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-03-11 20:13:24,627 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 206.0) internal successors, (2060), 10 states have internal predecessors, (2060), 0 states have call successors, (0), 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-03-11 20:13:24,627 INFO L185 Difference]: Start difference. First operand has 52 places, 48 transitions, 306 flow. Second operand 9 states and 1543 transitions. [2021-03-11 20:13:24,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 61 transitions, 508 flow [2021-03-11 20:13:24,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 61 transitions, 458 flow, removed 17 selfloop flow, removed 3 redundant places. [2021-03-11 20:13:24,638 INFO L241 Difference]: Finished difference. Result has 60 places, 57 transitions, 434 flow [2021-03-11 20:13:24,638 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=434, PETRI_PLACES=60, PETRI_TRANSITIONS=57} [2021-03-11 20:13:24,638 INFO L335 CegarLoopForPetriNet]: 40 programPoint places, 20 predicate places. [2021-03-11 20:13:24,638 INFO L480 AbstractCegarLoop]: Abstraction has has 60 places, 57 transitions, 434 flow [2021-03-11 20:13:24,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 167.83333333333334) internal successors, (1007), 6 states have internal predecessors, (1007), 0 states have call successors, (0), 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-03-11 20:13:24,638 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:13:24,638 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:13:24,638 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-11 20:13:24,639 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:13:24,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:13:24,639 INFO L82 PathProgramCache]: Analyzing trace with hash 2139508406, now seen corresponding path program 1 times [2021-03-11 20:13:24,639 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:13:24,642 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635930475] [2021-03-11 20:13:24,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:13:24,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:13:24,713 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:24,713 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:13:24,715 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:24,715 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:13:24,718 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-11 20:13:24,719 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-11 20:13:24,726 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:24,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 20:13:24,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:13:24,733 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635930475] [2021-03-11 20:13:24,733 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:13:24,733 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:13:24,734 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410326374] [2021-03-11 20:13:24,734 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:13:24,734 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:13:24,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:13:24,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:13:24,735 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 206 [2021-03-11 20:13:24,736 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 57 transitions, 434 flow. Second operand has 5 states, 5 states have (on average 156.6) internal successors, (783), 5 states have internal predecessors, (783), 0 states have call successors, (0), 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-03-11 20:13:24,736 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:13:24,736 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 206 [2021-03-11 20:13:24,736 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:13:24,875 INFO L129 PetriNetUnfolder]: 426/997 cut-off events. [2021-03-11 20:13:24,875 INFO L130 PetriNetUnfolder]: For 4021/4351 co-relation queries the response was YES. [2021-03-11 20:13:24,879 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4751 conditions, 997 events. 426/997 cut-off events. For 4021/4351 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 7589 event pairs, 10 based on Foata normal form. 15/929 useless extension candidates. Maximal degree in co-relation 4729. Up to 521 conditions per place. [2021-03-11 20:13:24,882 INFO L132 encePairwiseOnDemand]: 197/206 looper letters, 15 selfloop transitions, 14 changer transitions 4/76 dead transitions. [2021-03-11 20:13:24,882 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 76 transitions, 588 flow [2021-03-11 20:13:24,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 20:13:24,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 20:13:24,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1117 transitions. [2021-03-11 20:13:24,885 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7746185852981969 [2021-03-11 20:13:24,885 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1117 transitions. [2021-03-11 20:13:24,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1117 transitions. [2021-03-11 20:13:24,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:13:24,885 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1117 transitions. [2021-03-11 20:13:24,887 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 159.57142857142858) internal successors, (1117), 7 states have internal predecessors, (1117), 0 states have call successors, (0), 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-03-11 20:13:24,888 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 206.0) internal successors, (1648), 8 states have internal predecessors, (1648), 0 states have call successors, (0), 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-03-11 20:13:24,889 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 206.0) internal successors, (1648), 8 states have internal predecessors, (1648), 0 states have call successors, (0), 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-03-11 20:13:24,889 INFO L185 Difference]: Start difference. First operand has 60 places, 57 transitions, 434 flow. Second operand 7 states and 1117 transitions. [2021-03-11 20:13:24,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 76 transitions, 588 flow [2021-03-11 20:13:24,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 76 transitions, 491 flow, removed 34 selfloop flow, removed 4 redundant places. [2021-03-11 20:13:24,926 INFO L241 Difference]: Finished difference. Result has 67 places, 66 transitions, 447 flow [2021-03-11 20:13:24,926 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=447, PETRI_PLACES=67, PETRI_TRANSITIONS=66} [2021-03-11 20:13:24,926 INFO L335 CegarLoopForPetriNet]: 40 programPoint places, 27 predicate places. [2021-03-11 20:13:24,926 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 66 transitions, 447 flow [2021-03-11 20:13:24,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 156.6) internal successors, (783), 5 states have internal predecessors, (783), 0 states have call successors, (0), 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-03-11 20:13:24,926 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:13:24,927 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:13:24,927 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-11 20:13:24,927 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:13:24,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:13:24,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1223185154, now seen corresponding path program 2 times [2021-03-11 20:13:24,927 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:13:24,927 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859454347] [2021-03-11 20:13:24,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:13:24,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:13:24,984 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:24,984 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:13:24,987 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:24,987 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:13:24,989 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:24,990 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:13:24,993 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:24,994 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:13:24,998 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:24,998 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:13:25,004 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:25,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:13:25,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:13:25,005 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859454347] [2021-03-11 20:13:25,005 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:13:25,005 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 20:13:25,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001834470] [2021-03-11 20:13:25,005 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 20:13:25,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:13:25,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 20:13:25,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-11 20:13:25,007 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 206 [2021-03-11 20:13:25,009 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 66 transitions, 447 flow. Second operand has 7 states, 7 states have (on average 167.85714285714286) internal successors, (1175), 7 states have internal predecessors, (1175), 0 states have call successors, (0), 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-03-11 20:13:25,009 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:13:25,009 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 206 [2021-03-11 20:13:25,009 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:13:25,162 INFO L129 PetriNetUnfolder]: 397/916 cut-off events. [2021-03-11 20:13:25,162 INFO L130 PetriNetUnfolder]: For 2361/3075 co-relation queries the response was YES. [2021-03-11 20:13:25,167 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3998 conditions, 916 events. 397/916 cut-off events. For 2361/3075 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 7028 event pairs, 6 based on Foata normal form. 302/1133 useless extension candidates. Maximal degree in co-relation 3974. Up to 255 conditions per place. [2021-03-11 20:13:25,170 INFO L132 encePairwiseOnDemand]: 199/206 looper letters, 2 selfloop transitions, 33 changer transitions 4/71 dead transitions. [2021-03-11 20:13:25,170 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 71 transitions, 581 flow [2021-03-11 20:13:25,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-11 20:13:25,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-11 20:13:25,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1878 transitions. [2021-03-11 20:13:25,174 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8287731685789939 [2021-03-11 20:13:25,174 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1878 transitions. [2021-03-11 20:13:25,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1878 transitions. [2021-03-11 20:13:25,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:13:25,174 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1878 transitions. [2021-03-11 20:13:25,177 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 170.72727272727272) internal successors, (1878), 11 states have internal predecessors, (1878), 0 states have call successors, (0), 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-03-11 20:13:25,179 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 206.0) internal successors, (2472), 12 states have internal predecessors, (2472), 0 states have call successors, (0), 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-03-11 20:13:25,180 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 206.0) internal successors, (2472), 12 states have internal predecessors, (2472), 0 states have call successors, (0), 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-03-11 20:13:25,180 INFO L185 Difference]: Start difference. First operand has 67 places, 66 transitions, 447 flow. Second operand 11 states and 1878 transitions. [2021-03-11 20:13:25,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 71 transitions, 581 flow [2021-03-11 20:13:25,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 71 transitions, 567 flow, removed 7 selfloop flow, removed 2 redundant places. [2021-03-11 20:13:25,199 INFO L241 Difference]: Finished difference. Result has 76 places, 67 transitions, 527 flow [2021-03-11 20:13:25,199 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=527, PETRI_PLACES=76, PETRI_TRANSITIONS=67} [2021-03-11 20:13:25,199 INFO L335 CegarLoopForPetriNet]: 40 programPoint places, 36 predicate places. [2021-03-11 20:13:25,200 INFO L480 AbstractCegarLoop]: Abstraction has has 76 places, 67 transitions, 527 flow [2021-03-11 20:13:25,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 167.85714285714286) internal successors, (1175), 7 states have internal predecessors, (1175), 0 states have call successors, (0), 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-03-11 20:13:25,200 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:13:25,200 INFO L255 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] [2021-03-11 20:13:25,200 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-11 20:13:25,200 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:13:25,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:13:25,201 INFO L82 PathProgramCache]: Analyzing trace with hash 26445140, now seen corresponding path program 1 times [2021-03-11 20:13:25,201 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:13:25,201 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954378480] [2021-03-11 20:13:25,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:13:25,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:13:25,277 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:25,278 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:13:25,278 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:25,278 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:13:25,280 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:25,281 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:13:25,284 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-11 20:13:25,284 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-11 20:13:25,292 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:25,292 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 20:13:25,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:13:25,298 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954378480] [2021-03-11 20:13:25,298 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:13:25,298 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 20:13:25,298 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545996848] [2021-03-11 20:13:25,298 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 20:13:25,298 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:13:25,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 20:13:25,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-11 20:13:25,299 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 206 [2021-03-11 20:13:25,300 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 67 transitions, 527 flow. Second operand has 6 states, 6 states have (on average 156.5) internal successors, (939), 6 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-03-11 20:13:25,300 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:13:25,300 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 206 [2021-03-11 20:13:25,300 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:13:25,462 INFO L129 PetriNetUnfolder]: 727/1669 cut-off events. [2021-03-11 20:13:25,462 INFO L130 PetriNetUnfolder]: For 5134/6169 co-relation queries the response was YES. [2021-03-11 20:13:25,471 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7381 conditions, 1669 events. 727/1669 cut-off events. For 5134/6169 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 14337 event pairs, 3 based on Foata normal form. 13/1505 useless extension candidates. Maximal degree in co-relation 7350. Up to 465 conditions per place. [2021-03-11 20:13:25,474 INFO L132 encePairwiseOnDemand]: 197/206 looper letters, 14 selfloop transitions, 15 changer transitions 20/94 dead transitions. [2021-03-11 20:13:25,474 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 94 transitions, 824 flow [2021-03-11 20:13:25,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 20:13:25,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 20:13:25,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1113 transitions. [2021-03-11 20:13:25,477 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7718446601941747 [2021-03-11 20:13:25,477 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1113 transitions. [2021-03-11 20:13:25,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1113 transitions. [2021-03-11 20:13:25,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:13:25,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1113 transitions. [2021-03-11 20:13:25,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 159.0) internal successors, (1113), 7 states have internal predecessors, (1113), 0 states have call successors, (0), 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-03-11 20:13:25,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 206.0) internal successors, (1648), 8 states have internal predecessors, (1648), 0 states have call successors, (0), 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-03-11 20:13:25,481 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 206.0) internal successors, (1648), 8 states have internal predecessors, (1648), 0 states have call successors, (0), 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-03-11 20:13:25,481 INFO L185 Difference]: Start difference. First operand has 76 places, 67 transitions, 527 flow. Second operand 7 states and 1113 transitions. [2021-03-11 20:13:25,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 94 transitions, 824 flow [2021-03-11 20:13:25,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 94 transitions, 685 flow, removed 39 selfloop flow, removed 11 redundant places. [2021-03-11 20:13:25,564 INFO L241 Difference]: Finished difference. Result has 73 places, 69 transitions, 472 flow [2021-03-11 20:13:25,565 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=472, PETRI_PLACES=73, PETRI_TRANSITIONS=69} [2021-03-11 20:13:25,565 INFO L335 CegarLoopForPetriNet]: 40 programPoint places, 33 predicate places. [2021-03-11 20:13:25,565 INFO L480 AbstractCegarLoop]: Abstraction has has 73 places, 69 transitions, 472 flow [2021-03-11 20:13:25,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 156.5) internal successors, (939), 6 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-03-11 20:13:25,565 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:13:25,566 INFO L255 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] [2021-03-11 20:13:25,566 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-11 20:13:25,566 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:13:25,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:13:25,566 INFO L82 PathProgramCache]: Analyzing trace with hash -204318268, now seen corresponding path program 2 times [2021-03-11 20:13:25,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:13:25,568 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251927639] [2021-03-11 20:13:25,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:13:25,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:13:25,650 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:25,650 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:13:25,651 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:25,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:13:25,653 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-11 20:13:25,654 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-11 20:13:25,660 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:25,661 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 20:13:25,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:13:25,665 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251927639] [2021-03-11 20:13:25,666 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:13:25,666 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:13:25,666 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598405259] [2021-03-11 20:13:25,666 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:13:25,666 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:13:25,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:13:25,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:13:25,667 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 206 [2021-03-11 20:13:25,668 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 69 transitions, 472 flow. Second operand has 5 states, 5 states have (on average 159.6) internal successors, (798), 5 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:13:25,668 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:13:25,668 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 206 [2021-03-11 20:13:25,668 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:13:25,750 INFO L129 PetriNetUnfolder]: 478/1096 cut-off events. [2021-03-11 20:13:25,750 INFO L130 PetriNetUnfolder]: For 1973/2195 co-relation queries the response was YES. [2021-03-11 20:13:25,754 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4050 conditions, 1096 events. 478/1096 cut-off events. For 1973/2195 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 8851 event pairs, 3 based on Foata normal form. 10/995 useless extension candidates. Maximal degree in co-relation 4026. Up to 310 conditions per place. [2021-03-11 20:13:25,756 INFO L132 encePairwiseOnDemand]: 199/206 looper letters, 9 selfloop transitions, 9 changer transitions 10/74 dead transitions. [2021-03-11 20:13:25,756 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 74 transitions, 562 flow [2021-03-11 20:13:25,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:13:25,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:13:25,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 806 transitions. [2021-03-11 20:13:25,757 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7825242718446602 [2021-03-11 20:13:25,757 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 806 transitions. [2021-03-11 20:13:25,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 806 transitions. [2021-03-11 20:13:25,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:13:25,758 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 806 transitions. [2021-03-11 20:13:25,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 161.2) internal successors, (806), 5 states have internal predecessors, (806), 0 states have call successors, (0), 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-03-11 20:13:25,760 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 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-03-11 20:13:25,760 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 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-03-11 20:13:25,760 INFO L185 Difference]: Start difference. First operand has 73 places, 69 transitions, 472 flow. Second operand 5 states and 806 transitions. [2021-03-11 20:13:25,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 74 transitions, 562 flow [2021-03-11 20:13:25,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 74 transitions, 533 flow, removed 3 selfloop flow, removed 4 redundant places. [2021-03-11 20:13:25,789 INFO L241 Difference]: Finished difference. Result has 73 places, 64 transitions, 429 flow [2021-03-11 20:13:25,789 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=429, PETRI_PLACES=73, PETRI_TRANSITIONS=64} [2021-03-11 20:13:25,790 INFO L335 CegarLoopForPetriNet]: 40 programPoint places, 33 predicate places. [2021-03-11 20:13:25,790 INFO L480 AbstractCegarLoop]: Abstraction has has 73 places, 64 transitions, 429 flow [2021-03-11 20:13:25,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 159.6) internal successors, (798), 5 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:13:25,790 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:13:25,790 INFO L255 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] [2021-03-11 20:13:25,790 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-11 20:13:25,790 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:13:25,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:13:25,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1279737122, now seen corresponding path program 3 times [2021-03-11 20:13:25,791 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:13:25,791 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124899007] [2021-03-11 20:13:25,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:13:25,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 20:13:25,823 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 20:13:25,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 20:13:25,846 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 20:13:25,875 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 20:13:25,875 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 20:13:25,875 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-11 20:13:25,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.03 08:13:25 BasicIcfg [2021-03-11 20:13:25,941 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-11 20:13:25,941 INFO L168 Benchmark]: Toolchain (without parser) took 8937.75 ms. Allocated memory was 356.5 MB in the beginning and 534.8 MB in the end (delta: 178.3 MB). Free memory was 320.1 MB in the beginning and 391.9 MB in the end (delta: -71.7 MB). Peak memory consumption was 109.0 MB. Max. memory is 16.0 GB. [2021-03-11 20:13:25,941 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 356.5 MB. Free memory is still 337.9 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-11 20:13:25,942 INFO L168 Benchmark]: CACSL2BoogieTranslator took 438.93 ms. Allocated memory is still 356.5 MB. Free memory was 319.5 MB in the beginning and 316.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 9.1 MB. Max. memory is 16.0 GB. [2021-03-11 20:13:25,942 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.37 ms. Allocated memory is still 356.5 MB. Free memory was 316.6 MB in the beginning and 314.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 20:13:25,942 INFO L168 Benchmark]: Boogie Preprocessor took 18.74 ms. Allocated memory is still 356.5 MB. Free memory was 314.5 MB in the beginning and 312.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 20:13:25,942 INFO L168 Benchmark]: RCFGBuilder took 1298.20 ms. Allocated memory is still 356.5 MB. Free memory was 312.4 MB in the beginning and 299.7 MB in the end (delta: 12.7 MB). Peak memory consumption was 160.6 MB. Max. memory is 16.0 GB. [2021-03-11 20:13:25,943 INFO L168 Benchmark]: TraceAbstraction took 7143.65 ms. Allocated memory was 356.5 MB in the beginning and 534.8 MB in the end (delta: 178.3 MB). Free memory was 298.6 MB in the beginning and 391.9 MB in the end (delta: -93.3 MB). Peak memory consumption was 85.0 MB. Max. memory is 16.0 GB. [2021-03-11 20:13:25,944 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.10 ms. Allocated memory is still 356.5 MB. Free memory is still 337.9 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 438.93 ms. Allocated memory is still 356.5 MB. Free memory was 319.5 MB in the beginning and 316.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 9.1 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 29.37 ms. Allocated memory is still 356.5 MB. Free memory was 316.6 MB in the beginning and 314.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 18.74 ms. Allocated memory is still 356.5 MB. Free memory was 314.5 MB in the beginning and 312.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1298.20 ms. Allocated memory is still 356.5 MB. Free memory was 312.4 MB in the beginning and 299.7 MB in the end (delta: 12.7 MB). Peak memory consumption was 160.6 MB. Max. memory is 16.0 GB. * TraceAbstraction took 7143.65 ms. Allocated memory was 356.5 MB in the beginning and 534.8 MB in the end (delta: 178.3 MB). Free memory was 298.6 MB in the beginning and 391.9 MB in the end (delta: -93.3 MB). Peak memory consumption was 85.0 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4482.2ms, 120 PlacesBefore, 40 PlacesAfterwards, 109 TransitionsBefore, 28 TransitionsAfterwards, 2300 CoEnabledTransitionPairs, 7 FixpointIterations, 40 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 93 TotalNumberOfCompositions, 5422 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2874, positive: 2710, positive conditional: 0, positive unconditional: 2710, negative: 164, negative conditional: 0, negative unconditional: 164, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1552, positive: 1515, positive conditional: 0, positive unconditional: 1515, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1552, positive: 1484, positive conditional: 0, positive unconditional: 1484, negative: 68, negative conditional: 0, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 68, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 401, positive: 69, positive conditional: 0, positive unconditional: 69, negative: 332, negative conditional: 0, negative unconditional: 332, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2874, positive: 1195, positive conditional: 0, positive unconditional: 1195, negative: 127, negative conditional: 0, negative unconditional: 127, unknown: 1552, unknown conditional: 0, unknown unconditional: 1552] , Statistics on independence cache: Total cache size (in pairs): 185, Positive cache size: 169, Positive conditional cache size: 0, Positive unconditional cache size: 169, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L726] 0 int z = 0; [L727] 0 _Bool z$flush_delayed; [L728] 0 int z$mem_tmp; [L729] 0 _Bool z$r_buff0_thd0; [L730] 0 _Bool z$r_buff0_thd1; [L731] 0 _Bool z$r_buff0_thd2; [L732] 0 _Bool z$r_buff0_thd3; [L733] 0 _Bool z$r_buff0_thd4; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$r_buff1_thd4; [L739] 0 _Bool z$read_delayed; [L740] 0 int *z$read_delayed_var; [L741] 0 int z$w_buff0; [L742] 0 _Bool z$w_buff0_used; [L743] 0 int z$w_buff1; [L744] 0 _Bool z$w_buff1_used; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1373; [L847] FCALL, FORK 0 pthread_create(&t1373, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1374; [L849] FCALL, FORK 0 pthread_create(&t1374, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1375; [L851] FCALL, FORK 0 pthread_create(&t1375, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 pthread_t t1376; [L853] FCALL, FORK 0 pthread_create(&t1376, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L808] 4 z$w_buff1 = z$w_buff0 [L809] 4 z$w_buff0 = 1 [L810] 4 z$w_buff1_used = z$w_buff0_used [L811] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L813] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L814] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L815] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L816] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L817] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L818] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 3 z$flush_delayed = weak$$choice2 [L786] 3 z$mem_tmp = z [L787] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L787] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L788] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L788] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0) [L788] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L788] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L789] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L789] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1) [L789] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L789] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L790] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L790] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used) [L790] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L790] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L791] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L791] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L791] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L791] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L792] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3) [L792] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L792] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L793] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L793] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L793] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L793] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 __unbuffered_p2_EAX = z [L795] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L795] 3 z = z$flush_delayed ? z$mem_tmp : z [L796] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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=49, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 2 return 0; [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 3 return 0; [L824] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L859] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L859] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L861] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L862] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L863] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L866] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 112 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.6ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 6972.6ms, OverallIterations: 10, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1444.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 4561.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 75 SDtfs, 69 SDslu, 84 SDs, 0 SdLazy, 228 SolverSat, 82 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 191.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 220.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=527occurred in iteration=7, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 27.0ms SsaConstructionTime, 291.6ms SatisfiabilityAnalysisTime, 449.9ms InterpolantComputationTime, 184 NumberOfCodeBlocks, 184 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 150 ConstructedInterpolants, 0 QuantifiedInterpolants, 852 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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! Received shutdown request...