/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe032_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-11 18:45:22,837 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-11 18:45:22,840 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-11 18:45:22,866 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-11 18:45:22,866 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-11 18:45:22,867 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-11 18:45:22,868 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-11 18:45:22,870 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-11 18:45:22,872 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-11 18:45:22,873 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-11 18:45:22,874 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-11 18:45:22,875 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-11 18:45:22,875 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-11 18:45:22,876 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-11 18:45:22,878 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-11 18:45:22,879 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-11 18:45:22,880 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-11 18:45:22,881 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-11 18:45:22,882 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-11 18:45:22,884 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-11 18:45:22,886 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-11 18:45:22,887 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-11 18:45:22,888 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-11 18:45:22,889 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-11 18:45:22,892 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-11 18:45:22,892 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-11 18:45:22,892 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-11 18:45:22,893 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-11 18:45:22,894 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-11 18:45:22,898 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-11 18:45:22,898 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-11 18:45:22,899 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-11 18:45:22,900 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-11 18:45:22,900 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-11 18:45:22,901 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-11 18:45:22,902 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-11 18:45:22,904 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-11 18:45:22,904 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-11 18:45:22,904 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-11 18:45:22,905 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-11 18:45:22,906 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-11 18:45:22,907 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf [2020-10-11 18:45:22,956 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-11 18:45:22,957 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-11 18:45:22,961 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-11 18:45:22,961 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-11 18:45:22,961 INFO L138 SettingsManager]: * Use SBE=true [2020-10-11 18:45:22,962 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-11 18:45:22,962 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-11 18:45:22,962 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-11 18:45:22,962 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-11 18:45:22,962 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-11 18:45:22,963 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-11 18:45:22,963 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-11 18:45:22,963 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-11 18:45:22,964 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-11 18:45:22,964 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-11 18:45:22,965 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-11 18:45:22,965 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-11 18:45:22,965 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-11 18:45:22,965 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-11 18:45:22,965 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-11 18:45:22,965 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-11 18:45:22,966 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 18:45:22,967 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-11 18:45:22,967 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-11 18:45:22,967 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-11 18:45:22,967 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-11 18:45:22,967 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-11 18:45:22,968 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-10-11 18:45:22,968 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-11 18:45:22,968 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-11 18:45:23,299 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-11 18:45:23,312 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-11 18:45:23,316 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-11 18:45:23,317 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-11 18:45:23,318 INFO L275 PluginConnector]: CDTParser initialized [2020-10-11 18:45:23,319 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe032_rmo.opt.i [2020-10-11 18:45:23,382 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50cae7af5/6ac558b3ba6f4e828d86d719ee03a35f/FLAGaf215acd7 [2020-10-11 18:45:23,946 INFO L306 CDTParser]: Found 1 translation units. [2020-10-11 18:45:23,947 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe032_rmo.opt.i [2020-10-11 18:45:23,971 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50cae7af5/6ac558b3ba6f4e828d86d719ee03a35f/FLAGaf215acd7 [2020-10-11 18:45:24,192 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50cae7af5/6ac558b3ba6f4e828d86d719ee03a35f [2020-10-11 18:45:24,202 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-11 18:45:24,205 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-11 18:45:24,206 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-11 18:45:24,206 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-11 18:45:24,210 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-11 18:45:24,211 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:45:24" (1/1) ... [2020-10-11 18:45:24,214 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71b24b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:45:24, skipping insertion in model container [2020-10-11 18:45:24,215 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:45:24" (1/1) ... [2020-10-11 18:45:24,223 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-11 18:45:24,289 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-11 18:45:24,826 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:45:24,841 INFO L203 MainTranslator]: Completed pre-run [2020-10-11 18:45:24,942 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:45:25,054 INFO L208 MainTranslator]: Completed translation [2020-10-11 18:45:25,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:45:25 WrapperNode [2020-10-11 18:45:25,056 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-11 18:45:25,058 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-11 18:45:25,058 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-11 18:45:25,058 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-11 18:45:25,067 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:45:25" (1/1) ... [2020-10-11 18:45:25,104 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:45:25" (1/1) ... [2020-10-11 18:45:25,145 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-11 18:45:25,146 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-11 18:45:25,146 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-11 18:45:25,146 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-11 18:45:25,157 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:45:25" (1/1) ... [2020-10-11 18:45:25,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:45:25" (1/1) ... [2020-10-11 18:45:25,162 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:45:25" (1/1) ... [2020-10-11 18:45:25,163 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:45:25" (1/1) ... [2020-10-11 18:45:25,178 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:45:25" (1/1) ... [2020-10-11 18:45:25,185 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:45:25" (1/1) ... [2020-10-11 18:45:25,195 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:45:25" (1/1) ... [2020-10-11 18:45:25,208 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-11 18:45:25,208 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-11 18:45:25,209 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-11 18:45:25,209 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-11 18:45:25,210 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:45:25" (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 [2020-10-11 18:45:25,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-11 18:45:25,289 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-11 18:45:25,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-11 18:45:25,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-11 18:45:25,289 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-11 18:45:25,289 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-11 18:45:25,290 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-11 18:45:25,290 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-11 18:45:25,290 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-11 18:45:25,290 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-11 18:45:25,290 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-11 18:45:25,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-11 18:45:25,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-11 18:45:25,293 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-11 18:45:28,818 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-11 18:45:28,819 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-11 18:45:28,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:45:28 BoogieIcfgContainer [2020-10-11 18:45:28,822 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-11 18:45:28,824 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-11 18:45:28,824 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-11 18:45:28,828 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-11 18:45:28,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:45:24" (1/3) ... [2020-10-11 18:45:28,830 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c7b1484 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:45:28, skipping insertion in model container [2020-10-11 18:45:28,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:45:25" (2/3) ... [2020-10-11 18:45:28,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c7b1484 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:45:28, skipping insertion in model container [2020-10-11 18:45:28,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:45:28" (3/3) ... [2020-10-11 18:45:28,833 INFO L111 eAbstractionObserver]: Analyzing ICFG safe032_rmo.opt.i [2020-10-11 18:45:28,850 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-11 18:45:28,862 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-11 18:45:28,863 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-11 18:45:28,912 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,912 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,913 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,913 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,914 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,914 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,914 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,915 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,915 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,915 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,915 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,916 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,916 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,916 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,917 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,917 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,917 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,917 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,918 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,918 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,918 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,919 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,919 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,919 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,919 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,920 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,920 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,920 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,921 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,921 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,921 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,921 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,922 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,922 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,922 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,923 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,923 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,923 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,923 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,923 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,924 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,924 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,926 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,927 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,927 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,928 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,928 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,928 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,929 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,929 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,929 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,930 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,930 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,930 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,930 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,931 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,932 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,932 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,932 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,933 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,933 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,933 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,933 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,934 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,934 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,934 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,935 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,935 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,935 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,935 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,935 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,936 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,936 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,936 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,937 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,937 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,937 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,939 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,939 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,939 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,939 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,940 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,940 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,940 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,941 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,941 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,941 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,941 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,941 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,943 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,944 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,944 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,944 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,944 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,944 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,945 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,945 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,945 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,946 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,946 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,946 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:28,947 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,028 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,029 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,029 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,029 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,030 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,030 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,033 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,033 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,033 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,034 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,034 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,039 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,039 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,043 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,043 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,044 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,044 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,044 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,045 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,045 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,045 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,046 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,046 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,046 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,046 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,047 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,047 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,047 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,048 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,048 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,048 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,049 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,049 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,049 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,049 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,050 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,050 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,050 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,051 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,051 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,054 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,054 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,055 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,055 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,055 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,056 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,056 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,056 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,056 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,057 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,057 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,057 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,058 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,058 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,058 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,059 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,059 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,059 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,059 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,060 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,060 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,060 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,060 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,061 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,061 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,061 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,061 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,061 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,061 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,062 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,062 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,062 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,062 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,062 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,063 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,063 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,063 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,063 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,063 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,065 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,066 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,067 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:29,085 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-11 18:45:29,110 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 18:45:29,111 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-11 18:45:29,111 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 18:45:29,111 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 18:45:29,111 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 18:45:29,111 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 18:45:29,111 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 18:45:29,111 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 18:45:29,125 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 199 flow [2020-10-11 18:45:29,170 INFO L129 PetriNetUnfolder]: 2/89 cut-off events. [2020-10-11 18:45:29,171 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:45:29,176 INFO L80 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-11 18:45:29,177 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 92 transitions, 199 flow [2020-10-11 18:45:29,184 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 89 transitions, 187 flow [2020-10-11 18:45:29,200 INFO L129 PetriNetUnfolder]: 0/56 cut-off events. [2020-10-11 18:45:29,201 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:45:29,201 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:45:29,202 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:45:29,203 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:45:29,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:45:29,209 INFO L82 PathProgramCache]: Analyzing trace with hash 546711899, now seen corresponding path program 1 times [2020-10-11 18:45:29,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:45:29,220 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874387003] [2020-10-11 18:45:29,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:45:29,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:45:29,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:45:29,549 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874387003] [2020-10-11 18:45:29,550 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:45:29,550 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 18:45:29,551 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665157206] [2020-10-11 18:45:29,563 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 18:45:29,563 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:45:29,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 18:45:29,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 18:45:29,719 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 92 [2020-10-11 18:45:29,721 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 89 transitions, 187 flow. Second operand 3 states. [2020-10-11 18:45:29,722 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:45:29,722 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 92 [2020-10-11 18:45:29,723 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:45:29,754 INFO L129 PetriNetUnfolder]: 0/86 cut-off events. [2020-10-11 18:45:29,754 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:45:29,755 INFO L80 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 86 events. 0/86 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 63 event pairs, 0 based on Foata normal form. 4/88 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2020-10-11 18:45:29,756 INFO L132 encePairwiseOnDemand]: 87/92 looper letters, 0 selfloop transitions, 2 changer transitions 11/86 dead transitions. [2020-10-11 18:45:29,756 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 86 transitions, 185 flow [2020-10-11 18:45:29,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 18:45:29,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-11 18:45:29,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 268 transitions. [2020-10-11 18:45:29,773 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9710144927536232 [2020-10-11 18:45:29,773 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 268 transitions. [2020-10-11 18:45:29,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 268 transitions. [2020-10-11 18:45:29,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:45:29,779 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 268 transitions. [2020-10-11 18:45:29,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-11 18:45:29,788 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-11 18:45:29,788 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-11 18:45:29,791 INFO L185 Difference]: Start difference. First operand has 97 places, 89 transitions, 187 flow. Second operand 3 states and 268 transitions. [2020-10-11 18:45:29,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 86 transitions, 185 flow [2020-10-11 18:45:29,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 86 transitions, 182 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-11 18:45:29,801 INFO L241 Difference]: Finished difference. Result has 95 places, 75 transitions, 160 flow [2020-10-11 18:45:29,804 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=95, PETRI_TRANSITIONS=75} [2020-10-11 18:45:29,805 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, -2 predicate places. [2020-10-11 18:45:29,805 INFO L481 AbstractCegarLoop]: Abstraction has has 95 places, 75 transitions, 160 flow [2020-10-11 18:45:29,805 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 18:45:29,805 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:45:29,805 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:45:29,806 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-11 18:45:29,806 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:45:29,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:45:29,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1437305828, now seen corresponding path program 1 times [2020-10-11 18:45:29,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:45:29,807 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167824991] [2020-10-11 18:45:29,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:45:29,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:45:30,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:45:30,037 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167824991] [2020-10-11 18:45:30,037 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:45:30,037 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:45:30,038 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646640977] [2020-10-11 18:45:30,040 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:45:30,040 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:45:30,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:45:30,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:45:30,181 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 92 [2020-10-11 18:45:30,181 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 75 transitions, 160 flow. Second operand 6 states. [2020-10-11 18:45:30,182 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:45:30,182 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 92 [2020-10-11 18:45:30,182 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:45:30,336 INFO L129 PetriNetUnfolder]: 3/90 cut-off events. [2020-10-11 18:45:30,336 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:45:30,337 INFO L80 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 90 events. 3/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 116 event pairs, 0 based on Foata normal form. 2/92 useless extension candidates. Maximal degree in co-relation 84. Up to 7 conditions per place. [2020-10-11 18:45:30,338 INFO L132 encePairwiseOnDemand]: 86/92 looper letters, 6 selfloop transitions, 2 changer transitions 10/85 dead transitions. [2020-10-11 18:45:30,338 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 85 transitions, 216 flow [2020-10-11 18:45:30,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:45:30,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:45:30,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 758 transitions. [2020-10-11 18:45:30,344 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9154589371980676 [2020-10-11 18:45:30,344 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 758 transitions. [2020-10-11 18:45:30,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 758 transitions. [2020-10-11 18:45:30,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:45:30,345 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 758 transitions. [2020-10-11 18:45:30,347 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:45:30,350 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:45:30,350 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:45:30,351 INFO L185 Difference]: Start difference. First operand has 95 places, 75 transitions, 160 flow. Second operand 9 states and 758 transitions. [2020-10-11 18:45:30,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 85 transitions, 216 flow [2020-10-11 18:45:30,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 85 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-11 18:45:30,355 INFO L241 Difference]: Finished difference. Result has 97 places, 75 transitions, 176 flow [2020-10-11 18:45:30,355 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=176, PETRI_PLACES=97, PETRI_TRANSITIONS=75} [2020-10-11 18:45:30,356 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 0 predicate places. [2020-10-11 18:45:30,356 INFO L481 AbstractCegarLoop]: Abstraction has has 97 places, 75 transitions, 176 flow [2020-10-11 18:45:30,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:45:30,356 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:45:30,357 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:45:30,357 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-11 18:45:30,357 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:45:30,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:45:30,357 INFO L82 PathProgramCache]: Analyzing trace with hash 57102878, now seen corresponding path program 1 times [2020-10-11 18:45:30,358 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:45:30,358 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146468206] [2020-10-11 18:45:30,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:45:30,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:45:30,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:45:30,662 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146468206] [2020-10-11 18:45:30,662 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:45:30,662 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:45:30,663 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411094187] [2020-10-11 18:45:30,663 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:45:30,663 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:45:30,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:45:30,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:45:30,828 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 92 [2020-10-11 18:45:30,829 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 75 transitions, 176 flow. Second operand 6 states. [2020-10-11 18:45:30,829 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:45:30,829 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 92 [2020-10-11 18:45:30,829 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:45:30,990 INFO L129 PetriNetUnfolder]: 24/156 cut-off events. [2020-10-11 18:45:30,990 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2020-10-11 18:45:30,991 INFO L80 FinitePrefix]: Finished finitePrefix Result has 273 conditions, 156 events. 24/156 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 487 event pairs, 5 based on Foata normal form. 4/158 useless extension candidates. Maximal degree in co-relation 244. Up to 31 conditions per place. [2020-10-11 18:45:30,992 INFO L132 encePairwiseOnDemand]: 85/92 looper letters, 8 selfloop transitions, 3 changer transitions 19/96 dead transitions. [2020-10-11 18:45:30,993 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 96 transitions, 296 flow [2020-10-11 18:45:30,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:45:30,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:45:30,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 761 transitions. [2020-10-11 18:45:30,996 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9190821256038647 [2020-10-11 18:45:30,997 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 761 transitions. [2020-10-11 18:45:30,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 761 transitions. [2020-10-11 18:45:30,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:45:30,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 761 transitions. [2020-10-11 18:45:30,999 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:45:31,001 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:45:31,001 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:45:31,001 INFO L185 Difference]: Start difference. First operand has 97 places, 75 transitions, 176 flow. Second operand 9 states and 761 transitions. [2020-10-11 18:45:31,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 96 transitions, 296 flow [2020-10-11 18:45:31,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 96 transitions, 264 flow, removed 14 selfloop flow, removed 8 redundant places. [2020-10-11 18:45:31,007 INFO L241 Difference]: Finished difference. Result has 98 places, 77 transitions, 203 flow [2020-10-11 18:45:31,007 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=203, PETRI_PLACES=98, PETRI_TRANSITIONS=77} [2020-10-11 18:45:31,008 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 1 predicate places. [2020-10-11 18:45:31,008 INFO L481 AbstractCegarLoop]: Abstraction has has 98 places, 77 transitions, 203 flow [2020-10-11 18:45:31,008 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:45:31,008 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:45:31,008 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:45:31,009 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-11 18:45:31,009 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:45:31,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:45:31,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1679283449, now seen corresponding path program 1 times [2020-10-11 18:45:31,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:45:31,010 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760574068] [2020-10-11 18:45:31,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:45:31,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:45:31,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:45:31,571 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760574068] [2020-10-11 18:45:31,571 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:45:31,571 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-10-11 18:45:31,572 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045013587] [2020-10-11 18:45:31,572 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-11 18:45:31,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:45:31,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-11 18:45:31,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-10-11 18:45:33,383 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 92 [2020-10-11 18:45:33,384 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 77 transitions, 203 flow. Second operand 13 states. [2020-10-11 18:45:33,384 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:45:33,384 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 92 [2020-10-11 18:45:33,384 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:45:34,165 INFO L129 PetriNetUnfolder]: 266/720 cut-off events. [2020-10-11 18:45:34,165 INFO L130 PetriNetUnfolder]: For 637/863 co-relation queries the response was YES. [2020-10-11 18:45:34,173 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1679 conditions, 720 events. 266/720 cut-off events. For 637/863 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4152 event pairs, 22 based on Foata normal form. 32/738 useless extension candidates. Maximal degree in co-relation 1625. Up to 142 conditions per place. [2020-10-11 18:45:34,177 INFO L132 encePairwiseOnDemand]: 79/92 looper letters, 20 selfloop transitions, 11 changer transitions 38/127 dead transitions. [2020-10-11 18:45:34,177 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 127 transitions, 475 flow [2020-10-11 18:45:34,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-11 18:45:34,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-11 18:45:34,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1332 transitions. [2020-10-11 18:45:34,183 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8043478260869565 [2020-10-11 18:45:34,183 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1332 transitions. [2020-10-11 18:45:34,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1332 transitions. [2020-10-11 18:45:34,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:45:34,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1332 transitions. [2020-10-11 18:45:34,188 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 19 states. [2020-10-11 18:45:34,191 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 19 states. [2020-10-11 18:45:34,191 INFO L81 ComplementDD]: Finished complementDD. Result 19 states. [2020-10-11 18:45:34,191 INFO L185 Difference]: Start difference. First operand has 98 places, 77 transitions, 203 flow. Second operand 18 states and 1332 transitions. [2020-10-11 18:45:34,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 127 transitions, 475 flow [2020-10-11 18:45:34,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 127 transitions, 454 flow, removed 9 selfloop flow, removed 4 redundant places. [2020-10-11 18:45:34,205 INFO L241 Difference]: Finished difference. Result has 116 places, 81 transitions, 268 flow [2020-10-11 18:45:34,206 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=268, PETRI_PLACES=116, PETRI_TRANSITIONS=81} [2020-10-11 18:45:34,206 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 19 predicate places. [2020-10-11 18:45:34,206 INFO L481 AbstractCegarLoop]: Abstraction has has 116 places, 81 transitions, 268 flow [2020-10-11 18:45:34,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-11 18:45:34,207 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:45:34,207 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:45:34,207 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-11 18:45:34,207 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:45:34,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:45:34,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1343305363, now seen corresponding path program 1 times [2020-10-11 18:45:34,208 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:45:34,209 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099649343] [2020-10-11 18:45:34,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:45:34,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:45:34,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:45:34,469 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099649343] [2020-10-11 18:45:34,469 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:45:34,469 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:45:34,469 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892521743] [2020-10-11 18:45:34,470 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:45:34,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:45:34,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:45:34,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:45:34,640 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 92 [2020-10-11 18:45:34,641 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 81 transitions, 268 flow. Second operand 6 states. [2020-10-11 18:45:34,641 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:45:34,641 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 92 [2020-10-11 18:45:34,641 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:45:34,828 INFO L129 PetriNetUnfolder]: 36/276 cut-off events. [2020-10-11 18:45:34,828 INFO L130 PetriNetUnfolder]: For 707/881 co-relation queries the response was YES. [2020-10-11 18:45:34,830 INFO L80 FinitePrefix]: Finished finitePrefix Result has 760 conditions, 276 events. 36/276 cut-off events. For 707/881 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1314 event pairs, 11 based on Foata normal form. 6/276 useless extension candidates. Maximal degree in co-relation 698. Up to 52 conditions per place. [2020-10-11 18:45:34,832 INFO L132 encePairwiseOnDemand]: 86/92 looper letters, 12 selfloop transitions, 3 changer transitions 10/95 dead transitions. [2020-10-11 18:45:34,832 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 95 transitions, 434 flow [2020-10-11 18:45:34,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:45:34,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:45:34,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 755 transitions. [2020-10-11 18:45:34,836 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9118357487922706 [2020-10-11 18:45:34,836 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 755 transitions. [2020-10-11 18:45:34,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 755 transitions. [2020-10-11 18:45:34,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:45:34,837 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 755 transitions. [2020-10-11 18:45:34,839 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:45:34,841 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:45:34,841 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:45:34,841 INFO L185 Difference]: Start difference. First operand has 116 places, 81 transitions, 268 flow. Second operand 9 states and 755 transitions. [2020-10-11 18:45:34,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 95 transitions, 434 flow [2020-10-11 18:45:34,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 95 transitions, 379 flow, removed 24 selfloop flow, removed 10 redundant places. [2020-10-11 18:45:34,847 INFO L241 Difference]: Finished difference. Result has 112 places, 81 transitions, 270 flow [2020-10-11 18:45:34,847 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=270, PETRI_PLACES=112, PETRI_TRANSITIONS=81} [2020-10-11 18:45:34,848 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 15 predicate places. [2020-10-11 18:45:34,848 INFO L481 AbstractCegarLoop]: Abstraction has has 112 places, 81 transitions, 270 flow [2020-10-11 18:45:34,848 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:45:34,848 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:45:34,848 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:45:34,848 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-11 18:45:34,849 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:45:34,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:45:34,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1267040309, now seen corresponding path program 1 times [2020-10-11 18:45:34,849 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:45:34,850 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978426976] [2020-10-11 18:45:34,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:45:34,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:45:35,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:45:35,133 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978426976] [2020-10-11 18:45:35,134 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:45:35,134 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 18:45:35,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940063265] [2020-10-11 18:45:35,134 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 18:45:35,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:45:35,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 18:45:35,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-10-11 18:45:36,303 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 92 [2020-10-11 18:45:36,304 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 81 transitions, 270 flow. Second operand 10 states. [2020-10-11 18:45:36,305 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:45:36,305 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 92 [2020-10-11 18:45:36,305 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:45:36,957 INFO L129 PetriNetUnfolder]: 345/1063 cut-off events. [2020-10-11 18:45:36,958 INFO L130 PetriNetUnfolder]: For 2281/2342 co-relation queries the response was YES. [2020-10-11 18:45:36,965 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3024 conditions, 1063 events. 345/1063 cut-off events. For 2281/2342 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 7923 event pairs, 91 based on Foata normal form. 14/1045 useless extension candidates. Maximal degree in co-relation 2960. Up to 409 conditions per place. [2020-10-11 18:45:36,970 INFO L132 encePairwiseOnDemand]: 80/92 looper letters, 22 selfloop transitions, 11 changer transitions 31/122 dead transitions. [2020-10-11 18:45:36,970 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 122 transitions, 589 flow [2020-10-11 18:45:36,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 18:45:36,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-11 18:45:36,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 970 transitions. [2020-10-11 18:45:36,975 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8110367892976589 [2020-10-11 18:45:36,975 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 970 transitions. [2020-10-11 18:45:36,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 970 transitions. [2020-10-11 18:45:36,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:45:36,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 970 transitions. [2020-10-11 18:45:36,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-11 18:45:36,982 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-11 18:45:36,982 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-11 18:45:36,982 INFO L185 Difference]: Start difference. First operand has 112 places, 81 transitions, 270 flow. Second operand 13 states and 970 transitions. [2020-10-11 18:45:36,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 122 transitions, 589 flow [2020-10-11 18:45:36,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 122 transitions, 560 flow, removed 13 selfloop flow, removed 7 redundant places. [2020-10-11 18:45:36,993 INFO L241 Difference]: Finished difference. Result has 119 places, 87 transitions, 332 flow [2020-10-11 18:45:36,994 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=332, PETRI_PLACES=119, PETRI_TRANSITIONS=87} [2020-10-11 18:45:36,994 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 22 predicate places. [2020-10-11 18:45:36,994 INFO L481 AbstractCegarLoop]: Abstraction has has 119 places, 87 transitions, 332 flow [2020-10-11 18:45:36,994 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 18:45:36,994 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:45:36,995 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:45:36,995 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-11 18:45:36,995 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:45:36,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:45:36,996 INFO L82 PathProgramCache]: Analyzing trace with hash 553778155, now seen corresponding path program 2 times [2020-10-11 18:45:36,996 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:45:36,996 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325730311] [2020-10-11 18:45:36,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:45:37,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:45:37,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:45:37,358 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325730311] [2020-10-11 18:45:37,358 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:45:37,360 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-10-11 18:45:37,360 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118911046] [2020-10-11 18:45:37,361 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-11 18:45:37,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:45:37,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-11 18:45:37,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2020-10-11 18:45:40,661 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 92 [2020-10-11 18:45:40,662 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 87 transitions, 332 flow. Second operand 16 states. [2020-10-11 18:45:40,663 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:45:40,663 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 92 [2020-10-11 18:45:40,663 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:45:42,507 INFO L129 PetriNetUnfolder]: 523/1487 cut-off events. [2020-10-11 18:45:42,507 INFO L130 PetriNetUnfolder]: For 5614/6186 co-relation queries the response was YES. [2020-10-11 18:45:42,517 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5621 conditions, 1487 events. 523/1487 cut-off events. For 5614/6186 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 11267 event pairs, 59 based on Foata normal form. 54/1504 useless extension candidates. Maximal degree in co-relation 5549. Up to 447 conditions per place. [2020-10-11 18:45:42,528 INFO L132 encePairwiseOnDemand]: 76/92 looper letters, 44 selfloop transitions, 45 changer transitions 54/197 dead transitions. [2020-10-11 18:45:42,529 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 197 transitions, 1440 flow [2020-10-11 18:45:42,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 18:45:42,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-10-11 18:45:42,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 2040 transitions. [2020-10-11 18:45:42,540 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.7646176911544228 [2020-10-11 18:45:42,540 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 2040 transitions. [2020-10-11 18:45:42,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 2040 transitions. [2020-10-11 18:45:42,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:45:42,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 2040 transitions. [2020-10-11 18:45:42,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 30 states. [2020-10-11 18:45:42,556 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 30 states. [2020-10-11 18:45:42,557 INFO L81 ComplementDD]: Finished complementDD. Result 30 states. [2020-10-11 18:45:42,557 INFO L185 Difference]: Start difference. First operand has 119 places, 87 transitions, 332 flow. Second operand 29 states and 2040 transitions. [2020-10-11 18:45:42,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 197 transitions, 1440 flow [2020-10-11 18:45:42,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 197 transitions, 1346 flow, removed 39 selfloop flow, removed 7 redundant places. [2020-10-11 18:45:42,571 INFO L241 Difference]: Finished difference. Result has 151 places, 122 transitions, 777 flow [2020-10-11 18:45:42,572 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=777, PETRI_PLACES=151, PETRI_TRANSITIONS=122} [2020-10-11 18:45:42,572 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 54 predicate places. [2020-10-11 18:45:42,572 INFO L481 AbstractCegarLoop]: Abstraction has has 151 places, 122 transitions, 777 flow [2020-10-11 18:45:42,572 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-11 18:45:42,573 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:45:42,573 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:45:42,573 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-11 18:45:42,573 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:45:42,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:45:42,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1573482491, now seen corresponding path program 3 times [2020-10-11 18:45:42,574 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:45:42,575 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367319220] [2020-10-11 18:45:42,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:45:42,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:45:43,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:45:43,080 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367319220] [2020-10-11 18:45:43,081 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:45:43,081 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-10-11 18:45:43,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875453199] [2020-10-11 18:45:43,082 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-11 18:45:43,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:45:43,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-11 18:45:43,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2020-10-11 18:45:46,660 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 92 [2020-10-11 18:45:46,661 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 122 transitions, 777 flow. Second operand 17 states. [2020-10-11 18:45:46,662 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:45:46,662 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 92 [2020-10-11 18:45:46,662 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:45:47,671 INFO L129 PetriNetUnfolder]: 435/1355 cut-off events. [2020-10-11 18:45:47,671 INFO L130 PetriNetUnfolder]: For 7969/8881 co-relation queries the response was YES. [2020-10-11 18:45:47,682 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5856 conditions, 1355 events. 435/1355 cut-off events. For 7969/8881 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 10610 event pairs, 80 based on Foata normal form. 74/1383 useless extension candidates. Maximal degree in co-relation 5765. Up to 427 conditions per place. [2020-10-11 18:45:47,690 INFO L132 encePairwiseOnDemand]: 78/92 looper letters, 46 selfloop transitions, 33 changer transitions 41/174 dead transitions. [2020-10-11 18:45:47,690 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 174 transitions, 1513 flow [2020-10-11 18:45:47,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-11 18:45:47,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-10-11 18:45:47,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1324 transitions. [2020-10-11 18:45:47,698 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.7574370709382151 [2020-10-11 18:45:47,698 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1324 transitions. [2020-10-11 18:45:47,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1324 transitions. [2020-10-11 18:45:47,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:45:47,700 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1324 transitions. [2020-10-11 18:45:47,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 20 states. [2020-10-11 18:45:47,709 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 20 states. [2020-10-11 18:45:47,709 INFO L81 ComplementDD]: Finished complementDD. Result 20 states. [2020-10-11 18:45:47,709 INFO L185 Difference]: Start difference. First operand has 151 places, 122 transitions, 777 flow. Second operand 19 states and 1324 transitions. [2020-10-11 18:45:47,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 174 transitions, 1513 flow [2020-10-11 18:45:47,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 174 transitions, 1310 flow, removed 85 selfloop flow, removed 17 redundant places. [2020-10-11 18:45:47,737 INFO L241 Difference]: Finished difference. Result has 150 places, 122 transitions, 754 flow [2020-10-11 18:45:47,737 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=657, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=754, PETRI_PLACES=150, PETRI_TRANSITIONS=122} [2020-10-11 18:45:47,738 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 53 predicate places. [2020-10-11 18:45:47,738 INFO L481 AbstractCegarLoop]: Abstraction has has 150 places, 122 transitions, 754 flow [2020-10-11 18:45:47,738 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-11 18:45:47,738 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:45:47,738 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:45:47,739 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-11 18:45:47,739 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:45:47,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:45:47,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1215016937, now seen corresponding path program 4 times [2020-10-11 18:45:47,740 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:45:47,742 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196630080] [2020-10-11 18:45:47,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:45:47,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:45:48,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:45:48,025 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196630080] [2020-10-11 18:45:48,025 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:45:48,025 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-11 18:45:48,025 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523910915] [2020-10-11 18:45:48,026 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 18:45:48,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:45:48,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 18:45:48,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-10-11 18:45:49,943 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 92 [2020-10-11 18:45:49,944 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 122 transitions, 754 flow. Second operand 11 states. [2020-10-11 18:45:49,944 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:45:49,944 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 92 [2020-10-11 18:45:49,944 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:45:50,666 INFO L129 PetriNetUnfolder]: 396/1354 cut-off events. [2020-10-11 18:45:50,666 INFO L130 PetriNetUnfolder]: For 8404/9075 co-relation queries the response was YES. [2020-10-11 18:45:50,677 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5724 conditions, 1354 events. 396/1354 cut-off events. For 8404/9075 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 11161 event pairs, 50 based on Foata normal form. 40/1356 useless extension candidates. Maximal degree in co-relation 5640. Up to 448 conditions per place. [2020-10-11 18:45:50,683 INFO L132 encePairwiseOnDemand]: 81/92 looper letters, 52 selfloop transitions, 15 changer transitions 29/154 dead transitions. [2020-10-11 18:45:50,684 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 154 transitions, 1284 flow [2020-10-11 18:45:50,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-11 18:45:50,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-11 18:45:50,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 833 transitions. [2020-10-11 18:45:50,687 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8231225296442688 [2020-10-11 18:45:50,687 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 833 transitions. [2020-10-11 18:45:50,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 833 transitions. [2020-10-11 18:45:50,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:45:50,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 833 transitions. [2020-10-11 18:45:50,689 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-11 18:45:50,691 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-11 18:45:50,691 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-11 18:45:50,691 INFO L185 Difference]: Start difference. First operand has 150 places, 122 transitions, 754 flow. Second operand 11 states and 833 transitions. [2020-10-11 18:45:50,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 154 transitions, 1284 flow [2020-10-11 18:45:50,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 154 transitions, 1118 flow, removed 49 selfloop flow, removed 18 redundant places. [2020-10-11 18:45:50,716 INFO L241 Difference]: Finished difference. Result has 139 places, 120 transitions, 688 flow [2020-10-11 18:45:50,716 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=688, PETRI_PLACES=139, PETRI_TRANSITIONS=120} [2020-10-11 18:45:50,717 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 42 predicate places. [2020-10-11 18:45:50,717 INFO L481 AbstractCegarLoop]: Abstraction has has 139 places, 120 transitions, 688 flow [2020-10-11 18:45:50,717 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 18:45:50,717 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:45:50,717 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:45:50,717 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-11 18:45:50,717 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:45:50,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:45:50,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1292397961, now seen corresponding path program 5 times [2020-10-11 18:45:50,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:45:50,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732241491] [2020-10-11 18:45:50,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:45:50,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:45:50,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:45:50,937 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732241491] [2020-10-11 18:45:50,937 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:45:50,937 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 18:45:50,937 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734821414] [2020-10-11 18:45:50,938 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 18:45:50,938 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:45:50,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 18:45:50,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-11 18:45:52,078 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 92 [2020-10-11 18:45:52,079 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 120 transitions, 688 flow. Second operand 9 states. [2020-10-11 18:45:52,079 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:45:52,079 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 92 [2020-10-11 18:45:52,079 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:45:52,611 INFO L129 PetriNetUnfolder]: 306/1146 cut-off events. [2020-10-11 18:45:52,611 INFO L130 PetriNetUnfolder]: For 5355/5532 co-relation queries the response was YES. [2020-10-11 18:45:52,619 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4367 conditions, 1146 events. 306/1146 cut-off events. For 5355/5532 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 9059 event pairs, 61 based on Foata normal form. 22/1125 useless extension candidates. Maximal degree in co-relation 4292. Up to 391 conditions per place. [2020-10-11 18:45:52,625 INFO L132 encePairwiseOnDemand]: 79/92 looper letters, 43 selfloop transitions, 20 changer transitions 20/150 dead transitions. [2020-10-11 18:45:52,625 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 150 transitions, 1094 flow [2020-10-11 18:45:52,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 18:45:52,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-11 18:45:52,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 927 transitions. [2020-10-11 18:45:52,628 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8396739130434783 [2020-10-11 18:45:52,628 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 927 transitions. [2020-10-11 18:45:52,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 927 transitions. [2020-10-11 18:45:52,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:45:52,628 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 927 transitions. [2020-10-11 18:45:52,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-11 18:45:52,631 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-11 18:45:52,632 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-11 18:45:52,632 INFO L185 Difference]: Start difference. First operand has 139 places, 120 transitions, 688 flow. Second operand 12 states and 927 transitions. [2020-10-11 18:45:52,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 150 transitions, 1094 flow [2020-10-11 18:45:52,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 150 transitions, 1044 flow, removed 16 selfloop flow, removed 8 redundant places. [2020-10-11 18:45:52,647 INFO L241 Difference]: Finished difference. Result has 144 places, 124 transitions, 772 flow [2020-10-11 18:45:52,648 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=655, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=772, PETRI_PLACES=144, PETRI_TRANSITIONS=124} [2020-10-11 18:45:52,648 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 47 predicate places. [2020-10-11 18:45:52,648 INFO L481 AbstractCegarLoop]: Abstraction has has 144 places, 124 transitions, 772 flow [2020-10-11 18:45:52,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 18:45:52,649 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:45:52,649 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:45:52,649 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-11 18:45:52,649 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:45:52,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:45:52,649 INFO L82 PathProgramCache]: Analyzing trace with hash 639125367, now seen corresponding path program 6 times [2020-10-11 18:45:52,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:45:52,650 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327258150] [2020-10-11 18:45:52,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:45:52,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:45:53,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:45:53,001 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327258150] [2020-10-11 18:45:53,002 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:45:53,002 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 18:45:53,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704955051] [2020-10-11 18:45:53,002 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 18:45:53,003 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:45:53,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 18:45:53,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-10-11 18:45:55,144 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 92 [2020-10-11 18:45:55,145 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 124 transitions, 772 flow. Second operand 12 states. [2020-10-11 18:45:55,146 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:45:55,146 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 92 [2020-10-11 18:45:55,146 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:45:56,224 INFO L129 PetriNetUnfolder]: 293/1154 cut-off events. [2020-10-11 18:45:56,225 INFO L130 PetriNetUnfolder]: For 7059/7240 co-relation queries the response was YES. [2020-10-11 18:45:56,232 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5043 conditions, 1154 events. 293/1154 cut-off events. For 7059/7240 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9341 event pairs, 58 based on Foata normal form. 23/1136 useless extension candidates. Maximal degree in co-relation 4963. Up to 377 conditions per place. [2020-10-11 18:45:56,240 INFO L132 encePairwiseOnDemand]: 79/92 looper letters, 45 selfloop transitions, 30 changer transitions 20/160 dead transitions. [2020-10-11 18:45:56,240 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 160 transitions, 1408 flow [2020-10-11 18:45:56,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 18:45:56,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-11 18:45:56,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1052 transitions. [2020-10-11 18:45:56,248 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8167701863354038 [2020-10-11 18:45:56,249 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1052 transitions. [2020-10-11 18:45:56,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1052 transitions. [2020-10-11 18:45:56,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:45:56,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1052 transitions. [2020-10-11 18:45:56,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-11 18:45:56,253 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-11 18:45:56,253 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-11 18:45:56,253 INFO L185 Difference]: Start difference. First operand has 144 places, 124 transitions, 772 flow. Second operand 14 states and 1052 transitions. [2020-10-11 18:45:56,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 160 transitions, 1408 flow [2020-10-11 18:45:56,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 160 transitions, 1369 flow, removed 14 selfloop flow, removed 6 redundant places. [2020-10-11 18:45:56,280 INFO L241 Difference]: Finished difference. Result has 154 places, 134 transitions, 1006 flow [2020-10-11 18:45:56,280 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=751, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1006, PETRI_PLACES=154, PETRI_TRANSITIONS=134} [2020-10-11 18:45:56,280 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 57 predicate places. [2020-10-11 18:45:56,280 INFO L481 AbstractCegarLoop]: Abstraction has has 154 places, 134 transitions, 1006 flow [2020-10-11 18:45:56,280 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 18:45:56,281 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:45:56,281 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:45:56,281 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-11 18:45:56,281 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:45:56,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:45:56,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1992793801, now seen corresponding path program 7 times [2020-10-11 18:45:56,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:45:56,282 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129820869] [2020-10-11 18:45:56,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:45:56,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:45:56,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:45:56,577 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129820869] [2020-10-11 18:45:56,577 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:45:56,577 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 18:45:56,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920183439] [2020-10-11 18:45:56,579 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 18:45:56,579 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:45:56,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 18:45:56,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-10-11 18:45:58,348 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 92 [2020-10-11 18:45:58,349 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 134 transitions, 1006 flow. Second operand 12 states. [2020-10-11 18:45:58,349 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:45:58,350 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 92 [2020-10-11 18:45:58,350 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:45:58,907 INFO L129 PetriNetUnfolder]: 278/1095 cut-off events. [2020-10-11 18:45:58,907 INFO L130 PetriNetUnfolder]: For 11289/12012 co-relation queries the response was YES. [2020-10-11 18:45:58,913 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5789 conditions, 1095 events. 278/1095 cut-off events. For 11289/12012 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 9009 event pairs, 34 based on Foata normal form. 67/1131 useless extension candidates. Maximal degree in co-relation 5704. Up to 471 conditions per place. [2020-10-11 18:45:58,918 INFO L132 encePairwiseOnDemand]: 80/92 looper letters, 61 selfloop transitions, 17 changer transitions 19/155 dead transitions. [2020-10-11 18:45:58,919 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 155 transitions, 1554 flow [2020-10-11 18:45:58,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 18:45:58,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-11 18:45:58,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 885 transitions. [2020-10-11 18:45:58,921 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8016304347826086 [2020-10-11 18:45:58,921 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 885 transitions. [2020-10-11 18:45:58,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 885 transitions. [2020-10-11 18:45:58,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:45:58,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 885 transitions. [2020-10-11 18:45:58,923 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-11 18:45:58,925 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-11 18:45:58,925 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-11 18:45:58,925 INFO L185 Difference]: Start difference. First operand has 154 places, 134 transitions, 1006 flow. Second operand 12 states and 885 transitions. [2020-10-11 18:45:58,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 155 transitions, 1554 flow [2020-10-11 18:45:58,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 155 transitions, 1418 flow, removed 52 selfloop flow, removed 10 redundant places. [2020-10-11 18:45:58,953 INFO L241 Difference]: Finished difference. Result has 153 places, 131 transitions, 939 flow [2020-10-11 18:45:58,954 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=932, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=939, PETRI_PLACES=153, PETRI_TRANSITIONS=131} [2020-10-11 18:45:58,954 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 56 predicate places. [2020-10-11 18:45:58,954 INFO L481 AbstractCegarLoop]: Abstraction has has 153 places, 131 transitions, 939 flow [2020-10-11 18:45:58,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 18:45:58,954 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:45:58,954 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:45:58,954 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-11 18:45:58,955 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:45:58,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:45:58,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1997032063, now seen corresponding path program 1 times [2020-10-11 18:45:58,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:45:58,955 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286591538] [2020-10-11 18:45:58,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:45:59,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:45:59,483 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 22 [2020-10-11 18:45:59,799 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 29 [2020-10-11 18:45:59,952 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 28 [2020-10-11 18:46:00,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:46:00,137 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286591538] [2020-10-11 18:46:00,137 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:46:00,137 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-10-11 18:46:00,137 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826548584] [2020-10-11 18:46:00,138 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-11 18:46:00,138 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:46:00,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-11 18:46:00,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2020-10-11 18:46:07,045 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 92 [2020-10-11 18:46:07,046 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 131 transitions, 939 flow. Second operand 17 states. [2020-10-11 18:46:07,047 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:46:07,047 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 92 [2020-10-11 18:46:07,047 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:46:08,429 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 35 [2020-10-11 18:46:08,868 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2020-10-11 18:46:09,126 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2020-10-11 18:46:09,351 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2020-10-11 18:46:09,384 INFO L129 PetriNetUnfolder]: 255/1320 cut-off events. [2020-10-11 18:46:09,384 INFO L130 PetriNetUnfolder]: For 8263/8507 co-relation queries the response was YES. [2020-10-11 18:46:09,390 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5740 conditions, 1320 events. 255/1320 cut-off events. For 8263/8507 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 12314 event pairs, 77 based on Foata normal form. 33/1313 useless extension candidates. Maximal degree in co-relation 5653. Up to 225 conditions per place. [2020-10-11 18:46:09,395 INFO L132 encePairwiseOnDemand]: 78/92 looper letters, 54 selfloop transitions, 26 changer transitions 47/190 dead transitions. [2020-10-11 18:46:09,395 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 190 transitions, 1867 flow [2020-10-11 18:46:09,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-10-11 18:46:09,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-10-11 18:46:09,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1849 transitions. [2020-10-11 18:46:09,398 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.7729933110367893 [2020-10-11 18:46:09,398 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 1849 transitions. [2020-10-11 18:46:09,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 1849 transitions. [2020-10-11 18:46:09,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:46:09,399 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 1849 transitions. [2020-10-11 18:46:09,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 27 states. [2020-10-11 18:46:09,403 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 27 states. [2020-10-11 18:46:09,403 INFO L81 ComplementDD]: Finished complementDD. Result 27 states. [2020-10-11 18:46:09,403 INFO L185 Difference]: Start difference. First operand has 153 places, 131 transitions, 939 flow. Second operand 26 states and 1849 transitions. [2020-10-11 18:46:09,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 190 transitions, 1867 flow [2020-10-11 18:46:09,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 190 transitions, 1714 flow, removed 34 selfloop flow, removed 12 redundant places. [2020-10-11 18:46:09,425 INFO L241 Difference]: Finished difference. Result has 178 places, 126 transitions, 903 flow [2020-10-11 18:46:09,426 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=852, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=903, PETRI_PLACES=178, PETRI_TRANSITIONS=126} [2020-10-11 18:46:09,426 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 81 predicate places. [2020-10-11 18:46:09,426 INFO L481 AbstractCegarLoop]: Abstraction has has 178 places, 126 transitions, 903 flow [2020-10-11 18:46:09,426 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-11 18:46:09,426 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:46:09,426 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:46:09,426 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-11 18:46:09,427 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:46:09,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:46:09,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1865975136, now seen corresponding path program 1 times [2020-10-11 18:46:09,427 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:46:09,427 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964342155] [2020-10-11 18:46:09,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:46:09,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:46:09,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:46:09,592 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964342155] [2020-10-11 18:46:09,592 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:46:09,592 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:46:09,592 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839628594] [2020-10-11 18:46:09,593 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:46:09,593 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:46:09,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:46:09,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:46:09,776 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 92 [2020-10-11 18:46:09,777 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 126 transitions, 903 flow. Second operand 6 states. [2020-10-11 18:46:09,777 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:46:09,777 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 92 [2020-10-11 18:46:09,777 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:46:10,650 INFO L129 PetriNetUnfolder]: 1476/3902 cut-off events. [2020-10-11 18:46:10,650 INFO L130 PetriNetUnfolder]: For 12249/12486 co-relation queries the response was YES. [2020-10-11 18:46:10,672 INFO L80 FinitePrefix]: Finished finitePrefix Result has 10224 conditions, 3902 events. 1476/3902 cut-off events. For 12249/12486 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 39530 event pairs, 294 based on Foata normal form. 108/3695 useless extension candidates. Maximal degree in co-relation 10130. Up to 1183 conditions per place. [2020-10-11 18:46:10,683 INFO L132 encePairwiseOnDemand]: 83/92 looper letters, 19 selfloop transitions, 16 changer transitions 0/139 dead transitions. [2020-10-11 18:46:10,683 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 139 transitions, 902 flow [2020-10-11 18:46:10,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:46:10,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:46:10,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 748 transitions. [2020-10-11 18:46:10,685 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9033816425120773 [2020-10-11 18:46:10,685 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 748 transitions. [2020-10-11 18:46:10,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 748 transitions. [2020-10-11 18:46:10,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:46:10,686 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 748 transitions. [2020-10-11 18:46:10,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:46:10,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:46:10,689 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:46:10,689 INFO L185 Difference]: Start difference. First operand has 178 places, 126 transitions, 903 flow. Second operand 9 states and 748 transitions. [2020-10-11 18:46:10,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 139 transitions, 902 flow [2020-10-11 18:46:10,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 139 transitions, 766 flow, removed 44 selfloop flow, removed 31 redundant places. [2020-10-11 18:46:10,717 INFO L241 Difference]: Finished difference. Result has 143 places, 128 transitions, 757 flow [2020-10-11 18:46:10,718 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=757, PETRI_PLACES=143, PETRI_TRANSITIONS=128} [2020-10-11 18:46:10,718 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 46 predicate places. [2020-10-11 18:46:10,718 INFO L481 AbstractCegarLoop]: Abstraction has has 143 places, 128 transitions, 757 flow [2020-10-11 18:46:10,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:46:10,718 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:46:10,719 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:46:10,719 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-11 18:46:10,719 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:46:10,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:46:10,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1647488101, now seen corresponding path program 1 times [2020-10-11 18:46:10,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:46:10,720 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282192809] [2020-10-11 18:46:10,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:46:10,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:46:10,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:46:10,866 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282192809] [2020-10-11 18:46:10,866 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:46:10,866 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:46:10,866 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777793260] [2020-10-11 18:46:10,867 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:46:10,867 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:46:10,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:46:10,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:46:10,999 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 92 [2020-10-11 18:46:10,999 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 128 transitions, 757 flow. Second operand 7 states. [2020-10-11 18:46:11,000 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:46:11,000 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 92 [2020-10-11 18:46:11,000 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:46:11,654 INFO L129 PetriNetUnfolder]: 1316/3986 cut-off events. [2020-10-11 18:46:11,654 INFO L130 PetriNetUnfolder]: For 8837/10938 co-relation queries the response was YES. [2020-10-11 18:46:11,674 INFO L80 FinitePrefix]: Finished finitePrefix Result has 12861 conditions, 3986 events. 1316/3986 cut-off events. For 8837/10938 co-relation queries the response was YES. Maximal size of possible extension queue 574. Compared 43532 event pairs, 16 based on Foata normal form. 606/4331 useless extension candidates. Maximal degree in co-relation 12787. Up to 1404 conditions per place. [2020-10-11 18:46:11,683 INFO L132 encePairwiseOnDemand]: 83/92 looper letters, 15 selfloop transitions, 31 changer transitions 6/151 dead transitions. [2020-10-11 18:46:11,683 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 151 transitions, 994 flow [2020-10-11 18:46:11,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 18:46:11,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-11 18:46:11,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 998 transitions. [2020-10-11 18:46:11,685 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9039855072463768 [2020-10-11 18:46:11,686 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 998 transitions. [2020-10-11 18:46:11,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 998 transitions. [2020-10-11 18:46:11,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:46:11,686 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 998 transitions. [2020-10-11 18:46:11,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-11 18:46:11,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-11 18:46:11,689 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-11 18:46:11,690 INFO L185 Difference]: Start difference. First operand has 143 places, 128 transitions, 757 flow. Second operand 12 states and 998 transitions. [2020-10-11 18:46:11,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 151 transitions, 994 flow [2020-10-11 18:46:11,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 151 transitions, 956 flow, removed 10 selfloop flow, removed 5 redundant places. [2020-10-11 18:46:11,710 INFO L241 Difference]: Finished difference. Result has 151 places, 142 transitions, 901 flow [2020-10-11 18:46:11,711 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=671, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=901, PETRI_PLACES=151, PETRI_TRANSITIONS=142} [2020-10-11 18:46:11,711 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 54 predicate places. [2020-10-11 18:46:11,711 INFO L481 AbstractCegarLoop]: Abstraction has has 151 places, 142 transitions, 901 flow [2020-10-11 18:46:11,711 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:46:11,711 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:46:11,711 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:46:11,712 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-11 18:46:11,712 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:46:11,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:46:11,712 INFO L82 PathProgramCache]: Analyzing trace with hash 732354862, now seen corresponding path program 1 times [2020-10-11 18:46:11,712 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:46:11,713 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610320235] [2020-10-11 18:46:11,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:46:11,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:46:11,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:46:11,867 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610320235] [2020-10-11 18:46:11,867 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:46:11,867 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-11 18:46:11,868 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362336256] [2020-10-11 18:46:11,868 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 18:46:11,868 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:46:11,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 18:46:11,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-11 18:46:12,063 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 92 [2020-10-11 18:46:12,064 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 142 transitions, 901 flow. Second operand 8 states. [2020-10-11 18:46:12,064 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:46:12,064 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 92 [2020-10-11 18:46:12,064 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:46:12,869 INFO L129 PetriNetUnfolder]: 1016/3564 cut-off events. [2020-10-11 18:46:12,870 INFO L130 PetriNetUnfolder]: For 11639/15379 co-relation queries the response was YES. [2020-10-11 18:46:12,894 INFO L80 FinitePrefix]: Finished finitePrefix Result has 12972 conditions, 3564 events. 1016/3564 cut-off events. For 11639/15379 co-relation queries the response was YES. Maximal size of possible extension queue 576. Compared 41603 event pairs, 0 based on Foata normal form. 640/3946 useless extension candidates. Maximal degree in co-relation 12896. Up to 1134 conditions per place. [2020-10-11 18:46:12,900 INFO L132 encePairwiseOnDemand]: 83/92 looper letters, 10 selfloop transitions, 32 changer transitions 22/158 dead transitions. [2020-10-11 18:46:12,900 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 158 transitions, 1124 flow [2020-10-11 18:46:12,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 18:46:12,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-11 18:46:12,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1236 transitions. [2020-10-11 18:46:12,903 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8956521739130435 [2020-10-11 18:46:12,903 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1236 transitions. [2020-10-11 18:46:12,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1236 transitions. [2020-10-11 18:46:12,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:46:12,904 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1236 transitions. [2020-10-11 18:46:12,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-11 18:46:12,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-11 18:46:12,909 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-11 18:46:12,910 INFO L185 Difference]: Start difference. First operand has 151 places, 142 transitions, 901 flow. Second operand 15 states and 1236 transitions. [2020-10-11 18:46:12,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 158 transitions, 1124 flow [2020-10-11 18:46:13,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 158 transitions, 908 flow, removed 85 selfloop flow, removed 15 redundant places. [2020-10-11 18:46:13,021 INFO L241 Difference]: Finished difference. Result has 156 places, 133 transitions, 746 flow [2020-10-11 18:46:13,021 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=746, PETRI_PLACES=156, PETRI_TRANSITIONS=133} [2020-10-11 18:46:13,021 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 59 predicate places. [2020-10-11 18:46:13,022 INFO L481 AbstractCegarLoop]: Abstraction has has 156 places, 133 transitions, 746 flow [2020-10-11 18:46:13,022 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 18:46:13,022 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:46:13,022 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:46:13,022 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-11 18:46:13,022 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:46:13,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:46:13,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1844917643, now seen corresponding path program 1 times [2020-10-11 18:46:13,023 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:46:13,023 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360163943] [2020-10-11 18:46:13,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:46:13,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:46:13,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:46:13,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360163943] [2020-10-11 18:46:13,257 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:46:13,257 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 18:46:13,257 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810085789] [2020-10-11 18:46:13,258 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 18:46:13,258 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:46:13,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 18:46:13,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-10-11 18:46:14,052 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 92 [2020-10-11 18:46:14,053 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 133 transitions, 746 flow. Second operand 9 states. [2020-10-11 18:46:14,053 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:46:14,054 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 92 [2020-10-11 18:46:14,054 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:46:14,579 INFO L129 PetriNetUnfolder]: 650/3069 cut-off events. [2020-10-11 18:46:14,579 INFO L130 PetriNetUnfolder]: For 6029/6286 co-relation queries the response was YES. [2020-10-11 18:46:14,596 INFO L80 FinitePrefix]: Finished finitePrefix Result has 8756 conditions, 3069 events. 650/3069 cut-off events. For 6029/6286 co-relation queries the response was YES. Maximal size of possible extension queue 505. Compared 37749 event pairs, 2 based on Foata normal form. 13/2934 useless extension candidates. Maximal degree in co-relation 8689. Up to 438 conditions per place. [2020-10-11 18:46:14,601 INFO L132 encePairwiseOnDemand]: 80/92 looper letters, 37 selfloop transitions, 16 changer transitions 14/153 dead transitions. [2020-10-11 18:46:14,601 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 153 transitions, 1004 flow [2020-10-11 18:46:14,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-11 18:46:14,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-11 18:46:14,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 742 transitions. [2020-10-11 18:46:14,603 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8065217391304348 [2020-10-11 18:46:14,603 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 742 transitions. [2020-10-11 18:46:14,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 742 transitions. [2020-10-11 18:46:14,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:46:14,604 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 742 transitions. [2020-10-11 18:46:14,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-11 18:46:14,606 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-11 18:46:14,606 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-11 18:46:14,607 INFO L185 Difference]: Start difference. First operand has 156 places, 133 transitions, 746 flow. Second operand 10 states and 742 transitions. [2020-10-11 18:46:14,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 153 transitions, 1004 flow [2020-10-11 18:46:14,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 153 transitions, 928 flow, removed 10 selfloop flow, removed 13 redundant places. [2020-10-11 18:46:14,708 INFO L241 Difference]: Finished difference. Result has 156 places, 136 transitions, 787 flow [2020-10-11 18:46:14,708 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=676, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=787, PETRI_PLACES=156, PETRI_TRANSITIONS=136} [2020-10-11 18:46:14,709 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 59 predicate places. [2020-10-11 18:46:14,709 INFO L481 AbstractCegarLoop]: Abstraction has has 156 places, 136 transitions, 787 flow [2020-10-11 18:46:14,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 18:46:14,709 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:46:14,709 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:46:14,709 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-11 18:46:14,709 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:46:14,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:46:14,709 INFO L82 PathProgramCache]: Analyzing trace with hash -476638977, now seen corresponding path program 2 times [2020-10-11 18:46:14,710 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:46:14,710 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345601019] [2020-10-11 18:46:14,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:46:14,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:46:15,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:46:15,083 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345601019] [2020-10-11 18:46:15,083 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:46:15,083 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 18:46:15,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352941562] [2020-10-11 18:46:15,084 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 18:46:15,084 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:46:15,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 18:46:15,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-10-11 18:46:16,432 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 92 [2020-10-11 18:46:16,433 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 136 transitions, 787 flow. Second operand 10 states. [2020-10-11 18:46:16,433 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:46:16,434 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 92 [2020-10-11 18:46:16,434 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:46:17,102 INFO L129 PetriNetUnfolder]: 573/2604 cut-off events. [2020-10-11 18:46:17,102 INFO L130 PetriNetUnfolder]: For 3871/3986 co-relation queries the response was YES. [2020-10-11 18:46:17,112 INFO L80 FinitePrefix]: Finished finitePrefix Result has 7302 conditions, 2604 events. 573/2604 cut-off events. For 3871/3986 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 30750 event pairs, 2 based on Foata normal form. 25/2491 useless extension candidates. Maximal degree in co-relation 7264. Up to 384 conditions per place. [2020-10-11 18:46:17,115 INFO L132 encePairwiseOnDemand]: 81/92 looper letters, 35 selfloop transitions, 15 changer transitions 14/147 dead transitions. [2020-10-11 18:46:17,115 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 147 transitions, 995 flow [2020-10-11 18:46:17,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-11 18:46:17,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-11 18:46:17,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 790 transitions. [2020-10-11 18:46:17,118 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.7806324110671937 [2020-10-11 18:46:17,118 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 790 transitions. [2020-10-11 18:46:17,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 790 transitions. [2020-10-11 18:46:17,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:46:17,118 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 790 transitions. [2020-10-11 18:46:17,119 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-11 18:46:17,121 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-11 18:46:17,121 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-11 18:46:17,121 INFO L185 Difference]: Start difference. First operand has 156 places, 136 transitions, 787 flow. Second operand 11 states and 790 transitions. [2020-10-11 18:46:17,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 147 transitions, 995 flow [2020-10-11 18:46:17,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 147 transitions, 957 flow, removed 14 selfloop flow, removed 5 redundant places. [2020-10-11 18:46:17,175 INFO L241 Difference]: Finished difference. Result has 164 places, 132 transitions, 787 flow [2020-10-11 18:46:17,176 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=757, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=787, PETRI_PLACES=164, PETRI_TRANSITIONS=132} [2020-10-11 18:46:17,176 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 67 predicate places. [2020-10-11 18:46:17,176 INFO L481 AbstractCegarLoop]: Abstraction has has 164 places, 132 transitions, 787 flow [2020-10-11 18:46:17,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 18:46:17,176 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:46:17,176 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:46:17,176 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-11 18:46:17,176 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:46:17,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:46:17,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1890441653, now seen corresponding path program 3 times [2020-10-11 18:46:17,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:46:17,177 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273939422] [2020-10-11 18:46:17,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:46:17,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:46:17,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:46:17,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273939422] [2020-10-11 18:46:17,620 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:46:17,621 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-10-11 18:46:17,621 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097782578] [2020-10-11 18:46:17,622 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-11 18:46:17,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:46:17,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-11 18:46:17,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2020-10-11 18:46:19,782 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 92 [2020-10-11 18:46:19,783 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 132 transitions, 787 flow. Second operand 16 states. [2020-10-11 18:46:19,783 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:46:19,783 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 92 [2020-10-11 18:46:19,783 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:46:20,353 INFO L129 PetriNetUnfolder]: 280/1310 cut-off events. [2020-10-11 18:46:20,353 INFO L130 PetriNetUnfolder]: For 2078/2129 co-relation queries the response was YES. [2020-10-11 18:46:20,359 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3717 conditions, 1310 events. 280/1310 cut-off events. For 2078/2129 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 13024 event pairs, 2 based on Foata normal form. 12/1253 useless extension candidates. Maximal degree in co-relation 3675. Up to 192 conditions per place. [2020-10-11 18:46:20,362 INFO L132 encePairwiseOnDemand]: 77/92 looper letters, 36 selfloop transitions, 13 changer transitions 13/143 dead transitions. [2020-10-11 18:46:20,362 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 143 transitions, 990 flow [2020-10-11 18:46:20,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 18:46:20,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-11 18:46:20,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1032 transitions. [2020-10-11 18:46:20,366 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.7478260869565218 [2020-10-11 18:46:20,366 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1032 transitions. [2020-10-11 18:46:20,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1032 transitions. [2020-10-11 18:46:20,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:46:20,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1032 transitions. [2020-10-11 18:46:20,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-11 18:46:20,370 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-11 18:46:20,370 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-11 18:46:20,370 INFO L185 Difference]: Start difference. First operand has 164 places, 132 transitions, 787 flow. Second operand 15 states and 1032 transitions. [2020-10-11 18:46:20,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 143 transitions, 990 flow [2020-10-11 18:46:20,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 143 transitions, 891 flow, removed 24 selfloop flow, removed 16 redundant places. [2020-10-11 18:46:20,397 INFO L241 Difference]: Finished difference. Result has 164 places, 129 transitions, 728 flow [2020-10-11 18:46:20,397 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=709, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=728, PETRI_PLACES=164, PETRI_TRANSITIONS=129} [2020-10-11 18:46:20,397 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 67 predicate places. [2020-10-11 18:46:20,397 INFO L481 AbstractCegarLoop]: Abstraction has has 164 places, 129 transitions, 728 flow [2020-10-11 18:46:20,397 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-11 18:46:20,397 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:46:20,398 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:46:20,398 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-11 18:46:20,398 INFO L429 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:46:20,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:46:20,398 INFO L82 PathProgramCache]: Analyzing trace with hash 120437, now seen corresponding path program 4 times [2020-10-11 18:46:20,399 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:46:20,399 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459205511] [2020-10-11 18:46:20,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:46:20,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:46:20,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:46:20,703 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459205511] [2020-10-11 18:46:20,703 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:46:20,703 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-11 18:46:20,704 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674810827] [2020-10-11 18:46:20,704 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 18:46:20,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:46:20,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 18:46:20,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-10-11 18:46:21,564 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 92 [2020-10-11 18:46:21,565 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 129 transitions, 728 flow. Second operand 11 states. [2020-10-11 18:46:21,565 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:46:21,565 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 92 [2020-10-11 18:46:21,565 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:46:22,092 INFO L129 PetriNetUnfolder]: 353/1622 cut-off events. [2020-10-11 18:46:22,093 INFO L130 PetriNetUnfolder]: For 2378/2431 co-relation queries the response was YES. [2020-10-11 18:46:22,103 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4558 conditions, 1622 events. 353/1622 cut-off events. For 2378/2431 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 17071 event pairs, 0 based on Foata normal form. 4/1536 useless extension candidates. Maximal degree in co-relation 4520. Up to 261 conditions per place. [2020-10-11 18:46:22,106 INFO L132 encePairwiseOnDemand]: 79/92 looper letters, 32 selfloop transitions, 19 changer transitions 15/149 dead transitions. [2020-10-11 18:46:22,107 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 149 transitions, 1014 flow [2020-10-11 18:46:22,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-11 18:46:22,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-11 18:46:22,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 801 transitions. [2020-10-11 18:46:22,112 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.791501976284585 [2020-10-11 18:46:22,112 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 801 transitions. [2020-10-11 18:46:22,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 801 transitions. [2020-10-11 18:46:22,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:46:22,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 801 transitions. [2020-10-11 18:46:22,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-11 18:46:22,115 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-11 18:46:22,116 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-11 18:46:22,116 INFO L185 Difference]: Start difference. First operand has 164 places, 129 transitions, 728 flow. Second operand 11 states and 801 transitions. [2020-10-11 18:46:22,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 149 transitions, 1014 flow [2020-10-11 18:46:22,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 149 transitions, 940 flow, removed 12 selfloop flow, removed 20 redundant places. [2020-10-11 18:46:22,156 INFO L241 Difference]: Finished difference. Result has 157 places, 131 transitions, 764 flow [2020-10-11 18:46:22,157 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=764, PETRI_PLACES=157, PETRI_TRANSITIONS=131} [2020-10-11 18:46:22,157 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 60 predicate places. [2020-10-11 18:46:22,157 INFO L481 AbstractCegarLoop]: Abstraction has has 157 places, 131 transitions, 764 flow [2020-10-11 18:46:22,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 18:46:22,157 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:46:22,157 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:46:22,158 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-11 18:46:22,158 INFO L429 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:46:22,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:46:22,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1360023497, now seen corresponding path program 5 times [2020-10-11 18:46:22,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:46:22,159 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049581054] [2020-10-11 18:46:22,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:46:22,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:46:22,412 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2020-10-11 18:46:22,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:46:22,526 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049581054] [2020-10-11 18:46:22,527 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:46:22,527 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 18:46:22,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154238567] [2020-10-11 18:46:22,528 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 18:46:22,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:46:22,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 18:46:22,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-10-11 18:46:24,416 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 92 [2020-10-11 18:46:24,417 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 131 transitions, 764 flow. Second operand 10 states. [2020-10-11 18:46:24,417 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:46:24,417 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 92 [2020-10-11 18:46:24,417 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:46:25,075 INFO L129 PetriNetUnfolder]: 306/1402 cut-off events. [2020-10-11 18:46:25,075 INFO L130 PetriNetUnfolder]: For 2095/2145 co-relation queries the response was YES. [2020-10-11 18:46:25,086 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3974 conditions, 1402 events. 306/1402 cut-off events. For 2095/2145 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 14243 event pairs, 0 based on Foata normal form. 4/1321 useless extension candidates. Maximal degree in co-relation 3937. Up to 228 conditions per place. [2020-10-11 18:46:25,091 INFO L132 encePairwiseOnDemand]: 81/92 looper letters, 33 selfloop transitions, 8 changer transitions 18/143 dead transitions. [2020-10-11 18:46:25,092 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 143 transitions, 975 flow [2020-10-11 18:46:25,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-11 18:46:25,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-11 18:46:25,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 726 transitions. [2020-10-11 18:46:25,094 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.7891304347826087 [2020-10-11 18:46:25,094 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 726 transitions. [2020-10-11 18:46:25,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 726 transitions. [2020-10-11 18:46:25,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:46:25,095 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 726 transitions. [2020-10-11 18:46:25,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-11 18:46:25,105 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-11 18:46:25,106 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-11 18:46:25,106 INFO L185 Difference]: Start difference. First operand has 157 places, 131 transitions, 764 flow. Second operand 10 states and 726 transitions. [2020-10-11 18:46:25,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 143 transitions, 975 flow [2020-10-11 18:46:25,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 143 transitions, 898 flow, removed 25 selfloop flow, removed 10 redundant places. [2020-10-11 18:46:25,155 INFO L241 Difference]: Finished difference. Result has 159 places, 125 transitions, 689 flow [2020-10-11 18:46:25,155 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=689, PETRI_PLACES=159, PETRI_TRANSITIONS=125} [2020-10-11 18:46:25,156 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 62 predicate places. [2020-10-11 18:46:25,156 INFO L481 AbstractCegarLoop]: Abstraction has has 159 places, 125 transitions, 689 flow [2020-10-11 18:46:25,156 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 18:46:25,156 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:46:25,156 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:46:25,156 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-11 18:46:25,156 INFO L429 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:46:25,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:46:25,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1022769853, now seen corresponding path program 6 times [2020-10-11 18:46:25,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:46:25,158 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311384404] [2020-10-11 18:46:25,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:46:25,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:46:25,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:46:25,464 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311384404] [2020-10-11 18:46:25,465 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:46:25,465 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 18:46:25,465 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912352496] [2020-10-11 18:46:25,466 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 18:46:25,468 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:46:25,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 18:46:25,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-11 18:46:27,066 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 92 [2020-10-11 18:46:27,067 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 125 transitions, 689 flow. Second operand 10 states. [2020-10-11 18:46:27,067 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:46:27,067 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 92 [2020-10-11 18:46:27,067 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:46:27,412 INFO L129 PetriNetUnfolder]: 221/1028 cut-off events. [2020-10-11 18:46:27,413 INFO L130 PetriNetUnfolder]: For 1499/1540 co-relation queries the response was YES. [2020-10-11 18:46:27,417 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2901 conditions, 1028 events. 221/1028 cut-off events. For 1499/1540 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 9548 event pairs, 0 based on Foata normal form. 5/970 useless extension candidates. Maximal degree in co-relation 2862. Up to 168 conditions per place. [2020-10-11 18:46:27,419 INFO L132 encePairwiseOnDemand]: 82/92 looper letters, 24 selfloop transitions, 3 changer transitions 22/133 dead transitions. [2020-10-11 18:46:27,419 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 133 transitions, 833 flow [2020-10-11 18:46:27,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-11 18:46:27,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-11 18:46:27,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 724 transitions. [2020-10-11 18:46:27,422 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.7869565217391304 [2020-10-11 18:46:27,422 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 724 transitions. [2020-10-11 18:46:27,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 724 transitions. [2020-10-11 18:46:27,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:46:27,423 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 724 transitions. [2020-10-11 18:46:27,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-11 18:46:27,425 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-11 18:46:27,425 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-11 18:46:27,425 INFO L185 Difference]: Start difference. First operand has 159 places, 125 transitions, 689 flow. Second operand 10 states and 724 transitions. [2020-10-11 18:46:27,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 133 transitions, 833 flow [2020-10-11 18:46:27,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 133 transitions, 783 flow, removed 14 selfloop flow, removed 11 redundant places. [2020-10-11 18:46:27,445 INFO L241 Difference]: Finished difference. Result has 152 places, 111 transitions, 541 flow [2020-10-11 18:46:27,445 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=541, PETRI_PLACES=152, PETRI_TRANSITIONS=111} [2020-10-11 18:46:27,446 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 55 predicate places. [2020-10-11 18:46:27,446 INFO L481 AbstractCegarLoop]: Abstraction has has 152 places, 111 transitions, 541 flow [2020-10-11 18:46:27,446 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 18:46:27,446 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:46:27,446 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:46:27,446 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-11 18:46:27,446 INFO L429 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:46:27,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:46:27,447 INFO L82 PathProgramCache]: Analyzing trace with hash -199514591, now seen corresponding path program 7 times [2020-10-11 18:46:27,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:46:27,447 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535756592] [2020-10-11 18:46:27,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:46:27,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:46:27,944 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 22 [2020-10-11 18:46:28,149 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 27 [2020-10-11 18:46:28,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:46:28,349 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535756592] [2020-10-11 18:46:28,350 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:46:28,350 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-10-11 18:46:28,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352434068] [2020-10-11 18:46:28,350 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-11 18:46:28,351 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:46:28,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-11 18:46:28,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2020-10-11 18:46:33,016 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 92 [2020-10-11 18:46:33,017 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 111 transitions, 541 flow. Second operand 15 states. [2020-10-11 18:46:33,017 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:46:33,017 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 92 [2020-10-11 18:46:33,018 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:46:33,590 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 38 [2020-10-11 18:46:33,732 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2020-10-11 18:46:33,740 INFO L129 PetriNetUnfolder]: 116/556 cut-off events. [2020-10-11 18:46:33,740 INFO L130 PetriNetUnfolder]: For 743/757 co-relation queries the response was YES. [2020-10-11 18:46:33,743 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1542 conditions, 556 events. 116/556 cut-off events. For 743/757 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4170 event pairs, 0 based on Foata normal form. 1/525 useless extension candidates. Maximal degree in co-relation 1510. Up to 87 conditions per place. [2020-10-11 18:46:33,744 INFO L132 encePairwiseOnDemand]: 81/92 looper letters, 17 selfloop transitions, 6 changer transitions 33/116 dead transitions. [2020-10-11 18:46:33,744 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 116 transitions, 633 flow [2020-10-11 18:46:33,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 18:46:33,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-11 18:46:33,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 847 transitions. [2020-10-11 18:46:33,745 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.7672101449275363 [2020-10-11 18:46:33,745 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 847 transitions. [2020-10-11 18:46:33,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 847 transitions. [2020-10-11 18:46:33,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:46:33,745 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 847 transitions. [2020-10-11 18:46:33,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-11 18:46:33,748 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-11 18:46:33,748 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-11 18:46:33,748 INFO L185 Difference]: Start difference. First operand has 152 places, 111 transitions, 541 flow. Second operand 12 states and 847 transitions. [2020-10-11 18:46:33,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 116 transitions, 633 flow [2020-10-11 18:46:33,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 116 transitions, 545 flow, removed 21 selfloop flow, removed 22 redundant places. [2020-10-11 18:46:33,757 INFO L241 Difference]: Finished difference. Result has 133 places, 83 transitions, 287 flow [2020-10-11 18:46:33,757 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=287, PETRI_PLACES=133, PETRI_TRANSITIONS=83} [2020-10-11 18:46:33,757 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 36 predicate places. [2020-10-11 18:46:33,757 INFO L481 AbstractCegarLoop]: Abstraction has has 133 places, 83 transitions, 287 flow [2020-10-11 18:46:33,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-11 18:46:33,758 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:46:33,758 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:46:33,758 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-11 18:46:33,758 INFO L429 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:46:33,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:46:33,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1133669043, now seen corresponding path program 8 times [2020-10-11 18:46:33,759 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:46:33,760 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809477404] [2020-10-11 18:46:33,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:46:33,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:46:33,820 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:46:33,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:46:33,901 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:46:33,967 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-11 18:46:33,968 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-11 18:46:33,968 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-11 18:46:34,014 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,014 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,015 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,015 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,015 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,015 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,016 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,016 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,017 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,017 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,017 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,017 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,018 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,018 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,018 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,018 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,019 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,019 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,019 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,019 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,019 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,019 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,020 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,020 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,020 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,020 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,021 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,021 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,022 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,022 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,022 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,022 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,022 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,022 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,022 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,022 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,023 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,023 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,029 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,029 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,029 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,029 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,029 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,029 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,030 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,030 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,030 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,030 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,030 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,030 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,030 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,031 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,031 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,031 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,031 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,031 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,031 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,031 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,031 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,032 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,032 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,032 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,032 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,032 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,032 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,032 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,033 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,033 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,033 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,033 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,033 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,033 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,034 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,034 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,034 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,034 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,034 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,034 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,034 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,034 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,035 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,035 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,035 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,035 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,036 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,036 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,036 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,036 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,036 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,036 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,038 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,038 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,038 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,038 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,038 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,038 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,038 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,039 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,039 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,039 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,039 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,039 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,039 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,040 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,040 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,040 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,040 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,040 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,040 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,040 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,040 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,041 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,041 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,041 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,041 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,041 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,041 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,041 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,042 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,042 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,042 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,042 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,042 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:34,042 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:34,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 06:46:34 BasicIcfg [2020-10-11 18:46:34,175 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-11 18:46:34,178 INFO L168 Benchmark]: Toolchain (without parser) took 69973.90 ms. Allocated memory was 250.1 MB in the beginning and 1.3 GB in the end (delta: 1.0 GB). Free memory was 205.4 MB in the beginning and 684.7 MB in the end (delta: -479.3 MB). Peak memory consumption was 557.8 MB. Max. memory is 14.2 GB. [2020-10-11 18:46:34,178 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 250.1 MB. Free memory is still 226.5 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-11 18:46:34,179 INFO L168 Benchmark]: CACSL2BoogieTranslator took 850.86 ms. Allocated memory was 250.1 MB in the beginning and 309.9 MB in the end (delta: 59.8 MB). Free memory was 205.4 MB in the beginning and 257.4 MB in the end (delta: -52.0 MB). Peak memory consumption was 33.1 MB. Max. memory is 14.2 GB. [2020-10-11 18:46:34,181 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.74 ms. Allocated memory is still 309.9 MB. Free memory was 257.4 MB in the beginning and 254.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-11 18:46:34,181 INFO L168 Benchmark]: Boogie Preprocessor took 62.37 ms. Allocated memory is still 309.9 MB. Free memory was 254.9 MB in the beginning and 252.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-11 18:46:34,182 INFO L168 Benchmark]: RCFGBuilder took 3613.91 ms. Allocated memory was 309.9 MB in the beginning and 369.6 MB in the end (delta: 59.8 MB). Free memory was 252.4 MB in the beginning and 168.0 MB in the end (delta: 84.4 MB). Peak memory consumption was 149.7 MB. Max. memory is 14.2 GB. [2020-10-11 18:46:34,182 INFO L168 Benchmark]: TraceAbstraction took 65351.49 ms. Allocated memory was 369.6 MB in the beginning and 1.3 GB in the end (delta: 917.5 MB). Free memory was 168.0 MB in the beginning and 684.7 MB in the end (delta: -516.7 MB). Peak memory consumption was 400.8 MB. Max. memory is 14.2 GB. [2020-10-11 18:46:34,190 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 250.1 MB. Free memory is still 226.5 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 850.86 ms. Allocated memory was 250.1 MB in the beginning and 309.9 MB in the end (delta: 59.8 MB). Free memory was 205.4 MB in the beginning and 257.4 MB in the end (delta: -52.0 MB). Peak memory consumption was 33.1 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 87.74 ms. Allocated memory is still 309.9 MB. Free memory was 257.4 MB in the beginning and 254.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 62.37 ms. Allocated memory is still 309.9 MB. Free memory was 254.9 MB in the beginning and 252.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 3613.91 ms. Allocated memory was 309.9 MB in the beginning and 369.6 MB in the end (delta: 59.8 MB). Free memory was 252.4 MB in the beginning and 168.0 MB in the end (delta: 84.4 MB). Peak memory consumption was 149.7 MB. Max. memory is 14.2 GB. * TraceAbstraction took 65351.49 ms. Allocated memory was 369.6 MB in the beginning and 1.3 GB in the end (delta: 917.5 MB). Free memory was 168.0 MB in the beginning and 684.7 MB in the end (delta: -516.7 MB). Peak memory consumption was 400.8 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 8]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L701] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L703] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L704] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L705] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L707] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L708] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L709] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L710] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L711] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L712] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L713] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L714] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L715] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L716] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L717] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L718] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L719] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L720] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L721] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L722] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L723] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L725] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L726] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L727] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L838] 0 pthread_t t2552; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L839] FCALL, FORK 0 pthread_create(&t2552, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L840] 0 pthread_t t2553; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L841] FCALL, FORK 0 pthread_create(&t2553, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L842] 0 pthread_t t2554; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L843] FCALL, FORK 0 pthread_create(&t2554, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L801] 3 x$w_buff1 = x$w_buff0 [L802] 3 x$w_buff0 = 2 [L803] 3 x$w_buff1_used = x$w_buff0_used [L804] 3 x$w_buff0_used = (_Bool)1 [L8] COND FALSE 3 !(!expression) [L806] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L807] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L808] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L809] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L810] 3 x$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L813] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L731] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L737] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L738] 1 x$flush_delayed = weak$$choice2 [L739] 1 x$mem_tmp = x [L740] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1 [L740] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L741] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L742] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L742] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L743] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L744] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L745] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L745] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L745] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L745] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L745] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L746] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L746] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L747] 1 __unbuffered_p0_EAX = x [L748] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L748] 1 x = x$flush_delayed ? x$mem_tmp : x [L749] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L761] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L764] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L764] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L764] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L764] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L765] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L765] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L766] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L766] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L767] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L768] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L771] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 2 x$flush_delayed = weak$$choice2 [L774] 2 x$mem_tmp = x [L775] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L775] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L776] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L776] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0) [L776] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L776] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L777] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L777] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1) [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1 [L777] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1) [L777] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L777] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L778] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L778] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used) [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used) [L778] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L778] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L779] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L780] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2) [L780] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L780] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L781] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L781] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] 2 __unbuffered_p1_EAX = x [L783] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L783] 2 x = x$flush_delayed ? x$mem_tmp : x [L784] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L787] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L787] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L788] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L789] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L791] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L816] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L816] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L817] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L817] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L818] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L818] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L819] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L819] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L820] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L820] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L823] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L849] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L849] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L850] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L850] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L851] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L851] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L852] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L852] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L853] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L853] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L856] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L857] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L858] 0 x$flush_delayed = weak$$choice2 [L859] 0 x$mem_tmp = x [L860] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1 [L860] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L860] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L861] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L861] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L862] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L862] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L862] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L862] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L863] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L863] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L863] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L863] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L864] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L865] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L866] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L866] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L866] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L866] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L868] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L868] 0 x = x$flush_delayed ? x$mem_tmp : x [L869] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L8] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L8] 0 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 91 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 64.8s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 55.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 934 SDtfs, 1945 SDslu, 7782 SDs, 0 SdLazy, 6624 SolverSat, 888 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 415 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 368 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1187 ImplicationChecksByTransitivity, 10.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1006occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 1530 NumberOfCodeBlocks, 1530 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1438 ConstructedInterpolants, 0 QuantifiedInterpolants, 589381 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...