/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix055_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-11 18:25:28,939 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-11 18:25:28,942 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-11 18:25:28,984 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-11 18:25:28,985 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-11 18:25:28,993 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-11 18:25:28,996 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-11 18:25:29,000 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-11 18:25:29,002 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-11 18:25:29,005 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-11 18:25:29,006 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-11 18:25:29,007 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-11 18:25:29,007 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-11 18:25:29,010 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-11 18:25:29,012 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-11 18:25:29,014 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-11 18:25:29,015 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-11 18:25:29,016 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-11 18:25:29,017 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-11 18:25:29,027 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-11 18:25:29,029 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-11 18:25:29,030 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-11 18:25:29,031 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-11 18:25:29,031 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-11 18:25:29,040 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-11 18:25:29,040 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-11 18:25:29,041 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-11 18:25:29,041 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-11 18:25:29,042 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-11 18:25:29,047 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-11 18:25:29,047 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-11 18:25:29,047 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-11 18:25:29,048 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-11 18:25:29,048 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-11 18:25:29,052 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-11 18:25:29,052 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-11 18:25:29,053 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-11 18:25:29,053 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-11 18:25:29,053 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-11 18:25:29,054 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-11 18:25:29,056 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-11 18:25:29,058 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf [2020-10-11 18:25:29,099 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-11 18:25:29,099 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-11 18:25:29,101 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-11 18:25:29,101 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-11 18:25:29,101 INFO L138 SettingsManager]: * Use SBE=true [2020-10-11 18:25:29,101 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-11 18:25:29,102 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-11 18:25:29,102 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-11 18:25:29,102 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-11 18:25:29,102 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-11 18:25:29,103 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-11 18:25:29,104 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-11 18:25:29,104 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-11 18:25:29,104 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-11 18:25:29,104 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-11 18:25:29,105 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-11 18:25:29,105 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-11 18:25:29,105 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-11 18:25:29,105 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-11 18:25:29,105 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-11 18:25:29,106 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-11 18:25:29,106 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 18:25:29,106 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-11 18:25:29,106 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-11 18:25:29,107 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-11 18:25:29,107 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-11 18:25:29,107 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-11 18:25:29,107 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-10-11 18:25:29,107 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-11 18:25:29,107 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-11 18:25:29,410 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-11 18:25:29,421 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-11 18:25:29,424 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-11 18:25:29,426 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-11 18:25:29,426 INFO L275 PluginConnector]: CDTParser initialized [2020-10-11 18:25:29,427 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_tso.opt.i [2020-10-11 18:25:29,499 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10dcf0b66/3a812b2f73ef43fa931ba89864b0183b/FLAG4522c9113 [2020-10-11 18:25:30,032 INFO L306 CDTParser]: Found 1 translation units. [2020-10-11 18:25:30,033 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_tso.opt.i [2020-10-11 18:25:30,053 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10dcf0b66/3a812b2f73ef43fa931ba89864b0183b/FLAG4522c9113 [2020-10-11 18:25:30,322 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10dcf0b66/3a812b2f73ef43fa931ba89864b0183b [2020-10-11 18:25:30,331 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-11 18:25:30,333 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-11 18:25:30,334 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-11 18:25:30,334 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-11 18:25:30,338 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-11 18:25:30,339 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:25:30" (1/1) ... [2020-10-11 18:25:30,342 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6183d166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:25:30, skipping insertion in model container [2020-10-11 18:25:30,342 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:25:30" (1/1) ... [2020-10-11 18:25:30,349 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-11 18:25:30,398 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-11 18:25:30,951 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:25:30,964 INFO L203 MainTranslator]: Completed pre-run [2020-10-11 18:25:31,024 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:25:31,100 INFO L208 MainTranslator]: Completed translation [2020-10-11 18:25:31,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:25:31 WrapperNode [2020-10-11 18:25:31,101 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-11 18:25:31,102 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-11 18:25:31,102 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-11 18:25:31,102 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-11 18:25:31,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:25:31" (1/1) ... [2020-10-11 18:25:31,131 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:25:31" (1/1) ... [2020-10-11 18:25:31,168 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-11 18:25:31,168 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-11 18:25:31,168 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-11 18:25:31,168 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-11 18:25:31,178 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:25:31" (1/1) ... [2020-10-11 18:25:31,178 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:25:31" (1/1) ... [2020-10-11 18:25:31,183 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:25:31" (1/1) ... [2020-10-11 18:25:31,183 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:25:31" (1/1) ... [2020-10-11 18:25:31,193 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:25:31" (1/1) ... [2020-10-11 18:25:31,198 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:25:31" (1/1) ... [2020-10-11 18:25:31,201 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:25:31" (1/1) ... [2020-10-11 18:25:31,207 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-11 18:25:31,207 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-11 18:25:31,208 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-11 18:25:31,208 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-11 18:25:31,208 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:25:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 18:25:31,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-11 18:25:31,273 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-11 18:25:31,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-11 18:25:31,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-11 18:25:31,273 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-11 18:25:31,273 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-11 18:25:31,274 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-11 18:25:31,274 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-11 18:25:31,274 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-11 18:25:31,274 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-11 18:25:31,274 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-11 18:25:31,274 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-11 18:25:31,275 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-11 18:25:31,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-11 18:25:31,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-11 18:25:31,277 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-11 18:25:33,154 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-11 18:25:33,155 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-11 18:25:33,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:25:33 BoogieIcfgContainer [2020-10-11 18:25:33,157 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-11 18:25:33,158 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-11 18:25:33,159 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-11 18:25:33,162 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-11 18:25:33,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:25:30" (1/3) ... [2020-10-11 18:25:33,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6291b4ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:25:33, skipping insertion in model container [2020-10-11 18:25:33,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:25:31" (2/3) ... [2020-10-11 18:25:33,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6291b4ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:25:33, skipping insertion in model container [2020-10-11 18:25:33,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:25:33" (3/3) ... [2020-10-11 18:25:33,166 INFO L111 eAbstractionObserver]: Analyzing ICFG mix055_tso.opt.i [2020-10-11 18:25:33,178 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-11 18:25:33,186 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-11 18:25:33,187 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-11 18:25:33,218 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,218 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,218 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,218 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,219 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,219 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,220 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,220 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,221 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,221 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,221 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,221 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,221 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,222 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,222 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,222 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,222 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,223 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,223 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,223 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,223 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,224 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,224 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,225 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,225 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,225 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,225 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,226 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,226 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,226 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,226 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,227 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,227 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,227 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,227 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,227 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,228 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,228 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,228 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,229 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,233 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,233 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,233 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,234 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,234 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,234 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,234 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,235 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,235 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,235 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,241 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,241 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,241 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,242 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,242 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,242 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,242 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,243 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,243 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,243 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,243 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,243 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,246 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,246 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,247 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,247 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,248 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,249 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,249 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,249 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:33,269 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-11 18:25:33,295 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 18:25:33,295 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-11 18:25:33,296 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 18:25:33,296 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 18:25:33,296 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 18:25:33,296 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 18:25:33,296 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 18:25:33,296 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 18:25:33,313 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 119 places, 108 transitions, 236 flow [2020-10-11 18:25:33,367 INFO L129 PetriNetUnfolder]: 2/104 cut-off events. [2020-10-11 18:25:33,367 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:25:33,373 INFO L80 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2020-10-11 18:25:33,373 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 108 transitions, 236 flow [2020-10-11 18:25:33,386 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 104 transitions, 220 flow [2020-10-11 18:25:33,407 INFO L129 PetriNetUnfolder]: 0/68 cut-off events. [2020-10-11 18:25:33,407 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:25:33,407 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:25:33,409 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:25:33,409 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:25:33,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:25:33,416 INFO L82 PathProgramCache]: Analyzing trace with hash -555940511, now seen corresponding path program 1 times [2020-10-11 18:25:33,429 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:25:33,429 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623251980] [2020-10-11 18:25:33,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:25:33,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:25:33,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:25:33,775 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623251980] [2020-10-11 18:25:33,777 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:25:33,780 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 18:25:33,781 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967776273] [2020-10-11 18:25:33,793 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 18:25:33,794 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:25:33,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 18:25:33,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 18:25:33,941 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 108 [2020-10-11 18:25:33,948 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 104 transitions, 220 flow. Second operand 3 states. [2020-10-11 18:25:33,948 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:25:33,948 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 108 [2020-10-11 18:25:33,950 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:25:34,029 INFO L129 PetriNetUnfolder]: 0/101 cut-off events. [2020-10-11 18:25:34,029 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:25:34,030 INFO L80 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 101 events. 0/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 4/103 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2020-10-11 18:25:34,032 INFO L132 encePairwiseOnDemand]: 103/108 looper letters, 0 selfloop transitions, 2 changer transitions 13/101 dead transitions. [2020-10-11 18:25:34,032 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 101 transitions, 218 flow [2020-10-11 18:25:34,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 18:25:34,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-11 18:25:34,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 316 transitions. [2020-10-11 18:25:34,052 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9753086419753086 [2020-10-11 18:25:34,053 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 316 transitions. [2020-10-11 18:25:34,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 316 transitions. [2020-10-11 18:25:34,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:25:34,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 316 transitions. [2020-10-11 18:25:34,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-11 18:25:34,071 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-11 18:25:34,071 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-11 18:25:34,074 INFO L185 Difference]: Start difference. First operand has 115 places, 104 transitions, 220 flow. Second operand 3 states and 316 transitions. [2020-10-11 18:25:34,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 101 transitions, 218 flow [2020-10-11 18:25:34,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 101 transitions, 214 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-11 18:25:34,084 INFO L241 Difference]: Finished difference. Result has 112 places, 88 transitions, 188 flow [2020-10-11 18:25:34,089 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=188, PETRI_PLACES=112, PETRI_TRANSITIONS=88} [2020-10-11 18:25:34,090 INFO L341 CegarLoopForPetriNet]: 115 programPoint places, -3 predicate places. [2020-10-11 18:25:34,091 INFO L481 AbstractCegarLoop]: Abstraction has has 112 places, 88 transitions, 188 flow [2020-10-11 18:25:34,091 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 18:25:34,091 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:25:34,091 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:25:34,092 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-11 18:25:34,092 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:25:34,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:25:34,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1579175048, now seen corresponding path program 1 times [2020-10-11 18:25:34,093 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:25:34,093 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201743879] [2020-10-11 18:25:34,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:25:34,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:25:34,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-11 18:25:34,487 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201743879] [2020-10-11 18:25:34,488 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:25:34,488 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 18:25:34,488 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261629886] [2020-10-11 18:25:34,491 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 18:25:34,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:25:34,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 18:25:34,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-10-11 18:25:34,960 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 108 [2020-10-11 18:25:34,961 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 88 transitions, 188 flow. Second operand 10 states. [2020-10-11 18:25:34,961 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:25:34,961 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 108 [2020-10-11 18:25:34,962 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:25:35,375 INFO L129 PetriNetUnfolder]: 97/314 cut-off events. [2020-10-11 18:25:35,375 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-11 18:25:35,378 INFO L80 FinitePrefix]: Finished finitePrefix Result has 544 conditions, 314 events. 97/314 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1357 event pairs, 40 based on Foata normal form. 9/317 useless extension candidates. Maximal degree in co-relation 496. Up to 106 conditions per place. [2020-10-11 18:25:35,380 INFO L132 encePairwiseOnDemand]: 97/108 looper letters, 13 selfloop transitions, 8 changer transitions 35/129 dead transitions. [2020-10-11 18:25:35,381 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 129 transitions, 396 flow [2020-10-11 18:25:35,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 18:25:35,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-11 18:25:35,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1409 transitions. [2020-10-11 18:25:35,388 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8697530864197531 [2020-10-11 18:25:35,389 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1409 transitions. [2020-10-11 18:25:35,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1409 transitions. [2020-10-11 18:25:35,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:25:35,391 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1409 transitions. [2020-10-11 18:25:35,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-11 18:25:35,429 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-11 18:25:35,430 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-11 18:25:35,430 INFO L185 Difference]: Start difference. First operand has 112 places, 88 transitions, 188 flow. Second operand 15 states and 1409 transitions. [2020-10-11 18:25:35,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 129 transitions, 396 flow [2020-10-11 18:25:35,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 129 transitions, 378 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-11 18:25:35,436 INFO L241 Difference]: Finished difference. Result has 122 places, 92 transitions, 256 flow [2020-10-11 18:25:35,436 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=256, PETRI_PLACES=122, PETRI_TRANSITIONS=92} [2020-10-11 18:25:35,437 INFO L341 CegarLoopForPetriNet]: 115 programPoint places, 7 predicate places. [2020-10-11 18:25:35,437 INFO L481 AbstractCegarLoop]: Abstraction has has 122 places, 92 transitions, 256 flow [2020-10-11 18:25:35,438 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 18:25:35,438 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:25:35,438 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:25:35,438 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-11 18:25:35,439 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:25:35,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:25:35,439 INFO L82 PathProgramCache]: Analyzing trace with hash 66107549, now seen corresponding path program 1 times [2020-10-11 18:25:35,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:25:35,440 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463320782] [2020-10-11 18:25:35,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:25:35,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:25:35,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:25:35,642 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463320782] [2020-10-11 18:25:35,642 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:25:35,643 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:25:35,643 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669119651] [2020-10-11 18:25:35,643 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:25:35,644 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:25:35,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:25:35,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:25:35,827 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 108 [2020-10-11 18:25:35,827 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 92 transitions, 256 flow. Second operand 6 states. [2020-10-11 18:25:35,827 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:25:35,827 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 108 [2020-10-11 18:25:35,828 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:25:36,023 INFO L129 PetriNetUnfolder]: 126/488 cut-off events. [2020-10-11 18:25:36,024 INFO L130 PetriNetUnfolder]: For 672/695 co-relation queries the response was YES. [2020-10-11 18:25:36,029 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1132 conditions, 488 events. 126/488 cut-off events. For 672/695 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2977 event pairs, 55 based on Foata normal form. 16/484 useless extension candidates. Maximal degree in co-relation 1072. Up to 104 conditions per place. [2020-10-11 18:25:36,032 INFO L132 encePairwiseOnDemand]: 101/108 looper letters, 16 selfloop transitions, 14 changer transitions 0/113 dead transitions. [2020-10-11 18:25:36,032 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 113 transitions, 386 flow [2020-10-11 18:25:36,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:25:36,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:25:36,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 905 transitions. [2020-10-11 18:25:36,036 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9310699588477366 [2020-10-11 18:25:36,036 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 905 transitions. [2020-10-11 18:25:36,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 905 transitions. [2020-10-11 18:25:36,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:25:36,037 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 905 transitions. [2020-10-11 18:25:36,039 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:25:36,041 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:25:36,041 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:25:36,041 INFO L185 Difference]: Start difference. First operand has 122 places, 92 transitions, 256 flow. Second operand 9 states and 905 transitions. [2020-10-11 18:25:36,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 113 transitions, 386 flow [2020-10-11 18:25:36,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 113 transitions, 368 flow, removed 7 selfloop flow, removed 5 redundant places. [2020-10-11 18:25:36,049 INFO L241 Difference]: Finished difference. Result has 121 places, 105 transitions, 364 flow [2020-10-11 18:25:36,050 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=364, PETRI_PLACES=121, PETRI_TRANSITIONS=105} [2020-10-11 18:25:36,050 INFO L341 CegarLoopForPetriNet]: 115 programPoint places, 6 predicate places. [2020-10-11 18:25:36,050 INFO L481 AbstractCegarLoop]: Abstraction has has 121 places, 105 transitions, 364 flow [2020-10-11 18:25:36,050 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:25:36,050 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:25:36,051 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:25:36,051 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-11 18:25:36,051 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:25:36,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:25:36,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1997360370, now seen corresponding path program 1 times [2020-10-11 18:25:36,052 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:25:36,052 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010802332] [2020-10-11 18:25:36,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:25:36,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:25:36,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:25:36,339 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010802332] [2020-10-11 18:25:36,339 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:25:36,339 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 18:25:36,340 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943510595] [2020-10-11 18:25:36,341 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 18:25:36,341 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:25:36,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 18:25:36,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-10-11 18:25:36,804 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 108 [2020-10-11 18:25:36,805 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 105 transitions, 364 flow. Second operand 10 states. [2020-10-11 18:25:36,805 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:25:36,806 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 108 [2020-10-11 18:25:36,806 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:25:37,511 INFO L129 PetriNetUnfolder]: 320/904 cut-off events. [2020-10-11 18:25:37,511 INFO L130 PetriNetUnfolder]: For 2290/2368 co-relation queries the response was YES. [2020-10-11 18:25:37,522 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2875 conditions, 904 events. 320/904 cut-off events. For 2290/2368 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 6270 event pairs, 57 based on Foata normal form. 18/895 useless extension candidates. Maximal degree in co-relation 2810. Up to 259 conditions per place. [2020-10-11 18:25:37,527 INFO L132 encePairwiseOnDemand]: 98/108 looper letters, 20 selfloop transitions, 8 changer transitions 54/157 dead transitions. [2020-10-11 18:25:37,527 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 157 transitions, 900 flow [2020-10-11 18:25:37,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 18:25:37,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-11 18:25:37,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1403 transitions. [2020-10-11 18:25:37,532 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8660493827160494 [2020-10-11 18:25:37,533 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1403 transitions. [2020-10-11 18:25:37,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1403 transitions. [2020-10-11 18:25:37,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:25:37,534 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1403 transitions. [2020-10-11 18:25:37,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-11 18:25:37,540 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-11 18:25:37,541 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-11 18:25:37,541 INFO L185 Difference]: Start difference. First operand has 121 places, 105 transitions, 364 flow. Second operand 15 states and 1403 transitions. [2020-10-11 18:25:37,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 157 transitions, 900 flow [2020-10-11 18:25:37,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 157 transitions, 900 flow, removed 0 selfloop flow, removed 0 redundant places. [2020-10-11 18:25:37,556 INFO L241 Difference]: Finished difference. Result has 145 places, 96 transitions, 344 flow [2020-10-11 18:25:37,556 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=344, PETRI_PLACES=145, PETRI_TRANSITIONS=96} [2020-10-11 18:25:37,556 INFO L341 CegarLoopForPetriNet]: 115 programPoint places, 30 predicate places. [2020-10-11 18:25:37,557 INFO L481 AbstractCegarLoop]: Abstraction has has 145 places, 96 transitions, 344 flow [2020-10-11 18:25:37,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 18:25:37,557 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:25:37,557 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:25:37,558 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-11 18:25:37,558 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:25:37,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:25:37,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1889258635, now seen corresponding path program 1 times [2020-10-11 18:25:37,558 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:25:37,559 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016266143] [2020-10-11 18:25:37,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:25:37,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:25:37,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:25:37,896 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016266143] [2020-10-11 18:25:37,897 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:25:37,897 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 18:25:37,897 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240402006] [2020-10-11 18:25:37,897 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 18:25:37,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:25:37,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 18:25:37,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-10-11 18:25:39,249 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 108 [2020-10-11 18:25:39,251 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 96 transitions, 344 flow. Second operand 12 states. [2020-10-11 18:25:39,251 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:25:39,251 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 108 [2020-10-11 18:25:39,252 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:25:39,642 INFO L129 PetriNetUnfolder]: 116/406 cut-off events. [2020-10-11 18:25:39,642 INFO L130 PetriNetUnfolder]: For 1960/1972 co-relation queries the response was YES. [2020-10-11 18:25:39,648 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1587 conditions, 406 events. 116/406 cut-off events. For 1960/1972 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1958 event pairs, 36 based on Foata normal form. 9/391 useless extension candidates. Maximal degree in co-relation 1507. Up to 149 conditions per place. [2020-10-11 18:25:39,655 INFO L132 encePairwiseOnDemand]: 97/108 looper letters, 21 selfloop transitions, 11 changer transitions 13/119 dead transitions. [2020-10-11 18:25:39,657 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 119 transitions, 660 flow [2020-10-11 18:25:39,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 18:25:39,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-11 18:25:39,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1199 transitions. [2020-10-11 18:25:39,663 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.853988603988604 [2020-10-11 18:25:39,663 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1199 transitions. [2020-10-11 18:25:39,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1199 transitions. [2020-10-11 18:25:39,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:25:39,665 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1199 transitions. [2020-10-11 18:25:39,667 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-11 18:25:39,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-11 18:25:39,671 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-11 18:25:39,672 INFO L185 Difference]: Start difference. First operand has 145 places, 96 transitions, 344 flow. Second operand 13 states and 1199 transitions. [2020-10-11 18:25:39,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 119 transitions, 660 flow [2020-10-11 18:25:39,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 119 transitions, 560 flow, removed 42 selfloop flow, removed 13 redundant places. [2020-10-11 18:25:39,684 INFO L241 Difference]: Finished difference. Result has 136 places, 99 transitions, 358 flow [2020-10-11 18:25:39,684 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=358, PETRI_PLACES=136, PETRI_TRANSITIONS=99} [2020-10-11 18:25:39,685 INFO L341 CegarLoopForPetriNet]: 115 programPoint places, 21 predicate places. [2020-10-11 18:25:39,685 INFO L481 AbstractCegarLoop]: Abstraction has has 136 places, 99 transitions, 358 flow [2020-10-11 18:25:39,685 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 18:25:39,685 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:25:39,685 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:25:39,686 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-11 18:25:39,686 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:25:39,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:25:39,686 INFO L82 PathProgramCache]: Analyzing trace with hash 993327047, now seen corresponding path program 2 times [2020-10-11 18:25:39,687 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:25:39,687 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128885973] [2020-10-11 18:25:39,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:25:39,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:25:40,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:25:40,068 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128885973] [2020-10-11 18:25:40,068 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:25:40,068 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-10-11 18:25:40,068 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817272166] [2020-10-11 18:25:40,069 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-11 18:25:40,069 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:25:40,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-11 18:25:40,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2020-10-11 18:25:42,168 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 108 [2020-10-11 18:25:42,169 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 99 transitions, 358 flow. Second operand 14 states. [2020-10-11 18:25:42,170 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:25:42,170 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 108 [2020-10-11 18:25:42,170 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:25:42,484 INFO L129 PetriNetUnfolder]: 102/373 cut-off events. [2020-10-11 18:25:42,484 INFO L130 PetriNetUnfolder]: For 1405/1447 co-relation queries the response was YES. [2020-10-11 18:25:42,489 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1336 conditions, 373 events. 102/373 cut-off events. For 1405/1447 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1690 event pairs, 35 based on Foata normal form. 16/368 useless extension candidates. Maximal degree in co-relation 1255. Up to 139 conditions per place. [2020-10-11 18:25:42,493 INFO L132 encePairwiseOnDemand]: 96/108 looper letters, 16 selfloop transitions, 12 changer transitions 13/113 dead transitions. [2020-10-11 18:25:42,493 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 113 transitions, 577 flow [2020-10-11 18:25:42,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 18:25:42,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-11 18:25:42,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1343 transitions. [2020-10-11 18:25:42,498 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8290123456790124 [2020-10-11 18:25:42,498 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1343 transitions. [2020-10-11 18:25:42,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1343 transitions. [2020-10-11 18:25:42,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:25:42,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1343 transitions. [2020-10-11 18:25:42,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-11 18:25:42,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-11 18:25:42,505 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-11 18:25:42,506 INFO L185 Difference]: Start difference. First operand has 136 places, 99 transitions, 358 flow. Second operand 15 states and 1343 transitions. [2020-10-11 18:25:42,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 113 transitions, 577 flow [2020-10-11 18:25:42,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 113 transitions, 518 flow, removed 22 selfloop flow, removed 10 redundant places. [2020-10-11 18:25:42,512 INFO L241 Difference]: Finished difference. Result has 141 places, 99 transitions, 367 flow [2020-10-11 18:25:42,513 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=367, PETRI_PLACES=141, PETRI_TRANSITIONS=99} [2020-10-11 18:25:42,513 INFO L341 CegarLoopForPetriNet]: 115 programPoint places, 26 predicate places. [2020-10-11 18:25:42,513 INFO L481 AbstractCegarLoop]: Abstraction has has 141 places, 99 transitions, 367 flow [2020-10-11 18:25:42,514 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-11 18:25:42,514 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:25:42,514 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:25:42,514 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-11 18:25:42,514 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:25:42,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:25:42,515 INFO L82 PathProgramCache]: Analyzing trace with hash 190225414, now seen corresponding path program 1 times [2020-10-11 18:25:42,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:25:42,515 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217623755] [2020-10-11 18:25:42,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:25:42,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:25:42,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:25:42,639 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217623755] [2020-10-11 18:25:42,639 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:25:42,640 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:25:42,640 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175483715] [2020-10-11 18:25:42,640 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:25:42,640 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:25:42,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:25:42,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:25:42,782 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 108 [2020-10-11 18:25:42,783 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 99 transitions, 367 flow. Second operand 6 states. [2020-10-11 18:25:42,783 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:25:42,783 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 108 [2020-10-11 18:25:42,783 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:25:43,255 INFO L129 PetriNetUnfolder]: 770/1754 cut-off events. [2020-10-11 18:25:43,256 INFO L130 PetriNetUnfolder]: For 4030/4039 co-relation queries the response was YES. [2020-10-11 18:25:43,275 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4963 conditions, 1754 events. 770/1754 cut-off events. For 4030/4039 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 13031 event pairs, 116 based on Foata normal form. 32/1574 useless extension candidates. Maximal degree in co-relation 4884. Up to 471 conditions per place. [2020-10-11 18:25:43,290 INFO L132 encePairwiseOnDemand]: 98/108 looper letters, 23 selfloop transitions, 19 changer transitions 0/130 dead transitions. [2020-10-11 18:25:43,290 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 130 transitions, 513 flow [2020-10-11 18:25:43,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:25:43,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:25:43,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 890 transitions. [2020-10-11 18:25:43,293 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9156378600823045 [2020-10-11 18:25:43,293 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 890 transitions. [2020-10-11 18:25:43,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 890 transitions. [2020-10-11 18:25:43,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:25:43,295 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 890 transitions. [2020-10-11 18:25:43,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:25:43,299 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:25:43,299 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:25:43,299 INFO L185 Difference]: Start difference. First operand has 141 places, 99 transitions, 367 flow. Second operand 9 states and 890 transitions. [2020-10-11 18:25:43,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 130 transitions, 513 flow [2020-10-11 18:25:43,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 130 transitions, 470 flow, removed 12 selfloop flow, removed 16 redundant places. [2020-10-11 18:25:43,313 INFO L241 Difference]: Finished difference. Result has 132 places, 116 transitions, 458 flow [2020-10-11 18:25:43,314 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=458, PETRI_PLACES=132, PETRI_TRANSITIONS=116} [2020-10-11 18:25:43,314 INFO L341 CegarLoopForPetriNet]: 115 programPoint places, 17 predicate places. [2020-10-11 18:25:43,314 INFO L481 AbstractCegarLoop]: Abstraction has has 132 places, 116 transitions, 458 flow [2020-10-11 18:25:43,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:25:43,315 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:25:43,315 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:25:43,315 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-11 18:25:43,315 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:25:43,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:25:43,316 INFO L82 PathProgramCache]: Analyzing trace with hash 962553092, now seen corresponding path program 1 times [2020-10-11 18:25:43,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:25:43,316 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557441948] [2020-10-11 18:25:43,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:25:43,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:25:43,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:25:43,444 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557441948] [2020-10-11 18:25:43,444 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:25:43,444 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:25:43,445 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574981983] [2020-10-11 18:25:43,445 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:25:43,446 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:25:43,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:25:43,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:25:43,666 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 108 [2020-10-11 18:25:43,667 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 116 transitions, 458 flow. Second operand 7 states. [2020-10-11 18:25:43,667 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:25:43,667 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 108 [2020-10-11 18:25:43,668 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:25:44,160 INFO L129 PetriNetUnfolder]: 665/1538 cut-off events. [2020-10-11 18:25:44,160 INFO L130 PetriNetUnfolder]: For 4273/5232 co-relation queries the response was YES. [2020-10-11 18:25:44,178 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5585 conditions, 1538 events. 665/1538 cut-off events. For 4273/5232 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 11282 event pairs, 43 based on Foata normal form. 83/1449 useless extension candidates. Maximal degree in co-relation 5514. Up to 653 conditions per place. [2020-10-11 18:25:44,191 INFO L132 encePairwiseOnDemand]: 98/108 looper letters, 25 selfloop transitions, 37 changer transitions 0/150 dead transitions. [2020-10-11 18:25:44,191 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 150 transitions, 811 flow [2020-10-11 18:25:44,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 18:25:44,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-11 18:25:44,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1188 transitions. [2020-10-11 18:25:44,195 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9166666666666666 [2020-10-11 18:25:44,196 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1188 transitions. [2020-10-11 18:25:44,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1188 transitions. [2020-10-11 18:25:44,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:25:44,197 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1188 transitions. [2020-10-11 18:25:44,199 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-11 18:25:44,202 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-11 18:25:44,202 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-11 18:25:44,202 INFO L185 Difference]: Start difference. First operand has 132 places, 116 transitions, 458 flow. Second operand 12 states and 1188 transitions. [2020-10-11 18:25:44,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 150 transitions, 811 flow [2020-10-11 18:25:44,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 150 transitions, 809 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-11 18:25:44,214 INFO L241 Difference]: Finished difference. Result has 147 places, 135 transitions, 736 flow [2020-10-11 18:25:44,214 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=736, PETRI_PLACES=147, PETRI_TRANSITIONS=135} [2020-10-11 18:25:44,215 INFO L341 CegarLoopForPetriNet]: 115 programPoint places, 32 predicate places. [2020-10-11 18:25:44,215 INFO L481 AbstractCegarLoop]: Abstraction has has 147 places, 135 transitions, 736 flow [2020-10-11 18:25:44,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:25:44,215 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:25:44,215 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:25:44,216 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-11 18:25:44,216 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:25:44,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:25:44,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1742917317, now seen corresponding path program 1 times [2020-10-11 18:25:44,217 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:25:44,217 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256163971] [2020-10-11 18:25:44,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:25:44,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:25:44,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:25:44,317 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256163971] [2020-10-11 18:25:44,318 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:25:44,318 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:25:44,318 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579114160] [2020-10-11 18:25:44,319 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:25:44,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:25:44,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:25:44,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:25:44,516 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 108 [2020-10-11 18:25:44,517 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 135 transitions, 736 flow. Second operand 6 states. [2020-10-11 18:25:44,517 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:25:44,518 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 108 [2020-10-11 18:25:44,518 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:25:44,944 INFO L129 PetriNetUnfolder]: 523/1760 cut-off events. [2020-10-11 18:25:44,944 INFO L130 PetriNetUnfolder]: For 7017/8758 co-relation queries the response was YES. [2020-10-11 18:25:44,963 INFO L80 FinitePrefix]: Finished finitePrefix Result has 6875 conditions, 1760 events. 523/1760 cut-off events. For 7017/8758 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 15401 event pairs, 76 based on Foata normal form. 54/1617 useless extension candidates. Maximal degree in co-relation 6797. Up to 577 conditions per place. [2020-10-11 18:25:44,975 INFO L132 encePairwiseOnDemand]: 102/108 looper letters, 14 selfloop transitions, 11 changer transitions 4/149 dead transitions. [2020-10-11 18:25:44,975 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 149 transitions, 868 flow [2020-10-11 18:25:44,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:25:44,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:25:44,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 899 transitions. [2020-10-11 18:25:44,979 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9248971193415638 [2020-10-11 18:25:44,979 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 899 transitions. [2020-10-11 18:25:44,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 899 transitions. [2020-10-11 18:25:44,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:25:44,980 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 899 transitions. [2020-10-11 18:25:44,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:25:44,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:25:44,984 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:25:44,984 INFO L185 Difference]: Start difference. First operand has 147 places, 135 transitions, 736 flow. Second operand 9 states and 899 transitions. [2020-10-11 18:25:44,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 149 transitions, 868 flow [2020-10-11 18:25:45,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 149 transitions, 765 flow, removed 42 selfloop flow, removed 4 redundant places. [2020-10-11 18:25:45,011 INFO L241 Difference]: Finished difference. Result has 158 places, 139 transitions, 718 flow [2020-10-11 18:25:45,011 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=639, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=718, PETRI_PLACES=158, PETRI_TRANSITIONS=139} [2020-10-11 18:25:45,011 INFO L341 CegarLoopForPetriNet]: 115 programPoint places, 43 predicate places. [2020-10-11 18:25:45,011 INFO L481 AbstractCegarLoop]: Abstraction has has 158 places, 139 transitions, 718 flow [2020-10-11 18:25:45,012 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:25:45,012 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:25:45,012 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:25:45,012 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-11 18:25:45,013 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:25:45,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:25:45,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1983790021, now seen corresponding path program 1 times [2020-10-11 18:25:45,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:25:45,014 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557017664] [2020-10-11 18:25:45,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:25:45,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:25:45,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-11 18:25:45,176 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557017664] [2020-10-11 18:25:45,176 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:25:45,176 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-11 18:25:45,177 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767658303] [2020-10-11 18:25:45,177 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 18:25:45,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:25:45,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 18:25:45,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-11 18:25:45,299 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 108 [2020-10-11 18:25:45,300 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 139 transitions, 718 flow. Second operand 8 states. [2020-10-11 18:25:45,300 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:25:45,300 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 108 [2020-10-11 18:25:45,300 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:25:45,906 INFO L129 PetriNetUnfolder]: 856/1899 cut-off events. [2020-10-11 18:25:45,907 INFO L130 PetriNetUnfolder]: For 14406/16417 co-relation queries the response was YES. [2020-10-11 18:25:45,927 INFO L80 FinitePrefix]: Finished finitePrefix Result has 9054 conditions, 1899 events. 856/1899 cut-off events. For 14406/16417 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 14729 event pairs, 8 based on Foata normal form. 127/1772 useless extension candidates. Maximal degree in co-relation 8970. Up to 767 conditions per place. [2020-10-11 18:25:45,940 INFO L132 encePairwiseOnDemand]: 98/108 looper letters, 19 selfloop transitions, 51 changer transitions 15/175 dead transitions. [2020-10-11 18:25:45,940 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 175 transitions, 1269 flow [2020-10-11 18:25:45,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 18:25:45,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-11 18:25:46,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1482 transitions. [2020-10-11 18:25:46,003 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9148148148148149 [2020-10-11 18:25:46,004 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1482 transitions. [2020-10-11 18:25:46,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1482 transitions. [2020-10-11 18:25:46,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:25:46,005 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1482 transitions. [2020-10-11 18:25:46,008 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-11 18:25:46,012 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-11 18:25:46,012 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-11 18:25:46,012 INFO L185 Difference]: Start difference. First operand has 158 places, 139 transitions, 718 flow. Second operand 15 states and 1482 transitions. [2020-10-11 18:25:46,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 175 transitions, 1269 flow [2020-10-11 18:25:46,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 175 transitions, 1237 flow, removed 13 selfloop flow, removed 2 redundant places. [2020-10-11 18:25:46,036 INFO L241 Difference]: Finished difference. Result has 175 places, 155 transitions, 1061 flow [2020-10-11 18:25:46,036 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1061, PETRI_PLACES=175, PETRI_TRANSITIONS=155} [2020-10-11 18:25:46,036 INFO L341 CegarLoopForPetriNet]: 115 programPoint places, 60 predicate places. [2020-10-11 18:25:46,036 INFO L481 AbstractCegarLoop]: Abstraction has has 175 places, 155 transitions, 1061 flow [2020-10-11 18:25:46,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 18:25:46,037 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:25:46,037 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:25:46,037 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-11 18:25:46,037 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:25:46,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:25:46,037 INFO L82 PathProgramCache]: Analyzing trace with hash -2068181787, now seen corresponding path program 1 times [2020-10-11 18:25:46,038 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:25:46,038 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458207414] [2020-10-11 18:25:46,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:25:46,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:25:46,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:25:46,159 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458207414] [2020-10-11 18:25:46,159 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:25:46,159 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:25:46,160 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040691992] [2020-10-11 18:25:46,160 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:25:46,160 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:25:46,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:25:46,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:25:46,424 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 108 [2020-10-11 18:25:46,425 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 155 transitions, 1061 flow. Second operand 7 states. [2020-10-11 18:25:46,425 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:25:46,425 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 108 [2020-10-11 18:25:46,425 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:25:47,090 INFO L129 PetriNetUnfolder]: 1159/3295 cut-off events. [2020-10-11 18:25:47,090 INFO L130 PetriNetUnfolder]: For 25199/27324 co-relation queries the response was YES. [2020-10-11 18:25:47,134 INFO L80 FinitePrefix]: Finished finitePrefix Result has 15191 conditions, 3295 events. 1159/3295 cut-off events. For 25199/27324 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 33293 event pairs, 14 based on Foata normal form. 12/2953 useless extension candidates. Maximal degree in co-relation 15100. Up to 1067 conditions per place. [2020-10-11 18:25:47,164 INFO L132 encePairwiseOnDemand]: 102/108 looper letters, 22 selfloop transitions, 8 changer transitions 2/174 dead transitions. [2020-10-11 18:25:47,164 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 174 transitions, 1293 flow [2020-10-11 18:25:47,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 18:25:47,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-11 18:25:47,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 697 transitions. [2020-10-11 18:25:47,167 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.921957671957672 [2020-10-11 18:25:47,167 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 697 transitions. [2020-10-11 18:25:47,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 697 transitions. [2020-10-11 18:25:47,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:25:47,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 697 transitions. [2020-10-11 18:25:47,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-11 18:25:47,173 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-11 18:25:47,173 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-11 18:25:47,174 INFO L185 Difference]: Start difference. First operand has 175 places, 155 transitions, 1061 flow. Second operand 7 states and 697 transitions. [2020-10-11 18:25:47,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 174 transitions, 1293 flow [2020-10-11 18:25:47,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 174 transitions, 1102 flow, removed 73 selfloop flow, removed 10 redundant places. [2020-10-11 18:25:47,504 INFO L241 Difference]: Finished difference. Result has 173 places, 162 transitions, 995 flow [2020-10-11 18:25:47,505 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=886, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=995, PETRI_PLACES=173, PETRI_TRANSITIONS=162} [2020-10-11 18:25:47,505 INFO L341 CegarLoopForPetriNet]: 115 programPoint places, 58 predicate places. [2020-10-11 18:25:47,505 INFO L481 AbstractCegarLoop]: Abstraction has has 173 places, 162 transitions, 995 flow [2020-10-11 18:25:47,506 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:25:47,506 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:25:47,506 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:25:47,506 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-11 18:25:47,506 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:25:47,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:25:47,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1405273917, now seen corresponding path program 2 times [2020-10-11 18:25:47,507 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:25:47,507 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842762738] [2020-10-11 18:25:47,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:25:47,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:25:47,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:25:47,662 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842762738] [2020-10-11 18:25:47,662 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:25:47,663 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 18:25:47,663 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694117089] [2020-10-11 18:25:47,663 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 18:25:47,664 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:25:47,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 18:25:47,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 18:25:47,963 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 108 [2020-10-11 18:25:47,963 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 162 transitions, 995 flow. Second operand 9 states. [2020-10-11 18:25:47,963 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:25:47,964 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 108 [2020-10-11 18:25:47,964 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:25:48,786 INFO L129 PetriNetUnfolder]: 1498/3409 cut-off events. [2020-10-11 18:25:48,787 INFO L130 PetriNetUnfolder]: For 12868/19354 co-relation queries the response was YES. [2020-10-11 18:25:48,829 INFO L80 FinitePrefix]: Finished finitePrefix Result has 14039 conditions, 3409 events. 1498/3409 cut-off events. For 12868/19354 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 32812 event pairs, 0 based on Foata normal form. 460/3410 useless extension candidates. Maximal degree in co-relation 13984. Up to 556 conditions per place. [2020-10-11 18:25:48,842 INFO L132 encePairwiseOnDemand]: 98/108 looper letters, 12 selfloop transitions, 57 changer transitions 29/184 dead transitions. [2020-10-11 18:25:48,842 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 184 transitions, 1391 flow [2020-10-11 18:25:48,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-11 18:25:48,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-11 18:25:48,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1762 transitions. [2020-10-11 18:25:48,846 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9063786008230452 [2020-10-11 18:25:48,846 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1762 transitions. [2020-10-11 18:25:48,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1762 transitions. [2020-10-11 18:25:48,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:25:48,847 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1762 transitions. [2020-10-11 18:25:48,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 19 states. [2020-10-11 18:25:48,853 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 19 states. [2020-10-11 18:25:48,853 INFO L81 ComplementDD]: Finished complementDD. Result 19 states. [2020-10-11 18:25:48,853 INFO L185 Difference]: Start difference. First operand has 173 places, 162 transitions, 995 flow. Second operand 18 states and 1762 transitions. [2020-10-11 18:25:48,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 184 transitions, 1391 flow [2020-10-11 18:25:48,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 184 transitions, 1296 flow, removed 41 selfloop flow, removed 12 redundant places. [2020-10-11 18:25:48,953 INFO L241 Difference]: Finished difference. Result has 184 places, 151 transitions, 945 flow [2020-10-11 18:25:48,954 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=889, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=945, PETRI_PLACES=184, PETRI_TRANSITIONS=151} [2020-10-11 18:25:48,954 INFO L341 CegarLoopForPetriNet]: 115 programPoint places, 69 predicate places. [2020-10-11 18:25:48,954 INFO L481 AbstractCegarLoop]: Abstraction has has 184 places, 151 transitions, 945 flow [2020-10-11 18:25:48,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 18:25:48,954 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:25:48,954 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:25:48,955 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-11 18:25:48,955 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:25:48,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:25:48,955 INFO L82 PathProgramCache]: Analyzing trace with hash 38924535, now seen corresponding path program 1 times [2020-10-11 18:25:48,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:25:48,955 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435376306] [2020-10-11 18:25:48,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:25:49,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:25:49,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:25:49,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435376306] [2020-10-11 18:25:49,096 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:25:49,096 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:25:49,096 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228080985] [2020-10-11 18:25:49,096 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:25:49,097 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:25:49,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:25:49,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:25:49,327 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 108 [2020-10-11 18:25:49,328 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 151 transitions, 945 flow. Second operand 7 states. [2020-10-11 18:25:49,328 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:25:49,328 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 108 [2020-10-11 18:25:49,328 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:25:50,108 INFO L129 PetriNetUnfolder]: 2004/5400 cut-off events. [2020-10-11 18:25:50,108 INFO L130 PetriNetUnfolder]: For 22356/24861 co-relation queries the response was YES. [2020-10-11 18:25:50,159 INFO L80 FinitePrefix]: Finished finitePrefix Result has 20990 conditions, 5400 events. 2004/5400 cut-off events. For 22356/24861 co-relation queries the response was YES. Maximal size of possible extension queue 920. Compared 61501 event pairs, 0 based on Foata normal form. 1/4742 useless extension candidates. Maximal degree in co-relation 20945. Up to 833 conditions per place. [2020-10-11 18:25:50,166 INFO L132 encePairwiseOnDemand]: 102/108 looper letters, 9 selfloop transitions, 2 changer transitions 9/156 dead transitions. [2020-10-11 18:25:50,167 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 156 transitions, 997 flow [2020-10-11 18:25:50,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 18:25:50,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-11 18:25:50,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 688 transitions. [2020-10-11 18:25:50,168 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.91005291005291 [2020-10-11 18:25:50,168 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 688 transitions. [2020-10-11 18:25:50,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 688 transitions. [2020-10-11 18:25:50,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:25:50,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 688 transitions. [2020-10-11 18:25:50,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-11 18:25:50,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-11 18:25:50,172 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-11 18:25:50,172 INFO L185 Difference]: Start difference. First operand has 184 places, 151 transitions, 945 flow. Second operand 7 states and 688 transitions. [2020-10-11 18:25:50,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 156 transitions, 997 flow [2020-10-11 18:25:50,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 156 transitions, 778 flow, removed 40 selfloop flow, removed 26 redundant places. [2020-10-11 18:25:50,757 INFO L241 Difference]: Finished difference. Result has 161 places, 147 transitions, 725 flow [2020-10-11 18:25:50,757 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=725, PETRI_PLACES=161, PETRI_TRANSITIONS=147} [2020-10-11 18:25:50,758 INFO L341 CegarLoopForPetriNet]: 115 programPoint places, 46 predicate places. [2020-10-11 18:25:50,758 INFO L481 AbstractCegarLoop]: Abstraction has has 161 places, 147 transitions, 725 flow [2020-10-11 18:25:50,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:25:50,758 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:25:50,758 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:25:50,758 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-11 18:25:50,758 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:25:50,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:25:50,759 INFO L82 PathProgramCache]: Analyzing trace with hash 2031942137, now seen corresponding path program 2 times [2020-10-11 18:25:50,759 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:25:50,759 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804186063] [2020-10-11 18:25:50,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:25:50,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:25:50,803 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:25:50,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:25:50,845 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:25:50,891 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-11 18:25:50,891 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-11 18:25:50,892 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-11 18:25:50,955 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:25:50,955 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:25:50,957 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:25:50,957 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:25:50,957 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:25:50,957 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:25:50,957 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:25:50,958 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:25:50,958 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:25:50,958 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:25:50,958 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:25:50,958 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:25:50,959 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:25:50,959 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:25:50,960 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:25:50,960 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:25:50,960 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:25:50,961 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:25:50,961 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:25:50,961 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:25:50,961 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:25:50,961 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:25:50,962 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:25:50,962 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:25:50,963 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:25:50,964 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:25:50,964 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:25:50,964 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:25:50,964 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:25:50,964 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:25:50,965 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:25:50,965 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:25:50,965 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:25:50,965 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:25:50,966 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:25:50,966 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:25:50,966 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:25:50,966 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:25:50,966 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:25:50,967 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:25:50,967 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:25:50,967 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:25:50,967 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:25:50,967 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:25:50,967 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:25:50,968 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:25:50,968 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:25:50,968 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:25:50,968 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:25:50,968 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:25:50,968 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:25:50,968 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:25:50,969 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:25:50,969 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:25:50,969 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:25:50,969 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:25:50,969 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:25:50,969 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:25:51,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 06:25:51 BasicIcfg [2020-10-11 18:25:51,086 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-11 18:25:51,089 INFO L168 Benchmark]: Toolchain (without parser) took 20755.33 ms. Allocated memory was 247.5 MB in the beginning and 735.6 MB in the end (delta: 488.1 MB). Free memory was 202.5 MB in the beginning and 229.2 MB in the end (delta: -26.7 MB). Peak memory consumption was 461.5 MB. Max. memory is 14.2 GB. [2020-10-11 18:25:51,090 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 247.5 MB. Free memory is still 223.8 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-11 18:25:51,090 INFO L168 Benchmark]: CACSL2BoogieTranslator took 767.72 ms. Allocated memory was 247.5 MB in the beginning and 301.5 MB in the end (delta: 54.0 MB). Free memory was 202.5 MB in the beginning and 249.7 MB in the end (delta: -47.2 MB). Peak memory consumption was 27.1 MB. Max. memory is 14.2 GB. [2020-10-11 18:25:51,091 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.76 ms. Allocated memory is still 301.5 MB. Free memory was 249.7 MB in the beginning and 247.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-11 18:25:51,092 INFO L168 Benchmark]: Boogie Preprocessor took 38.98 ms. Allocated memory is still 301.5 MB. Free memory was 247.2 MB in the beginning and 244.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-11 18:25:51,093 INFO L168 Benchmark]: RCFGBuilder took 1949.91 ms. Allocated memory was 301.5 MB in the beginning and 354.4 MB in the end (delta: 53.0 MB). Free memory was 244.7 MB in the beginning and 200.5 MB in the end (delta: 44.2 MB). Peak memory consumption was 97.6 MB. Max. memory is 14.2 GB. [2020-10-11 18:25:51,094 INFO L168 Benchmark]: TraceAbstraction took 17927.85 ms. Allocated memory was 354.4 MB in the beginning and 735.6 MB in the end (delta: 381.2 MB). Free memory was 200.5 MB in the beginning and 229.2 MB in the end (delta: -28.6 MB). Peak memory consumption was 352.5 MB. Max. memory is 14.2 GB. [2020-10-11 18:25:51,098 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.21 ms. Allocated memory is still 247.5 MB. Free memory is still 223.8 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 767.72 ms. Allocated memory was 247.5 MB in the beginning and 301.5 MB in the end (delta: 54.0 MB). Free memory was 202.5 MB in the beginning and 249.7 MB in the end (delta: -47.2 MB). Peak memory consumption was 27.1 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 65.76 ms. Allocated memory is still 301.5 MB. Free memory was 249.7 MB in the beginning and 247.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 38.98 ms. Allocated memory is still 301.5 MB. Free memory was 247.2 MB in the beginning and 244.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 1949.91 ms. Allocated memory was 301.5 MB in the beginning and 354.4 MB in the end (delta: 53.0 MB). Free memory was 244.7 MB in the beginning and 200.5 MB in the end (delta: 44.2 MB). Peak memory consumption was 97.6 MB. Max. memory is 14.2 GB. * TraceAbstraction took 17927.85 ms. Allocated memory was 354.4 MB in the beginning and 735.6 MB in the end (delta: 381.2 MB). Free memory was 200.5 MB in the beginning and 229.2 MB in the end (delta: -28.6 MB). Peak memory consumption was 352.5 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L701] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L703] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0] [L705] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0] [L706] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0] [L707] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L709] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L711] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L713] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L714] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L715] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L716] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L717] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L718] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L719] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L720] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0] [L721] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0] [L722] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L723] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L724] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L725] 0 _Bool z$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L726] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0] [L727] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L728] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L729] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L730] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L731] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L732] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L733] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] 0 pthread_t t1485; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L826] FCALL, FORK 0 pthread_create(&t1485, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] 0 pthread_t t1486; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] FCALL, FORK 0 pthread_create(&t1486, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] 0 pthread_t t1487; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] FCALL, FORK 0 pthread_create(&t1487, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L831] 0 pthread_t t1488; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] FCALL, FORK 0 pthread_create(&t1488, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 4 z$w_buff1 = z$w_buff0 [L788] 4 z$w_buff0 = 2 [L789] 4 z$w_buff1_used = z$w_buff0_used [L790] 4 z$w_buff0_used = (_Bool)1 [L7] COND TRUE 4 !expression [L7] 4 __VERIFIER_error() [L792] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L793] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L794] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L795] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L796] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L797] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L800] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L737] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L740] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L773] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L773] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L773] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L774] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L774] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L775] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L775] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L776] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L776] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L777] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L777] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L745] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L803] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L803] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L804] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L804] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L805] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L805] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L806] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L807] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L807] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L810] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L834] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L838] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L839] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L839] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L840] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L840] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L841] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L841] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L842] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L842] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L845] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L846] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L847] 0 z$flush_delayed = weak$$choice2 [L848] 0 z$mem_tmp = z [L849] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L849] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L850] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L850] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0 [L850] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L850] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L850] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L851] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L851] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L852] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L852] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L853] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L854] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L854] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L855] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L855] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L855] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L855] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L855] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L855] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L856] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L857] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L857] 0 z = z$flush_delayed ? z$mem_tmp : z [L858] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L7] COND TRUE 0 !expression VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L7] 0 __VERIFIER_error() VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 107 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 17.6s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 14.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 394 SDtfs, 551 SDslu, 1593 SDs, 0 SdLazy, 1561 SolverSat, 339 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 189 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1061occurred in iteration=10, 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.6s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 970 NumberOfCodeBlocks, 970 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 877 ConstructedInterpolants, 0 QuantifiedInterpolants, 260867 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...