/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/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe-SemanticLooper.epf -i ../../../trunk/examples/svcomp/pthread-wmm/thin002_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 05:12:32,837 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 05:12:32,840 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 05:12:32,876 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 05:12:32,877 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 05:12:32,885 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 05:12:32,887 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 05:12:32,891 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 05:12:32,893 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 05:12:32,897 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 05:12:32,898 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 05:12:32,899 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 05:12:32,899 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 05:12:32,902 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 05:12:32,904 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 05:12:32,906 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 05:12:32,907 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 05:12:32,908 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 05:12:32,910 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 05:12:32,917 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 05:12:32,919 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 05:12:32,920 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 05:12:32,921 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 05:12:32,922 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 05:12:32,934 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 05:12:32,934 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 05:12:32,937 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 05:12:32,938 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 05:12:32,938 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 05:12:32,942 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 05:12:32,943 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 05:12:32,943 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 05:12:32,944 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 05:12:32,945 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 05:12:32,948 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 05:12:32,948 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 05:12:32,949 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 05:12:32,949 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 05:12:32,951 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 05:12:32,952 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 05:12:32,953 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 05:12:32,954 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe-SemanticLooper.epf [2020-10-16 05:12:32,990 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 05:12:32,990 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 05:12:32,992 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 05:12:32,992 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 05:12:32,992 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 05:12:32,992 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 05:12:32,993 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 05:12:32,993 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 05:12:32,993 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 05:12:32,993 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 05:12:32,994 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 05:12:32,994 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 05:12:32,995 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 05:12:32,995 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 05:12:32,995 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 05:12:32,995 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 05:12:32,996 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 05:12:32,996 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 05:12:32,996 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 05:12:32,996 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 05:12:32,997 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 05:12:32,997 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 05:12:32,997 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 05:12:32,997 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 05:12:32,997 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 05:12:32,998 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 05:12:32,998 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 05:12:32,998 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 05:12:32,998 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 05:12:33,313 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 05:12:33,326 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 05:12:33,329 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 05:12:33,330 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 05:12:33,331 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 05:12:33,332 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/thin002_rmo.opt.i [2020-10-16 05:12:33,390 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3950c99ea/c98faf5954bd4d5cac2bdb2706eca4bb/FLAG58aac64a2 [2020-10-16 05:12:33,910 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 05:12:33,911 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/thin002_rmo.opt.i [2020-10-16 05:12:33,930 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3950c99ea/c98faf5954bd4d5cac2bdb2706eca4bb/FLAG58aac64a2 [2020-10-16 05:12:34,230 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3950c99ea/c98faf5954bd4d5cac2bdb2706eca4bb [2020-10-16 05:12:34,238 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 05:12:34,240 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 05:12:34,242 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 05:12:34,242 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 05:12:34,245 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 05:12:34,246 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 05:12:34" (1/1) ... [2020-10-16 05:12:34,249 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dd921af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:12:34, skipping insertion in model container [2020-10-16 05:12:34,249 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 05:12:34" (1/1) ... [2020-10-16 05:12:34,257 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 05:12:34,305 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 05:12:34,876 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 05:12:34,901 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 05:12:34,976 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 05:12:35,065 INFO L208 MainTranslator]: Completed translation [2020-10-16 05:12:35,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:12:35 WrapperNode [2020-10-16 05:12:35,066 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 05:12:35,066 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 05:12:35,067 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 05:12:35,067 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 05:12:35,076 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:12:35" (1/1) ... [2020-10-16 05:12:35,095 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:12:35" (1/1) ... [2020-10-16 05:12:35,123 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 05:12:35,123 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 05:12:35,124 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 05:12:35,124 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 05:12:35,134 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:12:35" (1/1) ... [2020-10-16 05:12:35,134 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:12:35" (1/1) ... [2020-10-16 05:12:35,138 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:12:35" (1/1) ... [2020-10-16 05:12:35,138 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:12:35" (1/1) ... [2020-10-16 05:12:35,149 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:12:35" (1/1) ... [2020-10-16 05:12:35,152 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:12:35" (1/1) ... [2020-10-16 05:12:35,156 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:12:35" (1/1) ... [2020-10-16 05:12:35,166 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 05:12:35,169 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 05:12:35,170 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 05:12:35,170 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 05:12:35,171 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:12:35" (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-16 05:12:35,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-16 05:12:35,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 05:12:35,249 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 05:12:35,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 05:12:35,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 05:12:35,250 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 05:12:35,251 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 05:12:35,251 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 05:12:35,252 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 05:12:35,252 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 05:12:35,254 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 05:12:35,254 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-16 05:12:35,254 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-16 05:12:35,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-16 05:12:35,255 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 05:12:35,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 05:12:35,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 05:12:35,257 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 05:12:37,194 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 05:12:37,194 INFO L298 CfgBuilder]: Removed 8 assume(true) statements. [2020-10-16 05:12:37,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 05:12:37 BoogieIcfgContainer [2020-10-16 05:12:37,197 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 05:12:37,199 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 05:12:37,199 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 05:12:37,204 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 05:12:37,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 05:12:34" (1/3) ... [2020-10-16 05:12:37,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36f483e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 05:12:37, skipping insertion in model container [2020-10-16 05:12:37,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:12:35" (2/3) ... [2020-10-16 05:12:37,206 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36f483e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 05:12:37, skipping insertion in model container [2020-10-16 05:12:37,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 05:12:37" (3/3) ... [2020-10-16 05:12:37,208 INFO L111 eAbstractionObserver]: Analyzing ICFG thin002_rmo.opt.i [2020-10-16 05:12:37,223 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 05:12:37,233 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-16 05:12:37,234 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 05:12:37,274 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,275 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,275 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,275 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,276 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,276 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,276 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,276 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,276 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,277 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,277 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,277 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,277 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,277 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,278 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,278 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,278 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,278 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,278 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,279 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,279 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,279 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,279 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,280 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,280 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,280 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,280 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,280 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,280 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,281 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,281 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,281 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,281 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,281 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,281 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,282 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,282 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,282 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,282 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,282 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,282 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,283 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,283 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,283 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,283 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,283 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,283 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,283 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,286 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,286 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,287 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,287 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,287 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,287 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,289 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,289 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,289 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,289 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,290 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,290 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,290 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,290 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,291 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,291 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,291 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,291 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,291 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,291 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,292 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,292 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,292 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,292 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,292 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,293 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,293 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,297 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,297 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,297 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,298 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,298 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,298 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,298 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,298 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,299 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,299 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,299 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,304 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,304 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,304 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,305 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,305 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,305 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,305 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,305 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,306 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,306 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,306 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,306 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,307 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,307 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,307 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,307 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,307 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,308 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,308 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,308 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,308 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,308 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,309 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,309 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,309 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,309 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,309 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,310 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,310 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,310 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,310 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,312 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,312 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,314 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,315 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,315 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,315 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:12:37,333 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-16 05:12:37,355 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 05:12:37,355 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 05:12:37,356 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 05:12:37,356 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 05:12:37,356 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 05:12:37,356 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 05:12:37,356 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 05:12:37,356 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 05:12:37,372 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 276 flow [2020-10-16 05:12:37,435 INFO L129 PetriNetUnfolder]: 2/124 cut-off events. [2020-10-16 05:12:37,436 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:12:37,442 INFO L80 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2020-10-16 05:12:37,442 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 128 transitions, 276 flow [2020-10-16 05:12:37,449 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 111 transitions, 234 flow [2020-10-16 05:12:37,452 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 05:12:37,455 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 111 transitions, 234 flow [2020-10-16 05:12:37,458 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 111 transitions, 234 flow [2020-10-16 05:12:37,459 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 123 places, 111 transitions, 234 flow [2020-10-16 05:12:37,491 INFO L129 PetriNetUnfolder]: 1/111 cut-off events. [2020-10-16 05:12:37,492 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:12:37,493 INFO L80 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 111 events. 1/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place. [2020-10-16 05:12:37,496 INFO L117 LiptonReduction]: Number of co-enabled transitions 1506 [2020-10-16 05:12:37,643 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:12:37,644 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:12:37,696 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:12:37,697 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:12:37,968 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:12:37,968 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:12:38,072 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:12:38,073 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:12:38,075 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:12:38,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:12:38,077 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:12:38,077 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:12:38,078 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 05:12:38,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:12:38,080 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:12:38,081 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:12:38,081 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 05:12:38,082 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:12:38,085 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:12:38,085 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:12:38,088 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:12:38,089 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:12:38,090 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:12:38,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:12:38,093 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:12:38,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:12:38,095 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:12:38,096 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:12:38,097 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:12:38,098 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:12:38,154 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:12:38,155 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:12:38,158 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 6, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:12:38,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:12:38,163 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:12:38,164 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:12:38,247 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:12:38,248 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:12:38,276 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:12:38,277 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:12:39,599 WARN L193 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 238 DAG size of output: 198 [2020-10-16 05:12:39,620 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:12:39,620 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:12:40,240 WARN L193 SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 111 [2020-10-16 05:12:40,259 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:12:40,260 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:12:40,266 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 1] term [2020-10-16 05:12:40,267 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:12:40,267 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-10-16 05:12:40,268 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:12:40,305 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:12:40,306 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:12:40,307 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 2, 1] term [2020-10-16 05:12:40,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:12:40,308 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 6, 3, 3, 2, 1] term [2020-10-16 05:12:40,309 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:12:40,309 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 2, 2, 2, 1] term [2020-10-16 05:12:40,310 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:12:40,310 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-16 05:12:40,311 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:12:40,311 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-16 05:12:40,312 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:12:40,312 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-16 05:12:40,313 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:12:40,473 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:12:40,473 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:12:40,494 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:12:40,495 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:12:40,891 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 05:12:40,891 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:12:40,893 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 05:12:40,893 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:12:41,083 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 2, 1] term [2020-10-16 05:12:41,083 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:12:41,086 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-16 05:12:41,087 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:12:41,104 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 2, 1] term [2020-10-16 05:12:41,105 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:12:41,106 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-10-16 05:12:41,106 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:12:41,232 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:12:41,282 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:12:41,409 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 05:12:41,410 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:12:41,410 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 05:12:41,411 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:12:41,423 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 05:12:41,424 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:12:41,424 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 05:12:41,425 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:12:41,711 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2020-10-16 05:12:42,091 WARN L193 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 72 [2020-10-16 05:12:42,098 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 05:12:42,098 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:12:42,099 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 05:12:42,100 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:12:42,203 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-10-16 05:12:42,255 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:12:42,385 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 05:12:42,385 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:12:42,386 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 05:12:42,386 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:12:42,396 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 05:12:42,397 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:12:42,397 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 05:12:42,398 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:12:42,480 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:12:42,581 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:12:42,623 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:12:42,624 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:12:42,757 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 05:12:42,757 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:12:42,758 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 05:12:42,758 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:12:42,768 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 05:12:42,768 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:12:42,769 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 05:12:42,769 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:12:42,790 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:12:42,865 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:12:42,866 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:12:42,891 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 05:12:42,892 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:12:42,892 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 05:12:42,893 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:12:42,907 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 05:12:42,907 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:12:42,908 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 05:12:42,908 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:12:43,413 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-10-16 05:12:43,535 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-10-16 05:12:43,750 WARN L193 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-10-16 05:12:43,961 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2020-10-16 05:12:44,609 WARN L193 SmtUtils]: Spent 642.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 146 [2020-10-16 05:12:44,869 WARN L193 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2020-10-16 05:12:44,875 INFO L132 LiptonReduction]: Checked pairs total: 4481 [2020-10-16 05:12:44,875 INFO L134 LiptonReduction]: Total number of compositions: 92 [2020-10-16 05:12:44,879 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7429 [2020-10-16 05:12:44,887 INFO L129 PetriNetUnfolder]: 0/19 cut-off events. [2020-10-16 05:12:44,887 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:12:44,888 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:12:44,889 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:12:44,889 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:12:44,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:12:44,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1317621440, now seen corresponding path program 1 times [2020-10-16 05:12:44,901 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:12:44,901 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449895504] [2020-10-16 05:12:44,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:12:45,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:12:45,102 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-16 05:12:45,103 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449895504] [2020-10-16 05:12:45,104 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:12:45,105 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 05:12:45,105 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118630746] [2020-10-16 05:12:45,117 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-16 05:12:45,117 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:12:45,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-16 05:12:45,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-16 05:12:45,133 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 220 [2020-10-16 05:12:45,136 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 62 flow. Second operand 2 states. [2020-10-16 05:12:45,136 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:12:45,136 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 220 [2020-10-16 05:12:45,138 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:12:45,149 INFO L129 PetriNetUnfolder]: 0/24 cut-off events. [2020-10-16 05:12:45,149 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:12:45,150 INFO L80 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 24 events. 0/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 29 event pairs, 0 based on Foata normal form. 1/25 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2020-10-16 05:12:45,151 INFO L132 encePairwiseOnDemand]: 219/220 looper letters, 0 selfloop transitions, 0 changer transitions 0/24 dead transitions. [2020-10-16 05:12:45,151 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 24 transitions, 60 flow [2020-10-16 05:12:45,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-16 05:12:45,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-10-16 05:12:45,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 429 transitions. [2020-10-16 05:12:45,168 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.975 [2020-10-16 05:12:45,169 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 429 transitions. [2020-10-16 05:12:45,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 429 transitions. [2020-10-16 05:12:45,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:12:45,175 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 429 transitions. [2020-10-16 05:12:45,179 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 3 states. [2020-10-16 05:12:45,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 3 states. [2020-10-16 05:12:45,187 INFO L81 ComplementDD]: Finished complementDD. Result 3 states. [2020-10-16 05:12:45,190 INFO L185 Difference]: Start difference. First operand has 37 places, 25 transitions, 62 flow. Second operand 2 states and 429 transitions. [2020-10-16 05:12:45,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 24 transitions, 60 flow [2020-10-16 05:12:45,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 24 transitions, 56 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-16 05:12:45,195 INFO L241 Difference]: Finished difference. Result has 34 places, 24 transitions, 56 flow [2020-10-16 05:12:45,198 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=56, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2020-10-16 05:12:45,199 INFO L342 CegarLoopForPetriNet]: 37 programPoint places, -3 predicate places. [2020-10-16 05:12:45,199 INFO L481 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 56 flow [2020-10-16 05:12:45,199 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-16 05:12:45,199 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:12:45,199 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:12:45,200 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 05:12:45,200 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:12:45,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:12:45,200 INFO L82 PathProgramCache]: Analyzing trace with hash -781137686, now seen corresponding path program 1 times [2020-10-16 05:12:45,201 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:12:45,201 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216990919] [2020-10-16 05:12:45,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:12:45,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:12:45,352 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-16 05:12:45,352 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216990919] [2020-10-16 05:12:45,353 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:12:45,353 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 05:12:45,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314758944] [2020-10-16 05:12:45,354 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 05:12:45,355 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:12:45,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 05:12:45,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 05:12:45,358 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 220 [2020-10-16 05:12:45,358 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 56 flow. Second operand 3 states. [2020-10-16 05:12:45,359 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:12:45,359 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 220 [2020-10-16 05:12:45,359 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:12:45,376 INFO L129 PetriNetUnfolder]: 0/24 cut-off events. [2020-10-16 05:12:45,377 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:12:45,377 INFO L80 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 24 events. 0/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 30 event pairs, 0 based on Foata normal form. 1/25 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2020-10-16 05:12:45,377 INFO L132 encePairwiseOnDemand]: 217/220 looper letters, 1 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2020-10-16 05:12:45,377 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 24 transitions, 62 flow [2020-10-16 05:12:45,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 05:12:45,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 05:12:45,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 604 transitions. [2020-10-16 05:12:45,382 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.9151515151515152 [2020-10-16 05:12:45,383 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 604 transitions. [2020-10-16 05:12:45,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 604 transitions. [2020-10-16 05:12:45,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:12:45,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 604 transitions. [2020-10-16 05:12:45,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 05:12:45,388 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 05:12:45,388 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 05:12:45,389 INFO L185 Difference]: Start difference. First operand has 34 places, 24 transitions, 56 flow. Second operand 3 states and 604 transitions. [2020-10-16 05:12:45,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 24 transitions, 62 flow [2020-10-16 05:12:45,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 24 transitions, 62 flow, removed 0 selfloop flow, removed 0 redundant places. [2020-10-16 05:12:45,391 INFO L241 Difference]: Finished difference. Result has 37 places, 24 transitions, 64 flow [2020-10-16 05:12:45,391 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=37, PETRI_TRANSITIONS=24} [2020-10-16 05:12:45,391 INFO L342 CegarLoopForPetriNet]: 37 programPoint places, 0 predicate places. [2020-10-16 05:12:45,392 INFO L481 AbstractCegarLoop]: Abstraction has has 37 places, 24 transitions, 64 flow [2020-10-16 05:12:45,392 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 05:12:45,392 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:12:45,392 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:12:45,392 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 05:12:45,392 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:12:45,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:12:45,393 INFO L82 PathProgramCache]: Analyzing trace with hash -13848166, now seen corresponding path program 1 times [2020-10-16 05:12:45,393 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:12:45,393 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019470323] [2020-10-16 05:12:45,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:12:45,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:12:45,476 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-16 05:12:45,476 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019470323] [2020-10-16 05:12:45,477 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:12:45,477 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 05:12:45,477 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295152062] [2020-10-16 05:12:45,478 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 05:12:45,478 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:12:45,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 05:12:45,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 05:12:45,481 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 220 [2020-10-16 05:12:45,481 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 24 transitions, 64 flow. Second operand 4 states. [2020-10-16 05:12:45,481 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:12:45,482 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 220 [2020-10-16 05:12:45,482 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:12:45,515 INFO L129 PetriNetUnfolder]: 0/29 cut-off events. [2020-10-16 05:12:45,516 INFO L130 PetriNetUnfolder]: For 5/12 co-relation queries the response was YES. [2020-10-16 05:12:45,516 INFO L80 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 29 events. 0/29 cut-off events. For 5/12 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 61 event pairs, 0 based on Foata normal form. 2/31 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2020-10-16 05:12:45,516 INFO L132 encePairwiseOnDemand]: 216/220 looper letters, 1 selfloop transitions, 3 changer transitions 1/25 dead transitions. [2020-10-16 05:12:45,517 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 25 transitions, 79 flow [2020-10-16 05:12:45,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 05:12:45,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 05:12:45,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 779 transitions. [2020-10-16 05:12:45,520 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8852272727272728 [2020-10-16 05:12:45,520 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 779 transitions. [2020-10-16 05:12:45,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 779 transitions. [2020-10-16 05:12:45,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:12:45,521 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 779 transitions. [2020-10-16 05:12:45,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 05:12:45,526 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 05:12:45,526 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 05:12:45,526 INFO L185 Difference]: Start difference. First operand has 37 places, 24 transitions, 64 flow. Second operand 4 states and 779 transitions. [2020-10-16 05:12:45,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 25 transitions, 79 flow [2020-10-16 05:12:45,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 25 transitions, 73 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 05:12:45,528 INFO L241 Difference]: Finished difference. Result has 40 places, 24 transitions, 74 flow [2020-10-16 05:12:45,528 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=74, PETRI_PLACES=40, PETRI_TRANSITIONS=24} [2020-10-16 05:12:45,529 INFO L342 CegarLoopForPetriNet]: 37 programPoint places, 3 predicate places. [2020-10-16 05:12:45,529 INFO L481 AbstractCegarLoop]: Abstraction has has 40 places, 24 transitions, 74 flow [2020-10-16 05:12:45,529 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 05:12:45,529 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:12:45,529 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:12:45,530 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 05:12:45,530 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:12:45,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:12:45,530 INFO L82 PathProgramCache]: Analyzing trace with hash 164757684, now seen corresponding path program 1 times [2020-10-16 05:12:45,530 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:12:45,531 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347620919] [2020-10-16 05:12:45,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:12:45,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:12:45,578 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-16 05:12:45,579 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347620919] [2020-10-16 05:12:45,579 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:12:45,579 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 05:12:45,580 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301456481] [2020-10-16 05:12:45,580 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 05:12:45,580 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:12:45,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 05:12:45,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 05:12:45,582 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 220 [2020-10-16 05:12:45,583 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 24 transitions, 74 flow. Second operand 3 states. [2020-10-16 05:12:45,583 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:12:45,583 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 220 [2020-10-16 05:12:45,583 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:12:45,594 INFO L129 PetriNetUnfolder]: 0/24 cut-off events. [2020-10-16 05:12:45,595 INFO L130 PetriNetUnfolder]: For 15/17 co-relation queries the response was YES. [2020-10-16 05:12:45,595 INFO L80 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 24 events. 0/24 cut-off events. For 15/17 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 34 event pairs, 0 based on Foata normal form. 1/25 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2020-10-16 05:12:45,595 INFO L132 encePairwiseOnDemand]: 217/220 looper letters, 1 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2020-10-16 05:12:45,595 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 24 transitions, 80 flow [2020-10-16 05:12:45,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 05:12:45,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 05:12:45,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 604 transitions. [2020-10-16 05:12:45,598 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.9151515151515152 [2020-10-16 05:12:45,598 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 604 transitions. [2020-10-16 05:12:45,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 604 transitions. [2020-10-16 05:12:45,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:12:45,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 604 transitions. [2020-10-16 05:12:45,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 05:12:45,602 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 05:12:45,602 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 05:12:45,602 INFO L185 Difference]: Start difference. First operand has 40 places, 24 transitions, 74 flow. Second operand 3 states and 604 transitions. [2020-10-16 05:12:45,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 24 transitions, 80 flow [2020-10-16 05:12:45,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 24 transitions, 68 flow, removed 2 selfloop flow, removed 4 redundant places. [2020-10-16 05:12:45,604 INFO L241 Difference]: Finished difference. Result has 39 places, 24 transitions, 70 flow [2020-10-16 05:12:45,604 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=39, PETRI_TRANSITIONS=24} [2020-10-16 05:12:45,604 INFO L342 CegarLoopForPetriNet]: 37 programPoint places, 2 predicate places. [2020-10-16 05:12:45,604 INFO L481 AbstractCegarLoop]: Abstraction has has 39 places, 24 transitions, 70 flow [2020-10-16 05:12:45,605 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 05:12:45,605 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:12:45,605 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:12:45,605 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 05:12:45,605 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:12:45,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:12:45,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1949301526, now seen corresponding path program 1 times [2020-10-16 05:12:45,606 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:12:45,606 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291560931] [2020-10-16 05:12:45,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:12:45,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:12:45,658 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-16 05:12:45,658 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291560931] [2020-10-16 05:12:45,658 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:12:45,659 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 05:12:45,659 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784692973] [2020-10-16 05:12:45,659 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 05:12:45,659 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:12:45,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 05:12:45,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 05:12:45,662 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 220 [2020-10-16 05:12:45,662 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 24 transitions, 70 flow. Second operand 4 states. [2020-10-16 05:12:45,663 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:12:45,663 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 220 [2020-10-16 05:12:45,663 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:12:45,689 INFO L129 PetriNetUnfolder]: 0/30 cut-off events. [2020-10-16 05:12:45,689 INFO L130 PetriNetUnfolder]: For 11/13 co-relation queries the response was YES. [2020-10-16 05:12:45,690 INFO L80 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 30 events. 0/30 cut-off events. For 11/13 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 49 event pairs, 0 based on Foata normal form. 3/33 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2020-10-16 05:12:45,690 INFO L132 encePairwiseOnDemand]: 216/220 looper letters, 1 selfloop transitions, 3 changer transitions 1/25 dead transitions. [2020-10-16 05:12:45,690 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 25 transitions, 85 flow [2020-10-16 05:12:45,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 05:12:45,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 05:12:45,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 779 transitions. [2020-10-16 05:12:45,693 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8852272727272728 [2020-10-16 05:12:45,693 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 779 transitions. [2020-10-16 05:12:45,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 779 transitions. [2020-10-16 05:12:45,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:12:45,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 779 transitions. [2020-10-16 05:12:45,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 05:12:45,698 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 05:12:45,698 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 05:12:45,698 INFO L185 Difference]: Start difference. First operand has 39 places, 24 transitions, 70 flow. Second operand 4 states and 779 transitions. [2020-10-16 05:12:45,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 25 transitions, 85 flow [2020-10-16 05:12:45,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 25 transitions, 79 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 05:12:45,700 INFO L241 Difference]: Finished difference. Result has 42 places, 24 transitions, 80 flow [2020-10-16 05:12:45,700 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=80, PETRI_PLACES=42, PETRI_TRANSITIONS=24} [2020-10-16 05:12:45,700 INFO L342 CegarLoopForPetriNet]: 37 programPoint places, 5 predicate places. [2020-10-16 05:12:45,700 INFO L481 AbstractCegarLoop]: Abstraction has has 42 places, 24 transitions, 80 flow [2020-10-16 05:12:45,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 05:12:45,701 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:12:45,701 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:12:45,701 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 05:12:45,701 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:12:45,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:12:45,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1031687738, now seen corresponding path program 1 times [2020-10-16 05:12:45,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:12:45,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480832041] [2020-10-16 05:12:45,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:12:45,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:12:45,751 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-16 05:12:45,751 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480832041] [2020-10-16 05:12:45,751 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:12:45,752 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 05:12:45,752 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714114489] [2020-10-16 05:12:45,752 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 05:12:45,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:12:45,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 05:12:45,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 05:12:45,754 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 220 [2020-10-16 05:12:45,755 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 24 transitions, 80 flow. Second operand 4 states. [2020-10-16 05:12:45,755 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:12:45,755 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 220 [2020-10-16 05:12:45,755 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:12:45,790 INFO L129 PetriNetUnfolder]: 0/36 cut-off events. [2020-10-16 05:12:45,790 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-16 05:12:45,790 INFO L80 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 36 events. 0/36 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 75 event pairs, 0 based on Foata normal form. 2/38 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2020-10-16 05:12:45,791 INFO L132 encePairwiseOnDemand]: 216/220 looper letters, 1 selfloop transitions, 3 changer transitions 1/25 dead transitions. [2020-10-16 05:12:45,791 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 25 transitions, 92 flow [2020-10-16 05:12:45,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 05:12:45,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 05:12:45,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 779 transitions. [2020-10-16 05:12:45,796 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8852272727272728 [2020-10-16 05:12:45,796 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 779 transitions. [2020-10-16 05:12:45,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 779 transitions. [2020-10-16 05:12:45,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:12:45,798 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 779 transitions. [2020-10-16 05:12:45,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 05:12:45,802 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 05:12:45,802 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 05:12:45,803 INFO L185 Difference]: Start difference. First operand has 42 places, 24 transitions, 80 flow. Second operand 4 states and 779 transitions. [2020-10-16 05:12:45,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 25 transitions, 92 flow [2020-10-16 05:12:45,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 25 transitions, 76 flow, removed 3 selfloop flow, removed 5 redundant places. [2020-10-16 05:12:45,805 INFO L241 Difference]: Finished difference. Result has 42 places, 24 transitions, 78 flow [2020-10-16 05:12:45,806 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=78, PETRI_PLACES=42, PETRI_TRANSITIONS=24} [2020-10-16 05:12:45,806 INFO L342 CegarLoopForPetriNet]: 37 programPoint places, 5 predicate places. [2020-10-16 05:12:45,806 INFO L481 AbstractCegarLoop]: Abstraction has has 42 places, 24 transitions, 78 flow [2020-10-16 05:12:45,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 05:12:45,806 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:12:45,806 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:12:45,807 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 05:12:45,807 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:12:45,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:12:45,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1177114977, now seen corresponding path program 1 times [2020-10-16 05:12:45,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:12:45,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512919447] [2020-10-16 05:12:45,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:12:45,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:12:46,134 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-16 05:12:46,134 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512919447] [2020-10-16 05:12:46,134 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:12:46,135 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 05:12:46,135 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478669996] [2020-10-16 05:12:46,135 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 05:12:46,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:12:46,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 05:12:46,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-16 05:12:46,138 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 220 [2020-10-16 05:12:46,139 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 24 transitions, 78 flow. Second operand 8 states. [2020-10-16 05:12:46,139 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:12:46,139 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 220 [2020-10-16 05:12:46,139 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:12:46,533 INFO L129 PetriNetUnfolder]: 380/642 cut-off events. [2020-10-16 05:12:46,533 INFO L130 PetriNetUnfolder]: For 264/278 co-relation queries the response was YES. [2020-10-16 05:12:46,536 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1420 conditions, 642 events. 380/642 cut-off events. For 264/278 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2644 event pairs, 35 based on Foata normal form. 5/601 useless extension candidates. Maximal degree in co-relation 1413. Up to 393 conditions per place. [2020-10-16 05:12:46,541 INFO L132 encePairwiseOnDemand]: 210/220 looper letters, 32 selfloop transitions, 18 changer transitions 0/60 dead transitions. [2020-10-16 05:12:46,542 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 60 transitions, 262 flow [2020-10-16 05:12:46,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 05:12:46,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 05:12:46,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 862 transitions. [2020-10-16 05:12:46,545 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6530303030303031 [2020-10-16 05:12:46,546 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 862 transitions. [2020-10-16 05:12:46,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 862 transitions. [2020-10-16 05:12:46,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:12:46,547 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 862 transitions. [2020-10-16 05:12:46,548 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 05:12:46,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 05:12:46,551 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 05:12:46,551 INFO L185 Difference]: Start difference. First operand has 42 places, 24 transitions, 78 flow. Second operand 6 states and 862 transitions. [2020-10-16 05:12:46,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 60 transitions, 262 flow [2020-10-16 05:12:46,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 60 transitions, 242 flow, removed 6 selfloop flow, removed 4 redundant places. [2020-10-16 05:12:46,554 INFO L241 Difference]: Finished difference. Result has 46 places, 40 transitions, 186 flow [2020-10-16 05:12:46,555 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=186, PETRI_PLACES=46, PETRI_TRANSITIONS=40} [2020-10-16 05:12:46,555 INFO L342 CegarLoopForPetriNet]: 37 programPoint places, 9 predicate places. [2020-10-16 05:12:46,555 INFO L481 AbstractCegarLoop]: Abstraction has has 46 places, 40 transitions, 186 flow [2020-10-16 05:12:46,555 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 05:12:46,555 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:12:46,555 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:12:46,556 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 05:12:46,556 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:12:46,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:12:46,556 INFO L82 PathProgramCache]: Analyzing trace with hash 645590193, now seen corresponding path program 2 times [2020-10-16 05:12:46,557 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:12:46,557 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481805124] [2020-10-16 05:12:46,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:12:46,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:12:47,002 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 44 [2020-10-16 05:12:47,127 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 30 [2020-10-16 05:12:47,162 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-16 05:12:47,163 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481805124] [2020-10-16 05:12:47,163 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:12:47,163 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 05:12:47,163 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242244052] [2020-10-16 05:12:47,164 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 05:12:47,164 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:12:47,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 05:12:47,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-16 05:12:47,166 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 220 [2020-10-16 05:12:47,167 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 40 transitions, 186 flow. Second operand 8 states. [2020-10-16 05:12:47,167 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:12:47,167 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 220 [2020-10-16 05:12:47,167 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:12:47,525 INFO L129 PetriNetUnfolder]: 424/724 cut-off events. [2020-10-16 05:12:47,525 INFO L130 PetriNetUnfolder]: For 1040/1474 co-relation queries the response was YES. [2020-10-16 05:12:47,528 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2403 conditions, 724 events. 424/724 cut-off events. For 1040/1474 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3224 event pairs, 116 based on Foata normal form. 51/713 useless extension candidates. Maximal degree in co-relation 2395. Up to 503 conditions per place. [2020-10-16 05:12:47,534 INFO L132 encePairwiseOnDemand]: 210/220 looper letters, 29 selfloop transitions, 17 changer transitions 0/56 dead transitions. [2020-10-16 05:12:47,535 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 56 transitions, 348 flow [2020-10-16 05:12:47,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 05:12:47,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 05:12:47,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 713 transitions. [2020-10-16 05:12:47,538 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6481818181818182 [2020-10-16 05:12:47,539 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 713 transitions. [2020-10-16 05:12:47,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 713 transitions. [2020-10-16 05:12:47,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:12:47,540 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 713 transitions. [2020-10-16 05:12:47,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 05:12:47,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 05:12:47,543 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 05:12:47,543 INFO L185 Difference]: Start difference. First operand has 46 places, 40 transitions, 186 flow. Second operand 5 states and 713 transitions. [2020-10-16 05:12:47,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 56 transitions, 348 flow [2020-10-16 05:12:47,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 56 transitions, 348 flow, removed 0 selfloop flow, removed 0 redundant places. [2020-10-16 05:12:47,548 INFO L241 Difference]: Finished difference. Result has 52 places, 43 transitions, 268 flow [2020-10-16 05:12:47,548 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=268, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2020-10-16 05:12:47,548 INFO L342 CegarLoopForPetriNet]: 37 programPoint places, 15 predicate places. [2020-10-16 05:12:47,548 INFO L481 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 268 flow [2020-10-16 05:12:47,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 05:12:47,549 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:12:47,549 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:12:47,549 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 05:12:47,549 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:12:47,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:12:47,550 INFO L82 PathProgramCache]: Analyzing trace with hash -557761422, now seen corresponding path program 1 times [2020-10-16 05:12:47,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:12:47,550 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183374863] [2020-10-16 05:12:47,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:12:47,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:12:47,845 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-16 05:12:47,846 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183374863] [2020-10-16 05:12:47,846 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:12:47,846 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 05:12:47,846 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106216500] [2020-10-16 05:12:47,847 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 05:12:47,847 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:12:47,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 05:12:47,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-16 05:12:47,848 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 220 [2020-10-16 05:12:47,849 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 268 flow. Second operand 7 states. [2020-10-16 05:12:47,849 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:12:47,849 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 220 [2020-10-16 05:12:47,849 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:12:48,013 INFO L129 PetriNetUnfolder]: 132/357 cut-off events. [2020-10-16 05:12:48,014 INFO L130 PetriNetUnfolder]: For 1109/1225 co-relation queries the response was YES. [2020-10-16 05:12:48,016 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1230 conditions, 357 events. 132/357 cut-off events. For 1109/1225 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1877 event pairs, 30 based on Foata normal form. 29/341 useless extension candidates. Maximal degree in co-relation 1219. Up to 172 conditions per place. [2020-10-16 05:12:48,019 INFO L132 encePairwiseOnDemand]: 216/220 looper letters, 18 selfloop transitions, 8 changer transitions 0/47 dead transitions. [2020-10-16 05:12:48,019 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 47 transitions, 340 flow [2020-10-16 05:12:48,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 05:12:48,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 05:12:48,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 615 transitions. [2020-10-16 05:12:48,023 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6988636363636364 [2020-10-16 05:12:48,023 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 615 transitions. [2020-10-16 05:12:48,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 615 transitions. [2020-10-16 05:12:48,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:12:48,023 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 615 transitions. [2020-10-16 05:12:48,025 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 05:12:48,027 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 05:12:48,027 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 05:12:48,027 INFO L185 Difference]: Start difference. First operand has 52 places, 43 transitions, 268 flow. Second operand 4 states and 615 transitions. [2020-10-16 05:12:48,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 47 transitions, 340 flow [2020-10-16 05:12:48,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 47 transitions, 318 flow, removed 5 selfloop flow, removed 2 redundant places. [2020-10-16 05:12:48,035 INFO L241 Difference]: Finished difference. Result has 54 places, 43 transitions, 275 flow [2020-10-16 05:12:48,035 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=275, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2020-10-16 05:12:48,036 INFO L342 CegarLoopForPetriNet]: 37 programPoint places, 17 predicate places. [2020-10-16 05:12:48,036 INFO L481 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 275 flow [2020-10-16 05:12:48,036 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 05:12:48,036 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:12:48,036 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:12:48,036 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 05:12:48,036 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:12:48,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:12:48,037 INFO L82 PathProgramCache]: Analyzing trace with hash -2130827525, now seen corresponding path program 1 times [2020-10-16 05:12:48,037 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:12:48,043 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762851255] [2020-10-16 05:12:48,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:12:48,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:12:48,176 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-16 05:12:48,176 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762851255] [2020-10-16 05:12:48,177 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:12:48,177 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 05:12:48,178 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453021953] [2020-10-16 05:12:48,178 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 05:12:48,178 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:12:48,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 05:12:48,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 05:12:48,181 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 220 [2020-10-16 05:12:48,182 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 275 flow. Second operand 4 states. [2020-10-16 05:12:48,182 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:12:48,182 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 220 [2020-10-16 05:12:48,183 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:12:48,342 INFO L129 PetriNetUnfolder]: 234/503 cut-off events. [2020-10-16 05:12:48,342 INFO L130 PetriNetUnfolder]: For 997/1225 co-relation queries the response was YES. [2020-10-16 05:12:48,346 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1741 conditions, 503 events. 234/503 cut-off events. For 997/1225 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2759 event pairs, 97 based on Foata normal form. 61/510 useless extension candidates. Maximal degree in co-relation 1729. Up to 297 conditions per place. [2020-10-16 05:12:48,352 INFO L132 encePairwiseOnDemand]: 213/220 looper letters, 6 selfloop transitions, 12 changer transitions 14/62 dead transitions. [2020-10-16 05:12:48,353 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 62 transitions, 458 flow [2020-10-16 05:12:48,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 05:12:48,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 05:12:48,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 957 transitions. [2020-10-16 05:12:48,356 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.87 [2020-10-16 05:12:48,356 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 957 transitions. [2020-10-16 05:12:48,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 957 transitions. [2020-10-16 05:12:48,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:12:48,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 957 transitions. [2020-10-16 05:12:48,359 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 05:12:48,361 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 05:12:48,361 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 05:12:48,361 INFO L185 Difference]: Start difference. First operand has 54 places, 43 transitions, 275 flow. Second operand 5 states and 957 transitions. [2020-10-16 05:12:48,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 62 transitions, 458 flow [2020-10-16 05:12:48,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 62 transitions, 425 flow, removed 1 selfloop flow, removed 4 redundant places. [2020-10-16 05:12:48,367 INFO L241 Difference]: Finished difference. Result has 57 places, 48 transitions, 329 flow [2020-10-16 05:12:48,370 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=329, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2020-10-16 05:12:48,372 INFO L342 CegarLoopForPetriNet]: 37 programPoint places, 20 predicate places. [2020-10-16 05:12:48,372 INFO L481 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 329 flow [2020-10-16 05:12:48,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 05:12:48,372 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:12:48,372 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] [2020-10-16 05:12:48,373 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 05:12:48,373 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:12:48,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:12:48,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1643418674, now seen corresponding path program 1 times [2020-10-16 05:12:48,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:12:48,374 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329911202] [2020-10-16 05:12:48,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:12:48,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:12:48,487 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-16 05:12:48,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329911202] [2020-10-16 05:12:48,488 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:12:48,488 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 05:12:48,488 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768356517] [2020-10-16 05:12:48,489 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 05:12:48,489 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:12:48,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 05:12:48,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 05:12:48,491 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 220 [2020-10-16 05:12:48,491 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 329 flow. Second operand 7 states. [2020-10-16 05:12:48,492 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:12:48,492 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 220 [2020-10-16 05:12:48,492 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:12:48,654 INFO L129 PetriNetUnfolder]: 131/329 cut-off events. [2020-10-16 05:12:48,654 INFO L130 PetriNetUnfolder]: For 1143/1662 co-relation queries the response was YES. [2020-10-16 05:12:48,657 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1407 conditions, 329 events. 131/329 cut-off events. For 1143/1662 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1643 event pairs, 5 based on Foata normal form. 111/422 useless extension candidates. Maximal degree in co-relation 1393. Up to 192 conditions per place. [2020-10-16 05:12:48,660 INFO L132 encePairwiseOnDemand]: 213/220 looper letters, 2 selfloop transitions, 33 changer transitions 6/71 dead transitions. [2020-10-16 05:12:48,660 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 71 transitions, 603 flow [2020-10-16 05:12:48,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-16 05:12:48,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-16 05:12:48,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2096 transitions. [2020-10-16 05:12:48,667 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8661157024793389 [2020-10-16 05:12:48,667 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2096 transitions. [2020-10-16 05:12:48,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2096 transitions. [2020-10-16 05:12:48,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:12:48,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2096 transitions. [2020-10-16 05:12:48,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-16 05:12:48,677 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-16 05:12:48,677 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-16 05:12:48,677 INFO L185 Difference]: Start difference. First operand has 57 places, 48 transitions, 329 flow. Second operand 11 states and 2096 transitions. [2020-10-16 05:12:48,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 71 transitions, 603 flow [2020-10-16 05:12:48,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 71 transitions, 573 flow, removed 5 selfloop flow, removed 4 redundant places. [2020-10-16 05:12:48,684 INFO L241 Difference]: Finished difference. Result has 66 places, 65 transitions, 534 flow [2020-10-16 05:12:48,684 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=534, PETRI_PLACES=66, PETRI_TRANSITIONS=65} [2020-10-16 05:12:48,685 INFO L342 CegarLoopForPetriNet]: 37 programPoint places, 29 predicate places. [2020-10-16 05:12:48,685 INFO L481 AbstractCegarLoop]: Abstraction has has 66 places, 65 transitions, 534 flow [2020-10-16 05:12:48,685 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 05:12:48,685 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:12:48,686 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] [2020-10-16 05:12:48,686 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 05:12:48,686 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:12:48,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:12:48,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1609056613, now seen corresponding path program 1 times [2020-10-16 05:12:48,687 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:12:48,687 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78741970] [2020-10-16 05:12:48,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:12:48,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 05:12:48,739 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 05:12:48,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 05:12:48,790 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 05:12:48,835 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 05:12:48,836 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 05:12:48,836 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 05:12:48,899 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-16 05:12:48,899 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:12:48,899 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-16 05:12:48,899 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:12:48,900 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-16 05:12:48,900 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:12:48,900 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-16 05:12:48,900 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:12:48,900 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-16 05:12:48,900 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:12:48,901 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-16 05:12:48,901 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:12:48,904 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-16 05:12:48,904 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:12:48,904 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-16 05:12:48,905 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:12:48,905 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-16 05:12:48,905 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:12:48,905 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-16 05:12:48,905 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:12:48,905 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-16 05:12:48,905 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:12:48,905 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-16 05:12:48,906 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:12:48,906 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-16 05:12:48,906 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:12:48,906 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-16 05:12:48,906 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:12:48,906 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-16 05:12:48,907 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:12:48,907 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-16 05:12:48,907 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:12:48,910 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-16 05:12:48,910 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:12:48,910 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-16 05:12:48,910 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:12:48,911 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-16 05:12:48,911 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:12:48,911 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-16 05:12:48,911 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:12:48,911 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-16 05:12:48,911 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:12:48,911 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-16 05:12:48,912 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:12:48,912 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-16 05:12:48,912 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:12:48,913 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-16 05:12:48,913 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:12:48,913 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-16 05:12:48,913 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:12:48,913 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-16 05:12:48,913 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:12:48,914 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-16 05:12:48,914 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:12:48,914 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-16 05:12:48,914 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:12:48,915 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-16 05:12:48,915 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:12:48,916 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-16 05:12:48,916 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:12:49,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 05:12:49 BasicIcfg [2020-10-16 05:12:49,027 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 05:12:49,029 INFO L168 Benchmark]: Toolchain (without parser) took 14789.39 ms. Allocated memory was 252.2 MB in the beginning and 549.5 MB in the end (delta: 297.3 MB). Free memory was 204.0 MB in the beginning and 383.4 MB in the end (delta: -179.4 MB). Peak memory consumption was 117.9 MB. Max. memory is 14.2 GB. [2020-10-16 05:12:49,030 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 252.2 MB. Free memory was 227.7 MB in the beginning and 226.9 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 14.2 GB. [2020-10-16 05:12:49,031 INFO L168 Benchmark]: CACSL2BoogieTranslator took 824.50 ms. Allocated memory was 252.2 MB in the beginning and 316.7 MB in the end (delta: 64.5 MB). Free memory was 204.0 MB in the beginning and 262.1 MB in the end (delta: -58.1 MB). Peak memory consumption was 28.0 MB. Max. memory is 14.2 GB. [2020-10-16 05:12:49,031 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.83 ms. Allocated memory is still 316.7 MB. Free memory was 262.1 MB in the beginning and 259.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 05:12:49,032 INFO L168 Benchmark]: Boogie Preprocessor took 45.49 ms. Allocated memory is still 316.7 MB. Free memory was 259.6 MB in the beginning and 257.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 05:12:49,033 INFO L168 Benchmark]: RCFGBuilder took 2028.24 ms. Allocated memory was 316.7 MB in the beginning and 359.7 MB in the end (delta: 43.0 MB). Free memory was 257.0 MB in the beginning and 203.8 MB in the end (delta: 53.3 MB). Peak memory consumption was 96.3 MB. Max. memory is 14.2 GB. [2020-10-16 05:12:49,034 INFO L168 Benchmark]: TraceAbstraction took 11828.38 ms. Allocated memory was 359.7 MB in the beginning and 549.5 MB in the end (delta: 189.8 MB). Free memory was 203.8 MB in the beginning and 383.4 MB in the end (delta: -179.7 MB). Peak memory consumption was 10.1 MB. Max. memory is 14.2 GB. [2020-10-16 05:12:49,037 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.22 ms. Allocated memory is still 252.2 MB. Free memory was 227.7 MB in the beginning and 226.9 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 824.50 ms. Allocated memory was 252.2 MB in the beginning and 316.7 MB in the end (delta: 64.5 MB). Free memory was 204.0 MB in the beginning and 262.1 MB in the end (delta: -58.1 MB). Peak memory consumption was 28.0 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 56.83 ms. Allocated memory is still 316.7 MB. Free memory was 262.1 MB in the beginning and 259.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 45.49 ms. Allocated memory is still 316.7 MB. Free memory was 259.6 MB in the beginning and 257.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2028.24 ms. Allocated memory was 316.7 MB in the beginning and 359.7 MB in the end (delta: 43.0 MB). Free memory was 257.0 MB in the beginning and 203.8 MB in the end (delta: 53.3 MB). Peak memory consumption was 96.3 MB. Max. memory is 14.2 GB. * TraceAbstraction took 11828.38 ms. Allocated memory was 359.7 MB in the beginning and 549.5 MB in the end (delta: 189.8 MB). Free memory was 203.8 MB in the beginning and 383.4 MB in the end (delta: -179.7 MB). Peak memory consumption was 10.1 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1034 VarBasedMoverChecksPositive, 81 VarBasedMoverChecksNegative, 30 SemBasedMoverChecksPositive, 51 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 201 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 7.4s, 123 PlacesBefore, 37 PlacesAfterwards, 111 TransitionsBefore, 25 TransitionsAfterwards, 1506 CoEnabledTransitionPairs, 8 FixpointIterations, 57 TrivialSequentialCompositions, 31 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 92 TotalNumberOfCompositions, 4481 MoverChecksTotal - CounterExampleResult [Line: 8]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L700] 0 int __unbuffered_cnt = 0; [L702] 0 int __unbuffered_p0_EAX = 0; [L703] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L704] 0 int __unbuffered_p0_EAX$mem_tmp; [L705] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L706] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L707] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L708] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L709] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L710] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L711] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L712] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L713] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L714] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L715] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L716] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L717] 0 int __unbuffered_p0_EAX$w_buff0; [L718] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L719] 0 int __unbuffered_p0_EAX$w_buff1; [L720] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L722] 0 int __unbuffered_p1_EAX = 0; [L724] 0 int __unbuffered_p2_EAX = 0; [L726] 0 int __unbuffered_p3_EAX = 0; [L728] 0 int a = 0; [L729] 0 _Bool a$flush_delayed; [L730] 0 int a$mem_tmp; [L731] 0 _Bool a$r_buff0_thd0; [L732] 0 _Bool a$r_buff0_thd1; [L733] 0 _Bool a$r_buff0_thd2; [L734] 0 _Bool a$r_buff0_thd3; [L735] 0 _Bool a$r_buff0_thd4; [L736] 0 _Bool a$r_buff1_thd0; [L737] 0 _Bool a$r_buff1_thd1; [L738] 0 _Bool a$r_buff1_thd2; [L739] 0 _Bool a$r_buff1_thd3; [L740] 0 _Bool a$r_buff1_thd4; [L741] 0 _Bool a$read_delayed; [L742] 0 int *a$read_delayed_var; [L743] 0 int a$w_buff0; [L744] 0 _Bool a$w_buff0_used; [L745] 0 int a$w_buff1; [L746] 0 _Bool a$w_buff1_used; [L747] 0 _Bool main$tmp_guard0; [L748] 0 _Bool main$tmp_guard1; [L750] 0 int x = 0; [L752] 0 int y = 0; [L754] 0 int z = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2725; [L850] FCALL, FORK 0 pthread_create(&t2725, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={7:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z=0] [L851] 0 pthread_t t2726; [L852] FCALL, FORK 0 pthread_create(&t2726, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={7:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z=0] [L853] 0 pthread_t t2727; [L854] FCALL, FORK 0 pthread_create(&t2727, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={7:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z=0] [L855] 0 pthread_t t2728; [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 a$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(a) [L764] 1 a$mem_tmp = a [L765] EXPR 1 !a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff1) [L765] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff1 [L765] EXPR 1 !a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff1) [L765] 1 a = !a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff1) [L766] EXPR 1 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff0)) [L766] EXPR 1 !a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff0) [L766] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff0 [L766] EXPR 1 !a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff0) [L766] EXPR 1 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff0)) [L766] 1 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff0)) [L767] EXPR 1 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff1 : a$w_buff1)) [L767] EXPR 1 !a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff1 : a$w_buff1) [L767] EXPR 1 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff1 : a$w_buff1)) [L767] 1 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff1 : a$w_buff1)) [L768] EXPR 1 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used)) [L768] EXPR 1 !a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used) [L768] EXPR 1 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used)) [L768] 1 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used)) [L769] EXPR 1 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L769] EXPR 1 !a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L769] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0 [L769] EXPR 1 !a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L769] EXPR 1 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L769] 1 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] EXPR 1 weak$$choice2 ? a$r_buff0_thd1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$r_buff0_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1)) [L770] EXPR 1 !a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$r_buff0_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1) [L770] EXPR 1 weak$$choice2 ? a$r_buff0_thd1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$r_buff0_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1)) [L770] 1 a$r_buff0_thd1 = weak$$choice2 ? a$r_buff0_thd1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$r_buff0_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1)) [L771] EXPR 1 weak$$choice2 ? a$r_buff1_thd1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$r_buff1_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L771] 1 a$r_buff1_thd1 = weak$$choice2 ? a$r_buff1_thd1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$r_buff1_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L773] 1 __unbuffered_p0_EAX$read_delayed_var = &a [L774] EXPR 1 \read(a) [L774] 1 __unbuffered_p0_EAX = a [L775] EXPR 1 a$flush_delayed ? a$mem_tmp : a [L775] EXPR 1 \read(a) [L775] EXPR 1 a$flush_delayed ? a$mem_tmp : a [L775] 1 a = a$flush_delayed ? a$mem_tmp : a [L776] 1 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={7:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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$$choice1=0, weak$$choice2=255, x=0, y=0, z=0] [L779] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={7:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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$$choice1=0, weak$$choice2=255, x=1, y=0, z=0] [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 1 return 0; [L791] 2 __unbuffered_p1_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={7:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=255, x=1, y=0, z=0] [L794] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={7:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=255, x=1, y=1, z=0] [L806] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, a={7:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=255, x=1, y=1, z=0] [L809] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, a={7:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=255, x=1, y=1, z=1] [L856] FCALL, FORK 0 pthread_create(&t2728, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, a={7:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=255, x=1, y=1, z=1] [L821] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a={7:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=255, x=1, y=1, z=1] [L824] 4 a = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a={7:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=255, x=1, y=1, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L814] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L816] 3 return 0; [L827] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L827] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L827] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L827] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L828] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L828] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L829] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L829] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L830] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L830] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L831] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L831] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L834] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 4 return 0; [L858] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L4] COND FALSE 0 !(!cond) [L862] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L862] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L862] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L862] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L863] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L863] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L864] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L864] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L865] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L865] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L866] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L866] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L869] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L870] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L870] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L870] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L870] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L871] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p3_EAX == 1) [L8] COND TRUE 0 !expression [L8] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a={7:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=255, x=1, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 127 locations, 1 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: 11.4s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.5s, HoareTripleCheckerStatistics: 31 SDtfs, 33 SDslu, 29 SDs, 0 SdLazy, 343 SolverSat, 80 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=534occurred 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.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 197 NumberOfCodeBlocks, 197 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 162 ConstructedInterpolants, 0 QuantifiedInterpolants, 35898 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...