/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-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi007_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065 [2021-06-10 12:22:39,928 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-10 12:22:39,929 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-10 12:22:39,956 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-10 12:22:39,956 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-10 12:22:39,957 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-10 12:22:39,958 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-10 12:22:39,960 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-10 12:22:39,961 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-10 12:22:39,962 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-10 12:22:39,963 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-10 12:22:39,964 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-10 12:22:39,964 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-10 12:22:39,965 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-10 12:22:39,966 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-10 12:22:39,967 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-10 12:22:39,967 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-10 12:22:39,968 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-10 12:22:39,969 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-10 12:22:39,971 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-10 12:22:39,972 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-10 12:22:39,973 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-10 12:22:39,974 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-10 12:22:39,975 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-10 12:22:39,977 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-10 12:22:39,977 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-10 12:22:39,978 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-10 12:22:39,978 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-10 12:22:39,979 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-10 12:22:39,979 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-10 12:22:39,980 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-10 12:22:39,980 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-10 12:22:39,981 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-10 12:22:39,981 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-10 12:22:39,982 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-10 12:22:39,982 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-10 12:22:39,983 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-10 12:22:39,983 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-10 12:22:39,983 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-10 12:22:39,984 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-10 12:22:39,984 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-10 12:22:39,990 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-NoLbe.epf [2021-06-10 12:22:40,021 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-10 12:22:40,021 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-10 12:22:40,022 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-10 12:22:40,022 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-10 12:22:40,022 INFO L138 SettingsManager]: * Use SBE=true [2021-06-10 12:22:40,022 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-10 12:22:40,022 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-10 12:22:40,022 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-10 12:22:40,023 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-10 12:22:40,023 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-10 12:22:40,023 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-10 12:22:40,023 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-10 12:22:40,023 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-10 12:22:40,023 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-10 12:22:40,023 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-10 12:22:40,023 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-10 12:22:40,024 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-10 12:22:40,024 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-10 12:22:40,024 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-10 12:22:40,024 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-10 12:22:40,024 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-10 12:22:40,024 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-10 12:22:40,024 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-10 12:22:40,024 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-10 12:22:40,025 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-10 12:22:40,025 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-10 12:22:40,025 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-10 12:22:40,025 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-10 12:22:40,025 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-10 12:22:40,025 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-06-10 12:22:40,320 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-10 12:22:40,337 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-10 12:22:40,339 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-10 12:22:40,340 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-10 12:22:40,341 INFO L275 PluginConnector]: CDTParser initialized [2021-06-10 12:22:40,341 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi007_tso.opt.i [2021-06-10 12:22:40,400 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82f625598/31b9b68e54ef40428002f635ce64fff0/FLAG892fa1387 [2021-06-10 12:22:40,873 INFO L306 CDTParser]: Found 1 translation units. [2021-06-10 12:22:40,874 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi007_tso.opt.i [2021-06-10 12:22:40,886 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82f625598/31b9b68e54ef40428002f635ce64fff0/FLAG892fa1387 [2021-06-10 12:22:41,190 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82f625598/31b9b68e54ef40428002f635ce64fff0 [2021-06-10 12:22:41,192 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-10 12:22:41,193 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-10 12:22:41,196 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-10 12:22:41,196 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-10 12:22:41,204 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-10 12:22:41,205 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.06 12:22:41" (1/1) ... [2021-06-10 12:22:41,206 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d139754 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:22:41, skipping insertion in model container [2021-06-10 12:22:41,206 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.06 12:22:41" (1/1) ... [2021-06-10 12:22:41,213 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-10 12:22:41,255 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-10 12:22:41,381 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/rfi007_tso.opt.i[948,961] [2021-06-10 12:22:41,598 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-10 12:22:41,605 INFO L203 MainTranslator]: Completed pre-run [2021-06-10 12:22:41,615 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/rfi007_tso.opt.i[948,961] [2021-06-10 12:22:41,654 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-10 12:22:41,718 INFO L208 MainTranslator]: Completed translation [2021-06-10 12:22:41,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:22:41 WrapperNode [2021-06-10 12:22:41,719 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-10 12:22:41,719 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-10 12:22:41,719 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-10 12:22:41,720 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-10 12:22:41,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:22:41" (1/1) ... [2021-06-10 12:22:41,741 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:22:41" (1/1) ... [2021-06-10 12:22:41,775 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-10 12:22:41,775 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-10 12:22:41,776 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-10 12:22:41,776 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-10 12:22:41,781 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:22:41" (1/1) ... [2021-06-10 12:22:41,781 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:22:41" (1/1) ... [2021-06-10 12:22:41,785 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:22:41" (1/1) ... [2021-06-10 12:22:41,786 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:22:41" (1/1) ... [2021-06-10 12:22:41,795 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:22:41" (1/1) ... [2021-06-10 12:22:41,798 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:22:41" (1/1) ... [2021-06-10 12:22:41,801 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:22:41" (1/1) ... [2021-06-10 12:22:41,818 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-10 12:22:41,819 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-10 12:22:41,819 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-10 12:22:41,819 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-10 12:22:41,820 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:22:41" (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-06-10 12:22:41,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-10 12:22:41,910 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-10 12:22:41,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-10 12:22:41,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-10 12:22:41,910 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-10 12:22:41,910 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-10 12:22:41,910 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-10 12:22:41,911 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-10 12:22:41,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-10 12:22:41,911 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-10 12:22:41,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-10 12:22:41,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-10 12:22:41,912 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-10 12:22:43,791 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-10 12:22:43,791 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-10 12:22:43,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.06 12:22:43 BoogieIcfgContainer [2021-06-10 12:22:43,793 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-10 12:22:43,794 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-10 12:22:43,794 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-10 12:22:43,796 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-10 12:22:43,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.06 12:22:41" (1/3) ... [2021-06-10 12:22:43,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d4f95c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.06 12:22:43, skipping insertion in model container [2021-06-10 12:22:43,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:22:41" (2/3) ... [2021-06-10 12:22:43,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d4f95c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.06 12:22:43, skipping insertion in model container [2021-06-10 12:22:43,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.06 12:22:43" (3/3) ... [2021-06-10 12:22:43,799 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi007_tso.opt.i [2021-06-10 12:22:43,804 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-10 12:22:43,808 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-06-10 12:22:43,809 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-10 12:22:43,839 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,840 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,840 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,840 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,840 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,840 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,840 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,841 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,841 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,841 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,841 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,841 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,841 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,841 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,841 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,842 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,842 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,842 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,842 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,842 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,842 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,842 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,843 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,843 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,843 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,843 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,843 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,843 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,844 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,844 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,844 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,844 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,844 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,844 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,844 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,844 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,845 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,845 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,845 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,845 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,845 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,845 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,853 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,853 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,853 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,853 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,853 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,853 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,853 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,853 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,853 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,853 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,856 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,856 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,857 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,857 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,857 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,857 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,857 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,857 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,857 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,857 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,858 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,858 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,858 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,858 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,858 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,858 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,858 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,859 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,860 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,860 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,860 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,861 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,861 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,861 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,861 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,861 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,861 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,861 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,863 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,863 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,863 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,863 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,863 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,863 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,864 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,864 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,864 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,864 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,864 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,864 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,864 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,864 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,864 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,864 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,865 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,865 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,865 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,865 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,865 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,865 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,865 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,865 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,865 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,866 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,866 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,866 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,866 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,866 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,866 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,866 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,866 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,867 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,867 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:22:43,868 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 12:22:43,883 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-06-10 12:22:43,900 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 12:22:43,900 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 12:22:43,901 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 12:22:43,901 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 12:22:43,901 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 12:22:43,901 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 12:22:43,901 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 12:22:43,901 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 12:22:43,910 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 87 places, 82 transitions, 174 flow [2021-06-10 12:22:43,939 INFO L129 PetriNetUnfolder]: 2/80 cut-off events. [2021-06-10 12:22:43,940 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 12:22:43,943 INFO L84 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 80 events. 2/80 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2021-06-10 12:22:43,943 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 82 transitions, 174 flow [2021-06-10 12:22:43,947 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 85 places, 80 transitions, 166 flow [2021-06-10 12:22:43,956 INFO L129 PetriNetUnfolder]: 0/47 cut-off events. [2021-06-10 12:22:43,957 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 12:22:43,957 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:22:43,958 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 12:22:43,958 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:22:43,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:22:43,962 INFO L82 PathProgramCache]: Analyzing trace with hash -40387305, now seen corresponding path program 1 times [2021-06-10 12:22:43,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:22:43,970 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111445161] [2021-06-10 12:22:43,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:22:44,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:22:44,216 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:22:44,217 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:22:44,218 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:22:44,218 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:22:44,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 12:22:44,228 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111445161] [2021-06-10 12:22:44,228 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:22:44,228 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-10 12:22:44,229 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043637927] [2021-06-10 12:22:44,237 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 12:22:44,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:22:44,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 12:22:44,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 12:22:44,254 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 82 [2021-06-10 12:22:44,258 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 80 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 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-06-10 12:22:44,258 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:22:44,259 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 82 [2021-06-10 12:22:44,260 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:22:44,398 INFO L129 PetriNetUnfolder]: 23/222 cut-off events. [2021-06-10 12:22:44,398 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 12:22:44,401 INFO L84 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 222 events. 23/222 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 900 event pairs, 10 based on Foata normal form. 12/220 useless extension candidates. Maximal degree in co-relation 235. Up to 40 conditions per place. [2021-06-10 12:22:44,403 INFO L132 encePairwiseOnDemand]: 77/82 looper letters, 8 selfloop transitions, 2 changer transitions 0/79 dead transitions. [2021-06-10 12:22:44,406 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 79 transitions, 184 flow [2021-06-10 12:22:44,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 12:22:44,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 12:22:44,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 228 transitions. [2021-06-10 12:22:44,423 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.926829268292683 [2021-06-10 12:22:44,424 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 228 transitions. [2021-06-10 12:22:44,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 228 transitions. [2021-06-10 12:22:44,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:22:44,428 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 228 transitions. [2021-06-10 12:22:44,432 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 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-06-10 12:22:44,438 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 82.0) internal successors, (328), 4 states have internal predecessors, (328), 0 states have call successors, (0), 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-06-10 12:22:44,438 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 82.0) internal successors, (328), 4 states have internal predecessors, (328), 0 states have call successors, (0), 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-06-10 12:22:44,440 INFO L185 Difference]: Start difference. First operand has 85 places, 80 transitions, 166 flow. Second operand 3 states and 228 transitions. [2021-06-10 12:22:44,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 79 transitions, 184 flow [2021-06-10 12:22:44,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 79 transitions, 182 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-10 12:22:44,449 INFO L241 Difference]: Finished difference. Result has 83 places, 76 transitions, 160 flow [2021-06-10 12:22:44,451 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=83, PETRI_TRANSITIONS=76} [2021-06-10 12:22:44,452 INFO L343 CegarLoopForPetriNet]: 85 programPoint places, -2 predicate places. [2021-06-10 12:22:44,452 INFO L480 AbstractCegarLoop]: Abstraction has has 83 places, 76 transitions, 160 flow [2021-06-10 12:22:44,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 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-06-10 12:22:44,452 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:22:44,453 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 12:22:44,453 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-10 12:22:44,453 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:22:44,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:22:44,454 INFO L82 PathProgramCache]: Analyzing trace with hash -88225804, now seen corresponding path program 1 times [2021-06-10 12:22:44,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:22:44,454 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808443292] [2021-06-10 12:22:44,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:22:44,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:22:44,699 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:22:44,699 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:22:44,701 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:22:44,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:22:44,708 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:22:44,709 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 12:22:44,722 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:22:44,722 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-10 12:22:44,732 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:22:44,733 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 12:22:44,753 INFO L142 QuantifierPusher]: treesize reduction 10, result has 80.4 percent of original size [2021-06-10 12:22:44,755 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-06-10 12:22:44,774 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 12:22:44,775 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 12:22:44,800 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:22:44,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:22:44,813 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:22:44,814 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:22:44,825 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:22:44,825 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:22:44,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 12:22:44,827 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808443292] [2021-06-10 12:22:44,827 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:22:44,827 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-10 12:22:44,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585726793] [2021-06-10 12:22:44,829 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-10 12:22:44,829 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:22:44,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-10 12:22:44,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-06-10 12:22:44,833 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 82 [2021-06-10 12:22:44,834 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 76 transitions, 160 flow. Second operand has 10 states, 10 states have (on average 62.1) internal successors, (621), 10 states have internal predecessors, (621), 0 states have call successors, (0), 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-06-10 12:22:44,834 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:22:44,835 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 82 [2021-06-10 12:22:44,835 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:22:45,231 INFO L129 PetriNetUnfolder]: 189/616 cut-off events. [2021-06-10 12:22:45,231 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 12:22:45,233 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1001 conditions, 616 events. 189/616 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3666 event pairs, 75 based on Foata normal form. 0/597 useless extension candidates. Maximal degree in co-relation 955. Up to 204 conditions per place. [2021-06-10 12:22:45,235 INFO L132 encePairwiseOnDemand]: 70/82 looper letters, 13 selfloop transitions, 10 changer transitions 48/123 dead transitions. [2021-06-10 12:22:45,235 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 123 transitions, 396 flow [2021-06-10 12:22:45,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-10 12:22:45,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-06-10 12:22:45,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 982 transitions. [2021-06-10 12:22:45,240 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7983739837398374 [2021-06-10 12:22:45,240 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 982 transitions. [2021-06-10 12:22:45,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 982 transitions. [2021-06-10 12:22:45,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:22:45,241 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 982 transitions. [2021-06-10 12:22:45,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 65.46666666666667) internal successors, (982), 15 states have internal predecessors, (982), 0 states have call successors, (0), 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-06-10 12:22:45,246 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 82.0) internal successors, (1312), 16 states have internal predecessors, (1312), 0 states have call successors, (0), 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-06-10 12:22:45,247 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 82.0) internal successors, (1312), 16 states have internal predecessors, (1312), 0 states have call successors, (0), 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-06-10 12:22:45,247 INFO L185 Difference]: Start difference. First operand has 83 places, 76 transitions, 160 flow. Second operand 15 states and 982 transitions. [2021-06-10 12:22:45,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 123 transitions, 396 flow [2021-06-10 12:22:45,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 123 transitions, 378 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-10 12:22:45,250 INFO L241 Difference]: Finished difference. Result has 106 places, 74 transitions, 224 flow [2021-06-10 12:22:45,250 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=224, PETRI_PLACES=106, PETRI_TRANSITIONS=74} [2021-06-10 12:22:45,251 INFO L343 CegarLoopForPetriNet]: 85 programPoint places, 21 predicate places. [2021-06-10 12:22:45,251 INFO L480 AbstractCegarLoop]: Abstraction has has 106 places, 74 transitions, 224 flow [2021-06-10 12:22:45,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 62.1) internal successors, (621), 10 states have internal predecessors, (621), 0 states have call successors, (0), 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-06-10 12:22:45,252 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:22:45,252 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 12:22:45,252 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-10 12:22:45,252 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:22:45,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:22:45,252 INFO L82 PathProgramCache]: Analyzing trace with hash 208650322, now seen corresponding path program 1 times [2021-06-10 12:22:45,253 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:22:45,253 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188704779] [2021-06-10 12:22:45,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:22:45,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:22:45,329 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:22:45,330 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:22:45,330 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:22:45,331 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:22:45,335 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 12:22:45,336 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 12:22:45,351 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:22:45,352 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:22:45,361 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:22:45,363 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:22:45,371 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:22:45,371 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:22:45,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 12:22:45,372 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188704779] [2021-06-10 12:22:45,372 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:22:45,373 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-10 12:22:45,373 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641337867] [2021-06-10 12:22:45,373 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-10 12:22:45,373 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:22:45,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-10 12:22:45,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-10 12:22:45,375 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 82 [2021-06-10 12:22:45,376 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 74 transitions, 224 flow. Second operand has 6 states, 6 states have (on average 71.16666666666667) internal successors, (427), 6 states have internal predecessors, (427), 0 states have call successors, (0), 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-06-10 12:22:45,376 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:22:45,376 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 82 [2021-06-10 12:22:45,376 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:22:45,521 INFO L129 PetriNetUnfolder]: 20/170 cut-off events. [2021-06-10 12:22:45,521 INFO L130 PetriNetUnfolder]: For 203/203 co-relation queries the response was YES. [2021-06-10 12:22:45,523 INFO L84 FinitePrefix]: Finished finitePrefix Result has 388 conditions, 170 events. 20/170 cut-off events. For 203/203 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 576 event pairs, 5 based on Foata normal form. 5/171 useless extension candidates. Maximal degree in co-relation 362. Up to 29 conditions per place. [2021-06-10 12:22:45,525 INFO L132 encePairwiseOnDemand]: 76/82 looper letters, 6 selfloop transitions, 4 changer transitions 10/84 dead transitions. [2021-06-10 12:22:45,525 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 84 transitions, 336 flow [2021-06-10 12:22:45,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-10 12:22:45,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-10 12:22:45,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 650 transitions. [2021-06-10 12:22:45,528 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8807588075880759 [2021-06-10 12:22:45,528 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 650 transitions. [2021-06-10 12:22:45,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 650 transitions. [2021-06-10 12:22:45,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:22:45,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 650 transitions. [2021-06-10 12:22:45,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 72.22222222222223) internal successors, (650), 9 states have internal predecessors, (650), 0 states have call successors, (0), 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-06-10 12:22:45,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 82.0) internal successors, (820), 10 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:22:45,533 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 82.0) internal successors, (820), 10 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:22:45,533 INFO L185 Difference]: Start difference. First operand has 106 places, 74 transitions, 224 flow. Second operand 9 states and 650 transitions. [2021-06-10 12:22:45,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 84 transitions, 336 flow [2021-06-10 12:22:45,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 84 transitions, 308 flow, removed 12 selfloop flow, removed 5 redundant places. [2021-06-10 12:22:45,539 INFO L241 Difference]: Finished difference. Result has 99 places, 74 transitions, 238 flow [2021-06-10 12:22:45,540 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=238, PETRI_PLACES=99, PETRI_TRANSITIONS=74} [2021-06-10 12:22:45,540 INFO L343 CegarLoopForPetriNet]: 85 programPoint places, 14 predicate places. [2021-06-10 12:22:45,540 INFO L480 AbstractCegarLoop]: Abstraction has has 99 places, 74 transitions, 238 flow [2021-06-10 12:22:45,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 71.16666666666667) internal successors, (427), 6 states have internal predecessors, (427), 0 states have call successors, (0), 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-06-10 12:22:45,540 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:22:45,540 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 12:22:45,541 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-10 12:22:45,541 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:22:45,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:22:45,541 INFO L82 PathProgramCache]: Analyzing trace with hash -807824474, now seen corresponding path program 1 times [2021-06-10 12:22:45,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:22:45,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542525826] [2021-06-10 12:22:45,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:22:45,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:22:45,649 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:22:45,649 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:22:45,650 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:22:45,650 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:22:45,653 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-06-10 12:22:45,654 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-10 12:22:45,667 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:22:45,668 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 12:22:45,675 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-06-10 12:22:45,676 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:22:45,684 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:22:45,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:22:45,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 12:22:45,685 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542525826] [2021-06-10 12:22:45,685 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:22:45,685 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-10 12:22:45,686 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342760053] [2021-06-10 12:22:45,686 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-10 12:22:45,686 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:22:45,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-10 12:22:45,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-10 12:22:45,687 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 82 [2021-06-10 12:22:45,688 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 74 transitions, 238 flow. Second operand has 6 states, 6 states have (on average 70.16666666666667) internal successors, (421), 6 states have internal predecessors, (421), 0 states have call successors, (0), 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-06-10 12:22:45,688 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:22:45,688 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 82 [2021-06-10 12:22:45,688 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:22:45,828 INFO L129 PetriNetUnfolder]: 39/210 cut-off events. [2021-06-10 12:22:45,828 INFO L130 PetriNetUnfolder]: For 102/102 co-relation queries the response was YES. [2021-06-10 12:22:45,829 INFO L84 FinitePrefix]: Finished finitePrefix Result has 427 conditions, 210 events. 39/210 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 895 event pairs, 2 based on Foata normal form. 0/197 useless extension candidates. Maximal degree in co-relation 384. Up to 32 conditions per place. [2021-06-10 12:22:45,830 INFO L132 encePairwiseOnDemand]: 73/82 looper letters, 13 selfloop transitions, 12 changer transitions 9/96 dead transitions. [2021-06-10 12:22:45,830 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 96 transitions, 345 flow [2021-06-10 12:22:45,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-10 12:22:45,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-06-10 12:22:45,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 725 transitions. [2021-06-10 12:22:45,832 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8841463414634146 [2021-06-10 12:22:45,833 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 725 transitions. [2021-06-10 12:22:45,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 725 transitions. [2021-06-10 12:22:45,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:22:45,833 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 725 transitions. [2021-06-10 12:22:45,835 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 72.5) internal successors, (725), 10 states have internal predecessors, (725), 0 states have call successors, (0), 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-06-10 12:22:45,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 82.0) internal successors, (902), 11 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:22:45,836 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 82.0) internal successors, (902), 11 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:22:45,836 INFO L185 Difference]: Start difference. First operand has 99 places, 74 transitions, 238 flow. Second operand 10 states and 725 transitions. [2021-06-10 12:22:45,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 96 transitions, 345 flow [2021-06-10 12:22:45,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 96 transitions, 314 flow, removed 14 selfloop flow, removed 11 redundant places. [2021-06-10 12:22:45,840 INFO L241 Difference]: Finished difference. Result has 98 places, 83 transitions, 278 flow [2021-06-10 12:22:45,840 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=278, PETRI_PLACES=98, PETRI_TRANSITIONS=83} [2021-06-10 12:22:45,840 INFO L343 CegarLoopForPetriNet]: 85 programPoint places, 13 predicate places. [2021-06-10 12:22:45,840 INFO L480 AbstractCegarLoop]: Abstraction has has 98 places, 83 transitions, 278 flow [2021-06-10 12:22:45,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 70.16666666666667) internal successors, (421), 6 states have internal predecessors, (421), 0 states have call successors, (0), 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-06-10 12:22:45,841 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:22:45,841 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 12:22:45,841 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-10 12:22:45,841 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:22:45,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:22:45,841 INFO L82 PathProgramCache]: Analyzing trace with hash -305356328, now seen corresponding path program 1 times [2021-06-10 12:22:45,842 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:22:45,842 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431573988] [2021-06-10 12:22:45,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:22:45,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:22:45,931 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:22:45,932 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:22:45,932 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:22:45,933 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:22:45,935 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:22:45,936 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:22:45,940 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-06-10 12:22:45,940 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-10 12:22:45,955 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:22:45,955 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 12:22:45,967 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-06-10 12:22:45,968 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:22:45,976 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:22:45,977 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:22:45,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 12:22:45,978 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431573988] [2021-06-10 12:22:45,978 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:22:45,978 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-10 12:22:45,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733660744] [2021-06-10 12:22:45,979 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-10 12:22:45,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:22:45,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-10 12:22:45,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-10 12:22:45,985 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 82 [2021-06-10 12:22:45,986 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 83 transitions, 278 flow. Second operand has 7 states, 7 states have (on average 70.14285714285714) internal successors, (491), 7 states have internal predecessors, (491), 0 states have call successors, (0), 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-06-10 12:22:45,986 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:22:45,986 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 82 [2021-06-10 12:22:45,986 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:22:46,167 INFO L129 PetriNetUnfolder]: 24/177 cut-off events. [2021-06-10 12:22:46,167 INFO L130 PetriNetUnfolder]: For 118/226 co-relation queries the response was YES. [2021-06-10 12:22:46,168 INFO L84 FinitePrefix]: Finished finitePrefix Result has 419 conditions, 177 events. 24/177 cut-off events. For 118/226 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 698 event pairs, 0 based on Foata normal form. 25/196 useless extension candidates. Maximal degree in co-relation 398. Up to 19 conditions per place. [2021-06-10 12:22:46,169 INFO L132 encePairwiseOnDemand]: 73/82 looper letters, 11 selfloop transitions, 15 changer transitions 13/101 dead transitions. [2021-06-10 12:22:46,169 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 101 transitions, 436 flow [2021-06-10 12:22:46,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-10 12:22:46,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-06-10 12:22:46,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 931 transitions. [2021-06-10 12:22:46,171 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.873358348968105 [2021-06-10 12:22:46,172 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 931 transitions. [2021-06-10 12:22:46,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 931 transitions. [2021-06-10 12:22:46,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:22:46,172 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 931 transitions. [2021-06-10 12:22:46,174 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 71.61538461538461) internal successors, (931), 13 states have internal predecessors, (931), 0 states have call successors, (0), 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-06-10 12:22:46,176 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 82.0) internal successors, (1148), 14 states have internal predecessors, (1148), 0 states have call successors, (0), 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-06-10 12:22:46,176 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 82.0) internal successors, (1148), 14 states have internal predecessors, (1148), 0 states have call successors, (0), 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-06-10 12:22:46,176 INFO L185 Difference]: Start difference. First operand has 98 places, 83 transitions, 278 flow. Second operand 13 states and 931 transitions. [2021-06-10 12:22:46,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 101 transitions, 436 flow [2021-06-10 12:22:46,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 101 transitions, 416 flow, removed 6 selfloop flow, removed 5 redundant places. [2021-06-10 12:22:46,181 INFO L241 Difference]: Finished difference. Result has 111 places, 85 transitions, 333 flow [2021-06-10 12:22:46,181 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=333, PETRI_PLACES=111, PETRI_TRANSITIONS=85} [2021-06-10 12:22:46,181 INFO L343 CegarLoopForPetriNet]: 85 programPoint places, 26 predicate places. [2021-06-10 12:22:46,181 INFO L480 AbstractCegarLoop]: Abstraction has has 111 places, 85 transitions, 333 flow [2021-06-10 12:22:46,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 70.14285714285714) internal successors, (491), 7 states have internal predecessors, (491), 0 states have call successors, (0), 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-06-10 12:22:46,183 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:22:46,183 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 12:22:46,183 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-10 12:22:46,183 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:22:46,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:22:46,184 INFO L82 PathProgramCache]: Analyzing trace with hash -100801920, now seen corresponding path program 1 times [2021-06-10 12:22:46,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:22:46,184 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936154834] [2021-06-10 12:22:46,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:22:46,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:22:46,330 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:22:46,331 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:22:46,331 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:22:46,332 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:22:46,334 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:22:46,335 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:22:46,339 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 12:22:46,340 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 12:22:46,356 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:22:46,357 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:22:46,364 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:22:46,365 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:22:46,374 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:22:46,374 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:22:46,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 12:22:46,376 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936154834] [2021-06-10 12:22:46,376 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:22:46,377 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-10 12:22:46,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382216648] [2021-06-10 12:22:46,377 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-10 12:22:46,378 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:22:46,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-10 12:22:46,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-10 12:22:46,379 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 82 [2021-06-10 12:22:46,380 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 85 transitions, 333 flow. Second operand has 7 states, 7 states have (on average 69.42857142857143) internal successors, (486), 7 states have internal predecessors, (486), 0 states have call successors, (0), 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-06-10 12:22:46,380 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:22:46,380 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 82 [2021-06-10 12:22:46,380 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:22:46,482 INFO L129 PetriNetUnfolder]: 12/196 cut-off events. [2021-06-10 12:22:46,483 INFO L130 PetriNetUnfolder]: For 238/251 co-relation queries the response was YES. [2021-06-10 12:22:46,483 INFO L84 FinitePrefix]: Finished finitePrefix Result has 478 conditions, 196 events. 12/196 cut-off events. For 238/251 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 905 event pairs, 0 based on Foata normal form. 1/192 useless extension candidates. Maximal degree in co-relation 429. Up to 23 conditions per place. [2021-06-10 12:22:46,484 INFO L132 encePairwiseOnDemand]: 76/82 looper letters, 9 selfloop transitions, 1 changer transitions 21/90 dead transitions. [2021-06-10 12:22:46,484 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 90 transitions, 373 flow [2021-06-10 12:22:46,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-10 12:22:46,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-10 12:22:46,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 492 transitions. [2021-06-10 12:22:46,486 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2021-06-10 12:22:46,486 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 492 transitions. [2021-06-10 12:22:46,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 492 transitions. [2021-06-10 12:22:46,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:22:46,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 492 transitions. [2021-06-10 12:22:46,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 70.28571428571429) internal successors, (492), 7 states have internal predecessors, (492), 0 states have call successors, (0), 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-06-10 12:22:46,489 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 82.0) internal successors, (656), 8 states have internal predecessors, (656), 0 states have call successors, (0), 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-06-10 12:22:46,490 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 82.0) internal successors, (656), 8 states have internal predecessors, (656), 0 states have call successors, (0), 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-06-10 12:22:46,490 INFO L185 Difference]: Start difference. First operand has 111 places, 85 transitions, 333 flow. Second operand 7 states and 492 transitions. [2021-06-10 12:22:46,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 90 transitions, 373 flow [2021-06-10 12:22:46,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 90 transitions, 339 flow, removed 6 selfloop flow, removed 10 redundant places. [2021-06-10 12:22:46,494 INFO L241 Difference]: Finished difference. Result has 109 places, 69 transitions, 216 flow [2021-06-10 12:22:46,494 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=216, PETRI_PLACES=109, PETRI_TRANSITIONS=69} [2021-06-10 12:22:46,494 INFO L343 CegarLoopForPetriNet]: 85 programPoint places, 24 predicate places. [2021-06-10 12:22:46,494 INFO L480 AbstractCegarLoop]: Abstraction has has 109 places, 69 transitions, 216 flow [2021-06-10 12:22:46,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 69.42857142857143) internal successors, (486), 7 states have internal predecessors, (486), 0 states have call successors, (0), 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-06-10 12:22:46,495 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:22:46,495 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 12:22:46,495 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-10 12:22:46,495 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:22:46,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:22:46,496 INFO L82 PathProgramCache]: Analyzing trace with hash -121729470, now seen corresponding path program 2 times [2021-06-10 12:22:46,496 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:22:46,496 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598036379] [2021-06-10 12:22:46,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:22:46,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:22:46,684 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:22:46,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:22:46,685 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:22:46,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:22:46,691 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:22:46,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 12:22:46,699 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:22:46,699 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-10 12:22:46,707 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:22:46,708 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 12:22:46,720 INFO L142 QuantifierPusher]: treesize reduction 9, result has 79.1 percent of original size [2021-06-10 12:22:46,724 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-06-10 12:22:46,747 INFO L142 QuantifierPusher]: treesize reduction 10, result has 84.8 percent of original size [2021-06-10 12:22:46,749 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 56 [2021-06-10 12:22:46,778 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:22:46,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-06-10 12:22:46,787 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:22:46,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-06-10 12:22:46,809 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:22:46,810 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-06-10 12:22:46,833 INFO L142 QuantifierPusher]: treesize reduction 47, result has 65.7 percent of original size [2021-06-10 12:22:46,836 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 90 [2021-06-10 12:22:46,914 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 12:22:46,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 12:22:46,935 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:22:46,936 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:22:46,948 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:22:46,951 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:22:46,964 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:22:46,965 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:22:46,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 12:22:46,965 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598036379] [2021-06-10 12:22:46,967 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:22:46,967 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-06-10 12:22:46,967 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429032548] [2021-06-10 12:22:46,968 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-10 12:22:46,968 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:22:46,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-10 12:22:46,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-06-10 12:22:46,970 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 82 [2021-06-10 12:22:46,971 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 69 transitions, 216 flow. Second operand has 14 states, 14 states have (on average 57.5) internal successors, (805), 14 states have internal predecessors, (805), 0 states have call successors, (0), 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-06-10 12:22:46,971 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:22:46,971 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 82 [2021-06-10 12:22:46,971 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:22:47,246 INFO L129 PetriNetUnfolder]: 3/105 cut-off events. [2021-06-10 12:22:47,246 INFO L130 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2021-06-10 12:22:47,247 INFO L84 FinitePrefix]: Finished finitePrefix Result has 225 conditions, 105 events. 3/105 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 170 event pairs, 0 based on Foata normal form. 1/105 useless extension candidates. Maximal degree in co-relation 203. Up to 11 conditions per place. [2021-06-10 12:22:47,247 INFO L132 encePairwiseOnDemand]: 70/82 looper letters, 14 selfloop transitions, 8 changer transitions 6/76 dead transitions. [2021-06-10 12:22:47,247 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 76 transitions, 292 flow [2021-06-10 12:22:47,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-10 12:22:47,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-06-10 12:22:47,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 701 transitions. [2021-06-10 12:22:47,249 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7123983739837398 [2021-06-10 12:22:47,249 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 701 transitions. [2021-06-10 12:22:47,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 701 transitions. [2021-06-10 12:22:47,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:22:47,249 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 701 transitions. [2021-06-10 12:22:47,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 58.416666666666664) internal successors, (701), 12 states have internal predecessors, (701), 0 states have call successors, (0), 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-06-10 12:22:47,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 82.0) internal successors, (1066), 13 states have internal predecessors, (1066), 0 states have call successors, (0), 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-06-10 12:22:47,252 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 82.0) internal successors, (1066), 13 states have internal predecessors, (1066), 0 states have call successors, (0), 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-06-10 12:22:47,252 INFO L185 Difference]: Start difference. First operand has 109 places, 69 transitions, 216 flow. Second operand 12 states and 701 transitions. [2021-06-10 12:22:47,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 76 transitions, 292 flow [2021-06-10 12:22:47,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 76 transitions, 230 flow, removed 15 selfloop flow, removed 19 redundant places. [2021-06-10 12:22:47,254 INFO L241 Difference]: Finished difference. Result has 93 places, 69 transitions, 186 flow [2021-06-10 12:22:47,255 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=186, PETRI_PLACES=93, PETRI_TRANSITIONS=69} [2021-06-10 12:22:47,255 INFO L343 CegarLoopForPetriNet]: 85 programPoint places, 8 predicate places. [2021-06-10 12:22:47,255 INFO L480 AbstractCegarLoop]: Abstraction has has 93 places, 69 transitions, 186 flow [2021-06-10 12:22:47,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 57.5) internal successors, (805), 14 states have internal predecessors, (805), 0 states have call successors, (0), 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-06-10 12:22:47,255 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:22:47,256 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 12:22:47,256 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-10 12:22:47,256 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:22:47,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:22:47,256 INFO L82 PathProgramCache]: Analyzing trace with hash 755036540, now seen corresponding path program 3 times [2021-06-10 12:22:47,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:22:47,256 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256421430] [2021-06-10 12:22:47,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:22:47,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 12:22:47,310 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 12:22:47,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 12:22:47,367 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 12:22:47,397 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 12:22:47,397 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 12:22:47,397 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-10 12:22:47,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.06 12:22:47 BasicIcfg [2021-06-10 12:22:47,514 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-10 12:22:47,514 INFO L168 Benchmark]: Toolchain (without parser) took 6321.35 ms. Allocated memory was 343.9 MB in the beginning and 413.1 MB in the end (delta: 69.2 MB). Free memory was 306.9 MB in the beginning and 260.4 MB in the end (delta: 46.5 MB). Peak memory consumption was 118.5 MB. Max. memory is 16.0 GB. [2021-06-10 12:22:47,515 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 343.9 MB. Free memory was 325.1 MB in the beginning and 325.0 MB in the end (delta: 70.3 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-10 12:22:47,515 INFO L168 Benchmark]: CACSL2BoogieTranslator took 522.60 ms. Allocated memory is still 343.9 MB. Free memory was 306.7 MB in the beginning and 302.1 MB in the end (delta: 4.6 MB). Peak memory consumption was 9.1 MB. Max. memory is 16.0 GB. [2021-06-10 12:22:47,515 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.50 ms. Allocated memory is still 343.9 MB. Free memory was 302.1 MB in the beginning and 299.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-10 12:22:47,516 INFO L168 Benchmark]: Boogie Preprocessor took 42.87 ms. Allocated memory is still 343.9 MB. Free memory was 299.1 MB in the beginning and 297.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-10 12:22:47,516 INFO L168 Benchmark]: RCFGBuilder took 1973.95 ms. Allocated memory is still 343.9 MB. Free memory was 297.0 MB in the beginning and 168.5 MB in the end (delta: 128.5 MB). Peak memory consumption was 142.1 MB. Max. memory is 16.0 GB. [2021-06-10 12:22:47,516 INFO L168 Benchmark]: TraceAbstraction took 3719.74 ms. Allocated memory was 343.9 MB in the beginning and 413.1 MB in the end (delta: 69.2 MB). Free memory was 168.5 MB in the beginning and 260.4 MB in the end (delta: -91.8 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-10 12:22:47,518 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.14 ms. Allocated memory is still 343.9 MB. Free memory was 325.1 MB in the beginning and 325.0 MB in the end (delta: 70.3 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 522.60 ms. Allocated memory is still 343.9 MB. Free memory was 306.7 MB in the beginning and 302.1 MB in the end (delta: 4.6 MB). Peak memory consumption was 9.1 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 55.50 ms. Allocated memory is still 343.9 MB. Free memory was 302.1 MB in the beginning and 299.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 42.87 ms. Allocated memory is still 343.9 MB. Free memory was 299.1 MB in the beginning and 297.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1973.95 ms. Allocated memory is still 343.9 MB. Free memory was 297.0 MB in the beginning and 168.5 MB in the end (delta: 128.5 MB). Peak memory consumption was 142.1 MB. Max. memory is 16.0 GB. * TraceAbstraction took 3719.74 ms. Allocated memory was 343.9 MB in the beginning and 413.1 MB in the end (delta: 69.2 MB). Free memory was 168.5 MB in the beginning and 260.4 MB in the end (delta: -91.8 MB). There was no memory consumed. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L712] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L713] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L714] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L716] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L718] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L719] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L720] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L721] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L722] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L723] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L724] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L725] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L726] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L727] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L728] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L729] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L730] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L731] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L732] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L733] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L734] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L810] 0 pthread_t t1719; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L811] FCALL, FORK 0 pthread_create(&t1719, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L812] 0 pthread_t t1720; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L813] FCALL, FORK 0 pthread_create(&t1720, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L758] 2 y$w_buff1 = y$w_buff0 [L759] 2 y$w_buff0 = 2 [L760] 2 y$w_buff1_used = y$w_buff0_used [L761] 2 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L763] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L764] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L765] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L766] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L769] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L770] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L771] 2 y$flush_delayed = weak$$choice2 [L772] 2 y$mem_tmp = y [L773] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1 [L773] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L773] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L774] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L774] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L775] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L775] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L776] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L776] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L777] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L778] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L779] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] 2 __unbuffered_p1_EAX = y [L781] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L781] 2 y = y$flush_delayed ? y$mem_tmp : y [L782] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L785] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L744] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y [L744] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L744] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L745] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L745] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L746] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L746] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L747] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L748] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L788] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L788] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L789] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L789] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L790] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L791] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L792] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L792] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L815] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L819] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L819] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L819] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L819] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L820] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L820] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L821] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L821] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L822] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L823] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L823] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L826] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 0 y$flush_delayed = weak$$choice2 [L829] 0 y$mem_tmp = y [L830] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L830] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L831] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L831] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L832] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L832] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L833] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L833] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L834] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L834] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L835] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L836] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L836] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [L838] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L838] 0 y = y$flush_delayed ? y$mem_tmp : y [L839] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] 0 reach_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 81 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 9.5ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 3501.3ms, OverallIterations: 8, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1548.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 45.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 59 SDtfs, 191 SDslu, 214 SDs, 0 SdLazy, 332 SolverSat, 57 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 372.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 963.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=333occurred in iteration=5, InterpolantAutomatonStates: 69, 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: 37.2ms SsaConstructionTime, 483.6ms SatisfiabilityAnalysisTime, 1068.9ms InterpolantComputationTime, 449 NumberOfCodeBlocks, 449 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 379 ConstructedInterpolants, 0 QuantifiedInterpolants, 1805 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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...