/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_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-11 18:25:19,870 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-11 18:25:19,872 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-11 18:25:19,897 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-11 18:25:19,897 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-11 18:25:19,898 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-11 18:25:19,900 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-11 18:25:19,901 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-11 18:25:19,903 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-11 18:25:19,904 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-11 18:25:19,905 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-11 18:25:19,906 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-11 18:25:19,907 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-11 18:25:19,908 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-11 18:25:19,909 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-11 18:25:19,910 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-11 18:25:19,911 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-11 18:25:19,912 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-11 18:25:19,916 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-11 18:25:19,918 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-11 18:25:19,922 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-11 18:25:19,926 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-11 18:25:19,927 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-11 18:25:19,929 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-11 18:25:19,933 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-11 18:25:19,933 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-11 18:25:19,933 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-11 18:25:19,935 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-11 18:25:19,936 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-11 18:25:19,937 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-11 18:25:19,937 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-11 18:25:19,938 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-11 18:25:19,938 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-11 18:25:19,940 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-11 18:25:19,941 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-11 18:25:19,942 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-11 18:25:19,942 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-11 18:25:19,943 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-11 18:25:19,943 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-11 18:25:19,944 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-11 18:25:19,945 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-11 18:25:19,946 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:19,970 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-11 18:25:19,971 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-11 18:25:19,972 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-11 18:25:19,972 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-11 18:25:19,972 INFO L138 SettingsManager]: * Use SBE=true [2020-10-11 18:25:19,973 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-11 18:25:19,973 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-11 18:25:19,973 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-11 18:25:19,973 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-11 18:25:19,973 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-11 18:25:19,973 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-11 18:25:19,974 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-11 18:25:19,974 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-11 18:25:19,974 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-11 18:25:19,974 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-11 18:25:19,974 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-11 18:25:19,975 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-11 18:25:19,975 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-11 18:25:19,975 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-11 18:25:19,975 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-11 18:25:19,976 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-11 18:25:19,976 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 18:25:19,976 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-11 18:25:19,976 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-11 18:25:19,976 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-11 18:25:19,977 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-11 18:25:19,977 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-11 18:25:19,977 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-10-11 18:25:19,977 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-11 18:25:19,977 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-11 18:25:20,258 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-11 18:25:20,270 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-11 18:25:20,274 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-11 18:25:20,275 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-11 18:25:20,276 INFO L275 PluginConnector]: CDTParser initialized [2020-10-11 18:25:20,276 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_pso.opt.i [2020-10-11 18:25:20,353 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fa164de1/df0783e8e8b941cc9c8524cdd5415724/FLAG289c9b1f7 [2020-10-11 18:25:20,882 INFO L306 CDTParser]: Found 1 translation units. [2020-10-11 18:25:20,883 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_pso.opt.i [2020-10-11 18:25:20,901 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fa164de1/df0783e8e8b941cc9c8524cdd5415724/FLAG289c9b1f7 [2020-10-11 18:25:21,211 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fa164de1/df0783e8e8b941cc9c8524cdd5415724 [2020-10-11 18:25:21,220 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-11 18:25:21,222 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-11 18:25:21,223 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-11 18:25:21,223 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-11 18:25:21,227 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-11 18:25:21,228 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:25:21" (1/1) ... [2020-10-11 18:25:21,231 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61d18a2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:25:21, skipping insertion in model container [2020-10-11 18:25:21,231 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:25:21" (1/1) ... [2020-10-11 18:25:21,239 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-11 18:25:21,286 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-11 18:25:21,753 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:25:21,771 INFO L203 MainTranslator]: Completed pre-run [2020-10-11 18:25:21,889 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:25:21,975 INFO L208 MainTranslator]: Completed translation [2020-10-11 18:25:21,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:25:21 WrapperNode [2020-10-11 18:25:21,976 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-11 18:25:21,977 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-11 18:25:21,977 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-11 18:25:21,977 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-11 18:25:21,986 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:21" (1/1) ... [2020-10-11 18:25:22,012 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:21" (1/1) ... [2020-10-11 18:25:22,049 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-11 18:25:22,049 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-11 18:25:22,049 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-11 18:25:22,050 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-11 18:25:22,059 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:21" (1/1) ... [2020-10-11 18:25:22,059 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:21" (1/1) ... [2020-10-11 18:25:22,064 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:21" (1/1) ... [2020-10-11 18:25:22,065 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:21" (1/1) ... [2020-10-11 18:25:22,076 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:21" (1/1) ... [2020-10-11 18:25:22,079 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:21" (1/1) ... [2020-10-11 18:25:22,083 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:21" (1/1) ... [2020-10-11 18:25:22,089 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-11 18:25:22,090 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-11 18:25:22,090 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-11 18:25:22,090 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-11 18:25:22,091 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:25:21" (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:22,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-11 18:25:22,164 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-11 18:25:22,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-11 18:25:22,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-11 18:25:22,164 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-11 18:25:22,165 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-11 18:25:22,165 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-11 18:25:22,166 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-11 18:25:22,166 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-11 18:25:22,167 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-11 18:25:22,167 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-11 18:25:22,167 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-11 18:25:22,167 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-11 18:25:22,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-11 18:25:22,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-11 18:25:22,170 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:24,036 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-11 18:25:24,037 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-11 18:25:24,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:25:24 BoogieIcfgContainer [2020-10-11 18:25:24,039 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-11 18:25:24,041 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-11 18:25:24,041 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-11 18:25:24,044 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-11 18:25:24,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:25:21" (1/3) ... [2020-10-11 18:25:24,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ed54de1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:25:24, skipping insertion in model container [2020-10-11 18:25:24,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:25:21" (2/3) ... [2020-10-11 18:25:24,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ed54de1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:25:24, skipping insertion in model container [2020-10-11 18:25:24,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:25:24" (3/3) ... [2020-10-11 18:25:24,048 INFO L111 eAbstractionObserver]: Analyzing ICFG mix055_pso.opt.i [2020-10-11 18:25:24,060 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-11 18:25:24,068 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-11 18:25:24,069 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-11 18:25:24,102 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,102 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,102 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,103 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,103 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,103 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,104 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,104 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,104 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,105 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,105 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,105 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,106 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,106 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,106 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,106 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,106 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,109 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,109 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,109 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,110 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,110 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,110 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,110 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:24,111 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,111 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:24,111 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,111 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,112 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,112 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,112 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,112 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,112 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,113 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,113 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,117 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,117 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,118 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,118 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,118 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,118 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,119 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,119 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,119 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,119 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,125 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,125 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,125 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,126 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:24,126 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,126 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,126 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,126 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,127 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,127 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,127 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,127 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,129 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,129 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,129 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,130 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,131 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,131 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,132 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,132 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:24,151 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-11 18:25:24,175 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 18:25:24,175 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-11 18:25:24,175 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 18:25:24,175 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 18:25:24,176 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 18:25:24,176 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 18:25:24,176 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 18:25:24,176 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 18:25:24,191 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 119 places, 108 transitions, 236 flow [2020-10-11 18:25:24,247 INFO L129 PetriNetUnfolder]: 2/104 cut-off events. [2020-10-11 18:25:24,247 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:25:24,253 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:24,253 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 108 transitions, 236 flow [2020-10-11 18:25:24,261 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 104 transitions, 220 flow [2020-10-11 18:25:24,282 INFO L129 PetriNetUnfolder]: 0/68 cut-off events. [2020-10-11 18:25:24,283 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:25:24,283 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:25:24,284 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:24,285 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:24,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:25:24,292 INFO L82 PathProgramCache]: Analyzing trace with hash -555940511, now seen corresponding path program 1 times [2020-10-11 18:25:24,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:25:24,303 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784584356] [2020-10-11 18:25:24,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:25:24,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:25:24,694 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:24,696 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784584356] [2020-10-11 18:25:24,698 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:25:24,702 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 18:25:24,704 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617292583] [2020-10-11 18:25:24,718 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 18:25:24,719 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:25:24,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 18:25:24,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 18:25:24,887 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 108 [2020-10-11 18:25:24,889 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 104 transitions, 220 flow. Second operand 3 states. [2020-10-11 18:25:24,889 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:25:24,890 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 108 [2020-10-11 18:25:24,891 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:25:24,926 INFO L129 PetriNetUnfolder]: 0/101 cut-off events. [2020-10-11 18:25:24,926 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:25:24,927 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:24,928 INFO L132 encePairwiseOnDemand]: 103/108 looper letters, 0 selfloop transitions, 2 changer transitions 13/101 dead transitions. [2020-10-11 18:25:24,928 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 101 transitions, 218 flow [2020-10-11 18:25:24,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 18:25:24,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-11 18:25:24,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 316 transitions. [2020-10-11 18:25:24,945 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9753086419753086 [2020-10-11 18:25:24,946 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 316 transitions. [2020-10-11 18:25:24,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 316 transitions. [2020-10-11 18:25:24,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:25:24,952 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 316 transitions. [2020-10-11 18:25:24,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-11 18:25:24,962 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-11 18:25:24,963 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-11 18:25:24,965 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:24,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 101 transitions, 218 flow [2020-10-11 18:25:24,971 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:24,975 INFO L241 Difference]: Finished difference. Result has 112 places, 88 transitions, 188 flow [2020-10-11 18:25:24,978 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:24,979 INFO L341 CegarLoopForPetriNet]: 115 programPoint places, -3 predicate places. [2020-10-11 18:25:24,979 INFO L481 AbstractCegarLoop]: Abstraction has has 112 places, 88 transitions, 188 flow [2020-10-11 18:25:24,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 18:25:24,980 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:25:24,980 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:24,980 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-11 18:25:24,980 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:24,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:25:24,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1579175048, now seen corresponding path program 1 times [2020-10-11 18:25:24,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:25:24,981 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773405007] [2020-10-11 18:25:24,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:25:25,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:25:25,432 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:25,433 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773405007] [2020-10-11 18:25:25,433 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:25:25,433 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-11 18:25:25,434 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046041024] [2020-10-11 18:25:25,436 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 18:25:25,436 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:25:25,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 18:25:25,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-10-11 18:25:26,012 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 108 [2020-10-11 18:25:26,013 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 88 transitions, 188 flow. Second operand 11 states. [2020-10-11 18:25:26,013 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:25:26,013 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 108 [2020-10-11 18:25:26,013 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:25:26,658 INFO L129 PetriNetUnfolder]: 97/315 cut-off events. [2020-10-11 18:25:26,658 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-11 18:25:26,661 INFO L80 FinitePrefix]: Finished finitePrefix Result has 546 conditions, 315 events. 97/315 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1370 event pairs, 40 based on Foata normal form. 9/318 useless extension candidates. Maximal degree in co-relation 497. Up to 106 conditions per place. [2020-10-11 18:25:26,665 INFO L132 encePairwiseOnDemand]: 96/108 looper letters, 13 selfloop transitions, 9 changer transitions 35/129 dead transitions. [2020-10-11 18:25:26,665 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 129 transitions, 398 flow [2020-10-11 18:25:26,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-11 18:25:26,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-10-11 18:25:26,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1573 transitions. [2020-10-11 18:25:26,678 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8567538126361656 [2020-10-11 18:25:26,678 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1573 transitions. [2020-10-11 18:25:26,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1573 transitions. [2020-10-11 18:25:26,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:25:26,680 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1573 transitions. [2020-10-11 18:25:26,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 18 states. [2020-10-11 18:25:26,691 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 18 states. [2020-10-11 18:25:26,691 INFO L81 ComplementDD]: Finished complementDD. Result 18 states. [2020-10-11 18:25:26,691 INFO L185 Difference]: Start difference. First operand has 112 places, 88 transitions, 188 flow. Second operand 17 states and 1573 transitions. [2020-10-11 18:25:26,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 129 transitions, 398 flow [2020-10-11 18:25:26,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 129 transitions, 380 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-11 18:25:26,699 INFO L241 Difference]: Finished difference. Result has 124 places, 92 transitions, 256 flow [2020-10-11 18:25:26,700 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=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=256, PETRI_PLACES=124, PETRI_TRANSITIONS=92} [2020-10-11 18:25:26,700 INFO L341 CegarLoopForPetriNet]: 115 programPoint places, 9 predicate places. [2020-10-11 18:25:26,700 INFO L481 AbstractCegarLoop]: Abstraction has has 124 places, 92 transitions, 256 flow [2020-10-11 18:25:26,701 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 18:25:26,701 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:25:26,701 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:26,701 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-11 18:25:26,701 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:26,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:25:26,702 INFO L82 PathProgramCache]: Analyzing trace with hash 66107549, now seen corresponding path program 1 times [2020-10-11 18:25:26,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:25:26,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866735551] [2020-10-11 18:25:26,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:25:26,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:25:26,971 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:26,973 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866735551] [2020-10-11 18:25:26,973 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:25:26,973 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 18:25:26,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84137066] [2020-10-11 18:25:26,974 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 18:25:26,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:25:26,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 18:25:26,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-10-11 18:25:27,843 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 108 [2020-10-11 18:25:27,844 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 92 transitions, 256 flow. Second operand 9 states. [2020-10-11 18:25:27,845 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:25:27,845 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 108 [2020-10-11 18:25:27,845 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:25:28,344 INFO L129 PetriNetUnfolder]: 80/280 cut-off events. [2020-10-11 18:25:28,344 INFO L130 PetriNetUnfolder]: For 510/513 co-relation queries the response was YES. [2020-10-11 18:25:28,347 INFO L80 FinitePrefix]: Finished finitePrefix Result has 786 conditions, 280 events. 80/280 cut-off events. For 510/513 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1118 event pairs, 15 based on Foata normal form. 7/283 useless extension candidates. Maximal degree in co-relation 724. Up to 88 conditions per place. [2020-10-11 18:25:28,349 INFO L132 encePairwiseOnDemand]: 98/108 looper letters, 20 selfloop transitions, 8 changer transitions 25/127 dead transitions. [2020-10-11 18:25:28,350 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 127 transitions, 574 flow [2020-10-11 18:25:28,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 18:25:28,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-11 18:25:28,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1327 transitions. [2020-10-11 18:25:28,355 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8776455026455027 [2020-10-11 18:25:28,355 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1327 transitions. [2020-10-11 18:25:28,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1327 transitions. [2020-10-11 18:25:28,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:25:28,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1327 transitions. [2020-10-11 18:25:28,359 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-11 18:25:28,363 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-11 18:25:28,363 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-11 18:25:28,363 INFO L185 Difference]: Start difference. First operand has 124 places, 92 transitions, 256 flow. Second operand 14 states and 1327 transitions. [2020-10-11 18:25:28,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 127 transitions, 574 flow [2020-10-11 18:25:28,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 127 transitions, 542 flow, removed 12 selfloop flow, removed 7 redundant places. [2020-10-11 18:25:28,371 INFO L241 Difference]: Finished difference. Result has 131 places, 95 transitions, 306 flow [2020-10-11 18:25:28,371 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=306, PETRI_PLACES=131, PETRI_TRANSITIONS=95} [2020-10-11 18:25:28,372 INFO L341 CegarLoopForPetriNet]: 115 programPoint places, 16 predicate places. [2020-10-11 18:25:28,372 INFO L481 AbstractCegarLoop]: Abstraction has has 131 places, 95 transitions, 306 flow [2020-10-11 18:25:28,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 18:25:28,372 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:25:28,372 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28,372 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-11 18:25:28,373 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:28,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:25:28,373 INFO L82 PathProgramCache]: Analyzing trace with hash -188309683, now seen corresponding path program 2 times [2020-10-11 18:25:28,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:25:28,374 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222444563] [2020-10-11 18:25:28,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:25:28,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:25:28,636 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:28,637 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222444563] [2020-10-11 18:25:28,637 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:25:28,637 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 18:25:28,638 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261601416] [2020-10-11 18:25:28,638 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 18:25:28,638 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:25:28,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 18:25:28,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-10-11 18:25:29,547 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 108 [2020-10-11 18:25:29,548 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 95 transitions, 306 flow. Second operand 10 states. [2020-10-11 18:25:29,548 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:25:29,549 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 108 [2020-10-11 18:25:29,549 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:25:29,945 INFO L129 PetriNetUnfolder]: 70/258 cut-off events. [2020-10-11 18:25:29,945 INFO L130 PetriNetUnfolder]: For 1006/1038 co-relation queries the response was YES. [2020-10-11 18:25:29,947 INFO L80 FinitePrefix]: Finished finitePrefix Result has 938 conditions, 258 events. 70/258 cut-off events. For 1006/1038 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 965 event pairs, 15 based on Foata normal form. 12/266 useless extension candidates. Maximal degree in co-relation 869. Up to 83 conditions per place. [2020-10-11 18:25:29,950 INFO L132 encePairwiseOnDemand]: 98/108 looper letters, 20 selfloop transitions, 10 changer transitions 25/128 dead transitions. [2020-10-11 18:25:29,950 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 128 transitions, 736 flow [2020-10-11 18:25:29,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 18:25:29,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-11 18:25:29,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1403 transitions. [2020-10-11 18:25:29,955 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8660493827160494 [2020-10-11 18:25:29,955 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1403 transitions. [2020-10-11 18:25:29,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1403 transitions. [2020-10-11 18:25:29,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:25:29,957 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1403 transitions. [2020-10-11 18:25:29,960 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-11 18:25:29,964 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-11 18:25:29,964 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-11 18:25:29,964 INFO L185 Difference]: Start difference. First operand has 131 places, 95 transitions, 306 flow. Second operand 15 states and 1403 transitions. [2020-10-11 18:25:29,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 128 transitions, 736 flow [2020-10-11 18:25:29,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 128 transitions, 667 flow, removed 28 selfloop flow, removed 8 redundant places. [2020-10-11 18:25:29,972 INFO L241 Difference]: Finished difference. Result has 138 places, 97 transitions, 354 flow [2020-10-11 18:25:29,973 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=354, PETRI_PLACES=138, PETRI_TRANSITIONS=97} [2020-10-11 18:25:29,973 INFO L341 CegarLoopForPetriNet]: 115 programPoint places, 23 predicate places. [2020-10-11 18:25:29,973 INFO L481 AbstractCegarLoop]: Abstraction has has 138 places, 97 transitions, 354 flow [2020-10-11 18:25:29,973 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 18:25:29,973 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:25:29,974 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] [2020-10-11 18:25:29,974 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-11 18:25:29,974 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:29,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:25:29,974 INFO L82 PathProgramCache]: Analyzing trace with hash 2045899786, now seen corresponding path program 1 times [2020-10-11 18:25:29,975 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:25:29,975 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507278131] [2020-10-11 18:25:29,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:25:30,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:25:30,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:25:30,163 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507278131] [2020-10-11 18:25:30,163 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:25:30,163 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:25:30,164 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152226552] [2020-10-11 18:25:30,164 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:25:30,165 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:25:30,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:25:30,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:25:30,340 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 108 [2020-10-11 18:25:30,340 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 97 transitions, 354 flow. Second operand 6 states. [2020-10-11 18:25:30,341 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:25:30,341 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 108 [2020-10-11 18:25:30,341 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:25:30,580 INFO L129 PetriNetUnfolder]: 242/683 cut-off events. [2020-10-11 18:25:30,581 INFO L130 PetriNetUnfolder]: For 3732/3742 co-relation queries the response was YES. [2020-10-11 18:25:30,589 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2400 conditions, 683 events. 242/683 cut-off events. For 3732/3742 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 4287 event pairs, 89 based on Foata normal form. 25/694 useless extension candidates. Maximal degree in co-relation 2328. Up to 156 conditions per place. [2020-10-11 18:25:30,594 INFO L132 encePairwiseOnDemand]: 101/108 looper letters, 16 selfloop transitions, 14 changer transitions 0/118 dead transitions. [2020-10-11 18:25:30,594 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 118 transitions, 512 flow [2020-10-11 18:25:30,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:25:30,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:25:30,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 905 transitions. [2020-10-11 18:25:30,599 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9310699588477366 [2020-10-11 18:25:30,599 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 905 transitions. [2020-10-11 18:25:30,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 905 transitions. [2020-10-11 18:25:30,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:25:30,600 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 905 transitions. [2020-10-11 18:25:30,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:25:30,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:25:30,605 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:25:30,605 INFO L185 Difference]: Start difference. First operand has 138 places, 97 transitions, 354 flow. Second operand 9 states and 905 transitions. [2020-10-11 18:25:30,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 118 transitions, 512 flow [2020-10-11 18:25:30,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 118 transitions, 441 flow, removed 31 selfloop flow, removed 12 redundant places. [2020-10-11 18:25:30,617 INFO L241 Difference]: Finished difference. Result has 130 places, 110 transitions, 437 flow [2020-10-11 18:25:30,617 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=437, PETRI_PLACES=130, PETRI_TRANSITIONS=110} [2020-10-11 18:25:30,617 INFO L341 CegarLoopForPetriNet]: 115 programPoint places, 15 predicate places. [2020-10-11 18:25:30,618 INFO L481 AbstractCegarLoop]: Abstraction has has 130 places, 110 transitions, 437 flow [2020-10-11 18:25:30,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:25:30,618 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:25:30,618 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:30,618 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-11 18:25:30,618 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:30,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:25:30,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1889258635, now seen corresponding path program 1 times [2020-10-11 18:25:30,619 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:25:30,619 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321784599] [2020-10-11 18:25:30,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:25:30,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:25:30,964 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:30,965 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321784599] [2020-10-11 18:25:30,965 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:25:30,965 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 18:25:30,965 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132726088] [2020-10-11 18:25:30,966 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 18:25:30,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:25:30,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 18:25:30,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-10-11 18:25:32,218 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 108 [2020-10-11 18:25:32,220 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 110 transitions, 437 flow. Second operand 12 states. [2020-10-11 18:25:32,220 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:25:32,220 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 108 [2020-10-11 18:25:32,220 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:25:32,839 INFO L129 PetriNetUnfolder]: 230/879 cut-off events. [2020-10-11 18:25:32,839 INFO L130 PetriNetUnfolder]: For 3807/3863 co-relation queries the response was YES. [2020-10-11 18:25:32,850 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3148 conditions, 879 events. 230/879 cut-off events. For 3807/3863 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 6834 event pairs, 15 based on Foata normal form. 21/875 useless extension candidates. Maximal degree in co-relation 3077. Up to 162 conditions per place. [2020-10-11 18:25:32,854 INFO L132 encePairwiseOnDemand]: 98/108 looper letters, 20 selfloop transitions, 8 changer transitions 43/147 dead transitions. [2020-10-11 18:25:32,858 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 147 transitions, 956 flow [2020-10-11 18:25:32,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 18:25:32,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-11 18:25:32,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1226 transitions. [2020-10-11 18:25:32,864 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8732193732193733 [2020-10-11 18:25:32,865 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1226 transitions. [2020-10-11 18:25:32,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1226 transitions. [2020-10-11 18:25:32,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:25:32,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1226 transitions. [2020-10-11 18:25:32,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-11 18:25:32,872 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-11 18:25:32,872 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-11 18:25:32,873 INFO L185 Difference]: Start difference. First operand has 130 places, 110 transitions, 437 flow. Second operand 13 states and 1226 transitions. [2020-10-11 18:25:32,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 147 transitions, 956 flow [2020-10-11 18:25:32,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 147 transitions, 940 flow, removed 8 selfloop flow, removed 0 redundant places. [2020-10-11 18:25:32,884 INFO L241 Difference]: Finished difference. Result has 149 places, 99 transitions, 376 flow [2020-10-11 18:25:32,885 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=376, PETRI_PLACES=149, PETRI_TRANSITIONS=99} [2020-10-11 18:25:32,885 INFO L341 CegarLoopForPetriNet]: 115 programPoint places, 34 predicate places. [2020-10-11 18:25:32,885 INFO L481 AbstractCegarLoop]: Abstraction has has 149 places, 99 transitions, 376 flow [2020-10-11 18:25:32,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 18:25:32,885 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:25:32,886 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:32,886 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-11 18:25:32,886 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:32,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:25:32,886 INFO L82 PathProgramCache]: Analyzing trace with hash -2104494940, now seen corresponding path program 1 times [2020-10-11 18:25:32,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:25:32,887 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15551766] [2020-10-11 18:25:32,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:25:32,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:25:33,007 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,008 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15551766] [2020-10-11 18:25:33,008 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:25:33,008 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:25:33,009 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583030304] [2020-10-11 18:25:33,009 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:25:33,009 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:25:33,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:25:33,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:25:33,086 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 108 [2020-10-11 18:25:33,086 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 99 transitions, 376 flow. Second operand 6 states. [2020-10-11 18:25:33,086 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:25:33,087 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 108 [2020-10-11 18:25:33,087 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:25:33,662 INFO L129 PetriNetUnfolder]: 960/2099 cut-off events. [2020-10-11 18:25:33,662 INFO L130 PetriNetUnfolder]: For 4941/4965 co-relation queries the response was YES. [2020-10-11 18:25:33,688 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5752 conditions, 2099 events. 960/2099 cut-off events. For 4941/4965 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 16165 event pairs, 106 based on Foata normal form. 41/1863 useless extension candidates. Maximal degree in co-relation 5673. Up to 657 conditions per place. [2020-10-11 18:25:33,704 INFO L132 encePairwiseOnDemand]: 98/108 looper letters, 23 selfloop transitions, 19 changer transitions 0/130 dead transitions. [2020-10-11 18:25:33,704 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 130 transitions, 522 flow [2020-10-11 18:25:33,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:25:33,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:25:33,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 890 transitions. [2020-10-11 18:25:33,707 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9156378600823045 [2020-10-11 18:25:33,708 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 890 transitions. [2020-10-11 18:25:33,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 890 transitions. [2020-10-11 18:25:33,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:25:33,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 890 transitions. [2020-10-11 18:25:33,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:25:33,712 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:25:33,712 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:25:33,713 INFO L185 Difference]: Start difference. First operand has 149 places, 99 transitions, 376 flow. Second operand 9 states and 890 transitions. [2020-10-11 18:25:33,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 130 transitions, 522 flow [2020-10-11 18:25:33,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 130 transitions, 459 flow, removed 24 selfloop flow, removed 21 redundant places. [2020-10-11 18:25:33,731 INFO L241 Difference]: Finished difference. Result has 129 places, 116 transitions, 447 flow [2020-10-11 18:25:33,731 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=116, 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=447, PETRI_PLACES=129, PETRI_TRANSITIONS=116} [2020-10-11 18:25:33,731 INFO L341 CegarLoopForPetriNet]: 115 programPoint places, 14 predicate places. [2020-10-11 18:25:33,732 INFO L481 AbstractCegarLoop]: Abstraction has has 129 places, 116 transitions, 447 flow [2020-10-11 18:25:33,732 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:25:33,732 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:25:33,732 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:33,732 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-11 18:25:33,732 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:33,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:25:33,733 INFO L82 PathProgramCache]: Analyzing trace with hash -351673222, now seen corresponding path program 1 times [2020-10-11 18:25:33,733 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:25:33,733 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618563144] [2020-10-11 18:25:33,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:25:33,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:25:33,926 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,926 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618563144] [2020-10-11 18:25:33,927 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:25:33,927 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:25:33,927 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584648317] [2020-10-11 18:25:33,928 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:25:33,928 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:25:33,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:25:33,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:25:34,104 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 108 [2020-10-11 18:25:34,105 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 116 transitions, 447 flow. Second operand 7 states. [2020-10-11 18:25:34,105 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:25:34,106 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 108 [2020-10-11 18:25:34,106 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:25:34,769 INFO L129 PetriNetUnfolder]: 931/2019 cut-off events. [2020-10-11 18:25:34,770 INFO L130 PetriNetUnfolder]: For 5790/7477 co-relation queries the response was YES. [2020-10-11 18:25:34,788 INFO L80 FinitePrefix]: Finished finitePrefix Result has 7418 conditions, 2019 events. 931/2019 cut-off events. For 5790/7477 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 15498 event pairs, 41 based on Foata normal form. 110/1886 useless extension candidates. Maximal degree in co-relation 7352. Up to 968 conditions per place. [2020-10-11 18:25:34,807 INFO L132 encePairwiseOnDemand]: 98/108 looper letters, 25 selfloop transitions, 37 changer transitions 0/150 dead transitions. [2020-10-11 18:25:34,808 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 150 transitions, 800 flow [2020-10-11 18:25:34,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 18:25:34,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-11 18:25:34,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1188 transitions. [2020-10-11 18:25:34,813 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9166666666666666 [2020-10-11 18:25:34,813 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1188 transitions. [2020-10-11 18:25:34,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1188 transitions. [2020-10-11 18:25:34,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:25:34,814 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1188 transitions. [2020-10-11 18:25:34,817 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-11 18:25:34,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-11 18:25:34,821 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-11 18:25:34,821 INFO L185 Difference]: Start difference. First operand has 129 places, 116 transitions, 447 flow. Second operand 12 states and 1188 transitions. [2020-10-11 18:25:34,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 150 transitions, 800 flow [2020-10-11 18:25:34,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 150 transitions, 798 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-11 18:25:34,834 INFO L241 Difference]: Finished difference. Result has 144 places, 135 transitions, 725 flow [2020-10-11 18:25:34,834 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=128, 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=725, PETRI_PLACES=144, PETRI_TRANSITIONS=135} [2020-10-11 18:25:34,834 INFO L341 CegarLoopForPetriNet]: 115 programPoint places, 29 predicate places. [2020-10-11 18:25:34,835 INFO L481 AbstractCegarLoop]: Abstraction has has 144 places, 135 transitions, 725 flow [2020-10-11 18:25:34,835 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:25:34,835 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:25:34,835 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:34,835 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-11 18:25:34,836 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:34,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:25:34,836 INFO L82 PathProgramCache]: Analyzing trace with hash -544028543, now seen corresponding path program 1 times [2020-10-11 18:25:34,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:25:34,838 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147618112] [2020-10-11 18:25:34,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:25:34,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:25:34,977 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,977 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147618112] [2020-10-11 18:25:34,977 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:25:34,977 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:25:34,978 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148902750] [2020-10-11 18:25:34,978 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:25:34,978 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:25:34,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:25:34,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:25:35,162 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 108 [2020-10-11 18:25:35,163 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 135 transitions, 725 flow. Second operand 6 states. [2020-10-11 18:25:35,163 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:25:35,163 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 108 [2020-10-11 18:25:35,163 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:25:35,647 INFO L129 PetriNetUnfolder]: 652/2118 cut-off events. [2020-10-11 18:25:35,647 INFO L130 PetriNetUnfolder]: For 8617/10511 co-relation queries the response was YES. [2020-10-11 18:25:35,671 INFO L80 FinitePrefix]: Finished finitePrefix Result has 8309 conditions, 2118 events. 652/2118 cut-off events. For 8617/10511 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 19325 event pairs, 90 based on Foata normal form. 68/1915 useless extension candidates. Maximal degree in co-relation 8236. Up to 780 conditions per place. [2020-10-11 18:25:35,684 INFO L132 encePairwiseOnDemand]: 102/108 looper letters, 14 selfloop transitions, 11 changer transitions 4/149 dead transitions. [2020-10-11 18:25:35,684 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 149 transitions, 843 flow [2020-10-11 18:25:35,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:25:35,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:25:35,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 899 transitions. [2020-10-11 18:25:35,688 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9248971193415638 [2020-10-11 18:25:35,688 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 899 transitions. [2020-10-11 18:25:35,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 899 transitions. [2020-10-11 18:25:35,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:25:35,689 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 899 transitions. [2020-10-11 18:25:35,691 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:25:35,693 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:25:35,694 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:25:35,694 INFO L185 Difference]: Start difference. First operand has 144 places, 135 transitions, 725 flow. Second operand 9 states and 899 transitions. [2020-10-11 18:25:35,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 149 transitions, 843 flow [2020-10-11 18:25:35,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 149 transitions, 740 flow, removed 42 selfloop flow, removed 4 redundant places. [2020-10-11 18:25:35,729 INFO L241 Difference]: Finished difference. Result has 155 places, 139 transitions, 699 flow [2020-10-11 18:25:35,729 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=140, 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=699, PETRI_PLACES=155, PETRI_TRANSITIONS=139} [2020-10-11 18:25:35,730 INFO L341 CegarLoopForPetriNet]: 115 programPoint places, 40 predicate places. [2020-10-11 18:25:35,730 INFO L481 AbstractCegarLoop]: Abstraction has has 155 places, 139 transitions, 699 flow [2020-10-11 18:25:35,730 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:25:35,730 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:25:35,730 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:35,731 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-11 18:25:35,731 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:35,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:25:35,731 INFO L82 PathProgramCache]: Analyzing trace with hash 774384507, now seen corresponding path program 1 times [2020-10-11 18:25:35,731 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:25:35,732 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580420330] [2020-10-11 18:25:35,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:25:35,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:25:35,872 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,873 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580420330] [2020-10-11 18:25:35,873 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:25:35,873 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-11 18:25:35,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192966254] [2020-10-11 18:25:35,874 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 18:25:35,874 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:25:35,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 18:25:35,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-11 18:25:36,030 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 108 [2020-10-11 18:25:36,031 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 139 transitions, 699 flow. Second operand 8 states. [2020-10-11 18:25:36,031 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:25:36,031 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 108 [2020-10-11 18:25:36,031 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:25:36,864 INFO L129 PetriNetUnfolder]: 1246/2623 cut-off events. [2020-10-11 18:25:36,865 INFO L130 PetriNetUnfolder]: For 21790/24600 co-relation queries the response was YES. [2020-10-11 18:25:36,897 INFO L80 FinitePrefix]: Finished finitePrefix Result has 13056 conditions, 2623 events. 1246/2623 cut-off events. For 21790/24600 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 21482 event pairs, 8 based on Foata normal form. 154/2437 useless extension candidates. Maximal degree in co-relation 12977. Up to 1169 conditions per place. [2020-10-11 18:25:36,911 INFO L132 encePairwiseOnDemand]: 98/108 looper letters, 19 selfloop transitions, 51 changer transitions 18/173 dead transitions. [2020-10-11 18:25:36,911 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 173 transitions, 1240 flow [2020-10-11 18:25:36,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 18:25:36,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-11 18:25:36,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1482 transitions. [2020-10-11 18:25:36,918 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9148148148148149 [2020-10-11 18:25:36,918 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1482 transitions. [2020-10-11 18:25:36,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1482 transitions. [2020-10-11 18:25:36,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:25:36,920 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1482 transitions. [2020-10-11 18:25:36,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-11 18:25:36,928 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-11 18:25:36,928 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-11 18:25:36,928 INFO L185 Difference]: Start difference. First operand has 155 places, 139 transitions, 699 flow. Second operand 15 states and 1482 transitions. [2020-10-11 18:25:36,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 173 transitions, 1240 flow [2020-10-11 18:25:36,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 173 transitions, 1199 flow, removed 12 selfloop flow, removed 5 redundant places. [2020-10-11 18:25:36,973 INFO L241 Difference]: Finished difference. Result has 169 places, 150 transitions, 995 flow [2020-10-11 18:25:36,974 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=641, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=995, PETRI_PLACES=169, PETRI_TRANSITIONS=150} [2020-10-11 18:25:36,974 INFO L341 CegarLoopForPetriNet]: 115 programPoint places, 54 predicate places. [2020-10-11 18:25:36,974 INFO L481 AbstractCegarLoop]: Abstraction has has 169 places, 150 transitions, 995 flow [2020-10-11 18:25:36,974 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 18:25:36,975 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:25:36,975 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:36,975 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-11 18:25:36,976 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:36,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:25:36,976 INFO L82 PathProgramCache]: Analyzing trace with hash -2017065575, now seen corresponding path program 1 times [2020-10-11 18:25:36,977 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:25:36,981 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877246357] [2020-10-11 18:25:36,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:25:37,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:25:37,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:25:37,134 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877246357] [2020-10-11 18:25:37,134 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:25:37,134 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:25:37,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045925150] [2020-10-11 18:25:37,135 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:25:37,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:25:37,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:25:37,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:25:37,275 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 108 [2020-10-11 18:25:37,275 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 150 transitions, 995 flow. Second operand 7 states. [2020-10-11 18:25:37,275 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:25:37,276 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 108 [2020-10-11 18:25:37,276 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:25:38,226 INFO L129 PetriNetUnfolder]: 1547/4218 cut-off events. [2020-10-11 18:25:38,227 INFO L130 PetriNetUnfolder]: For 35350/37867 co-relation queries the response was YES. [2020-10-11 18:25:38,256 INFO L80 FinitePrefix]: Finished finitePrefix Result has 19980 conditions, 4218 events. 1547/4218 cut-off events. For 35350/37867 co-relation queries the response was YES. Maximal size of possible extension queue 633. Compared 44998 event pairs, 10 based on Foata normal form. 13/3777 useless extension candidates. Maximal degree in co-relation 19896. Up to 1528 conditions per place. [2020-10-11 18:25:38,273 INFO L132 encePairwiseOnDemand]: 102/108 looper letters, 14 selfloop transitions, 2 changer transitions 4/160 dead transitions. [2020-10-11 18:25:38,273 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 160 transitions, 1107 flow [2020-10-11 18:25:38,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 18:25:38,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-11 18:25:38,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 693 transitions. [2020-10-11 18:25:38,275 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9166666666666666 [2020-10-11 18:25:38,275 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 693 transitions. [2020-10-11 18:25:38,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 693 transitions. [2020-10-11 18:25:38,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:25:38,275 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 693 transitions. [2020-10-11 18:25:38,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-11 18:25:38,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-11 18:25:38,278 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-11 18:25:38,278 INFO L185 Difference]: Start difference. First operand has 169 places, 150 transitions, 995 flow. Second operand 7 states and 693 transitions. [2020-10-11 18:25:38,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 160 transitions, 1107 flow [2020-10-11 18:25:38,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 160 transitions, 906 flow, removed 78 selfloop flow, removed 13 redundant places. [2020-10-11 18:25:38,856 INFO L241 Difference]: Finished difference. Result has 161 places, 151 transitions, 833 flow [2020-10-11 18:25:38,857 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=814, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=833, PETRI_PLACES=161, PETRI_TRANSITIONS=151} [2020-10-11 18:25:38,857 INFO L341 CegarLoopForPetriNet]: 115 programPoint places, 46 predicate places. [2020-10-11 18:25:38,857 INFO L481 AbstractCegarLoop]: Abstraction has has 161 places, 151 transitions, 833 flow [2020-10-11 18:25:38,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:25:38,857 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:25:38,857 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:38,858 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-11 18:25:38,858 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:38,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:25:38,858 INFO L82 PathProgramCache]: Analyzing trace with hash -922495913, now seen corresponding path program 2 times [2020-10-11 18:25:38,858 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:25:38,859 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474099946] [2020-10-11 18:25:38,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:25:38,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:25:38,995 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:38,995 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474099946] [2020-10-11 18:25:38,996 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:25:38,996 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 18:25:38,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134016118] [2020-10-11 18:25:38,997 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 18:25:38,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:25:38,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 18:25:38,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 18:25:39,237 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 108 [2020-10-11 18:25:39,238 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 151 transitions, 833 flow. Second operand 9 states. [2020-10-11 18:25:39,238 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:25:39,238 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 108 [2020-10-11 18:25:39,238 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:25:40,270 INFO L129 PetriNetUnfolder]: 2042/4593 cut-off events. [2020-10-11 18:25:40,270 INFO L130 PetriNetUnfolder]: For 20963/31949 co-relation queries the response was YES. [2020-10-11 18:25:40,301 INFO L80 FinitePrefix]: Finished finitePrefix Result has 19359 conditions, 4593 events. 2042/4593 cut-off events. For 20963/31949 co-relation queries the response was YES. Maximal size of possible extension queue 762. Compared 46763 event pairs, 0 based on Foata normal form. 513/4529 useless extension candidates. Maximal degree in co-relation 19318. Up to 794 conditions per place. [2020-10-11 18:25:40,314 INFO L132 encePairwiseOnDemand]: 98/108 looper letters, 12 selfloop transitions, 57 changer transitions 20/175 dead transitions. [2020-10-11 18:25:40,314 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 175 transitions, 1240 flow [2020-10-11 18:25:40,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-11 18:25:40,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-11 18:25:40,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1762 transitions. [2020-10-11 18:25:40,317 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9063786008230452 [2020-10-11 18:25:40,317 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1762 transitions. [2020-10-11 18:25:40,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1762 transitions. [2020-10-11 18:25:40,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:25:40,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1762 transitions. [2020-10-11 18:25:40,320 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 19 states. [2020-10-11 18:25:40,323 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 19 states. [2020-10-11 18:25:40,323 INFO L81 ComplementDD]: Finished complementDD. Result 19 states. [2020-10-11 18:25:40,323 INFO L185 Difference]: Start difference. First operand has 161 places, 151 transitions, 833 flow. Second operand 18 states and 1762 transitions. [2020-10-11 18:25:40,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 175 transitions, 1240 flow [2020-10-11 18:25:40,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 175 transitions, 1209 flow, removed 15 selfloop flow, removed 8 redundant places. [2020-10-11 18:25:40,516 INFO L241 Difference]: Finished difference. Result has 173 places, 151 transitions, 936 flow [2020-10-11 18:25:40,516 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=802, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=936, PETRI_PLACES=173, PETRI_TRANSITIONS=151} [2020-10-11 18:25:40,517 INFO L341 CegarLoopForPetriNet]: 115 programPoint places, 58 predicate places. [2020-10-11 18:25:40,517 INFO L481 AbstractCegarLoop]: Abstraction has has 173 places, 151 transitions, 936 flow [2020-10-11 18:25:40,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 18:25:40,517 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:25:40,517 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:40,517 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-11 18:25:40,517 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:40,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:25:40,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1074479481, now seen corresponding path program 1 times [2020-10-11 18:25:40,518 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:25:40,518 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020994834] [2020-10-11 18:25:40,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:25:40,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:25:40,629 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,630 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020994834] [2020-10-11 18:25:40,630 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:25:40,630 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:25:40,630 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484567196] [2020-10-11 18:25:40,631 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:25:40,631 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:25:40,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:25:40,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:25:40,800 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 108 [2020-10-11 18:25:40,801 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 151 transitions, 936 flow. Second operand 7 states. [2020-10-11 18:25:40,801 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:25:40,801 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 108 [2020-10-11 18:25:40,801 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:25:42,328 INFO L129 PetriNetUnfolder]: 2728/7400 cut-off events. [2020-10-11 18:25:42,328 INFO L130 PetriNetUnfolder]: For 34575/38519 co-relation queries the response was YES. [2020-10-11 18:25:42,401 INFO L80 FinitePrefix]: Finished finitePrefix Result has 29168 conditions, 7400 events. 2728/7400 cut-off events. For 34575/38519 co-relation queries the response was YES. Maximal size of possible extension queue 1200. Compared 89047 event pairs, 0 based on Foata normal form. 1/6567 useless extension candidates. Maximal degree in co-relation 29085. Up to 1227 conditions per place. [2020-10-11 18:25:42,409 INFO L132 encePairwiseOnDemand]: 102/108 looper letters, 9 selfloop transitions, 1 changer transitions 54/156 dead transitions. [2020-10-11 18:25:42,409 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 156 transitions, 982 flow [2020-10-11 18:25:42,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 18:25:42,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-11 18:25:42,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 688 transitions. [2020-10-11 18:25:42,410 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.91005291005291 [2020-10-11 18:25:42,411 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 688 transitions. [2020-10-11 18:25:42,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 688 transitions. [2020-10-11 18:25:42,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:25:42,411 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 688 transitions. [2020-10-11 18:25:42,412 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-11 18:25:42,413 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-11 18:25:42,413 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-11 18:25:42,413 INFO L185 Difference]: Start difference. First operand has 173 places, 151 transitions, 936 flow. Second operand 7 states and 688 transitions. [2020-10-11 18:25:42,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 156 transitions, 982 flow [2020-10-11 18:25:43,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 156 transitions, 783 flow, removed 30 selfloop flow, removed 20 redundant places. [2020-10-11 18:25:43,463 INFO L241 Difference]: Finished difference. Result has 162 places, 102 transitions, 376 flow [2020-10-11 18:25:43,464 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=737, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=376, PETRI_PLACES=162, PETRI_TRANSITIONS=102} [2020-10-11 18:25:43,464 INFO L341 CegarLoopForPetriNet]: 115 programPoint places, 47 predicate places. [2020-10-11 18:25:43,464 INFO L481 AbstractCegarLoop]: Abstraction has has 162 places, 102 transitions, 376 flow [2020-10-11 18:25:43,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:25:43,464 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:25:43,464 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:43,465 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-11 18:25:43,465 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:43,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:25:43,465 INFO L82 PathProgramCache]: Analyzing trace with hash -315199525, now seen corresponding path program 2 times [2020-10-11 18:25:43,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:25:43,465 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960388585] [2020-10-11 18:25:43,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:25:43,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:25:43,515 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:25:43,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:25:43,561 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:25:43,630 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-11 18:25:43,631 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-11 18:25:43,631 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-11 18:25:43,689 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:43,689 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:25:43,691 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:43,692 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:25:43,692 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:43,692 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:25:43,692 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:43,692 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:25:43,693 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:43,693 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:25:43,693 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:43,693 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:25:43,694 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:43,694 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:25:43,695 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:43,695 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:25:43,696 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:43,696 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:25:43,696 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:43,696 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:25:43,696 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:43,697 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:25:43,697 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:43,697 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:25:43,699 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:43,699 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:25:43,700 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:43,700 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:25:43,700 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:43,700 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:25:43,700 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:43,700 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:25:43,700 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:43,701 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:25:43,705 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:43,705 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:25:43,706 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:43,706 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:25:43,706 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:43,706 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:25:43,706 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:43,706 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:25:43,707 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:43,707 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:25:43,707 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:43,707 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:25:43,707 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:43,707 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:25:43,707 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:43,707 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:25:43,708 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:43,708 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:25:43,708 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:43,708 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:25:43,708 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:43,708 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:25:43,709 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:43,709 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:25:43,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 06:25:43 BasicIcfg [2020-10-11 18:25:43,860 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-11 18:25:43,862 INFO L168 Benchmark]: Toolchain (without parser) took 22640.24 ms. Allocated memory was 251.1 MB in the beginning and 912.3 MB in the end (delta: 661.1 MB). Free memory was 206.3 MB in the beginning and 417.6 MB in the end (delta: -211.3 MB). Peak memory consumption was 449.8 MB. Max. memory is 14.2 GB. [2020-10-11 18:25:43,863 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 251.1 MB. Free memory is still 227.5 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-11 18:25:43,867 INFO L168 Benchmark]: CACSL2BoogieTranslator took 753.72 ms. Allocated memory was 251.1 MB in the beginning and 313.0 MB in the end (delta: 61.9 MB). Free memory was 206.3 MB in the beginning and 258.8 MB in the end (delta: -52.5 MB). Peak memory consumption was 26.9 MB. Max. memory is 14.2 GB. [2020-10-11 18:25:43,870 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.33 ms. Allocated memory is still 313.0 MB. Free memory was 258.8 MB in the beginning and 256.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:43,870 INFO L168 Benchmark]: Boogie Preprocessor took 39.96 ms. Allocated memory is still 313.0 MB. Free memory was 256.2 MB in the beginning and 253.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:43,875 INFO L168 Benchmark]: RCFGBuilder took 1950.00 ms. Allocated memory was 313.0 MB in the beginning and 358.1 MB in the end (delta: 45.1 MB). Free memory was 253.7 MB in the beginning and 204.1 MB in the end (delta: 49.7 MB). Peak memory consumption was 95.1 MB. Max. memory is 14.2 GB. [2020-10-11 18:25:43,876 INFO L168 Benchmark]: TraceAbstraction took 19818.92 ms. Allocated memory was 358.1 MB in the beginning and 912.3 MB in the end (delta: 554.2 MB). Free memory was 204.1 MB in the beginning and 417.6 MB in the end (delta: -213.5 MB). Peak memory consumption was 340.7 MB. Max. memory is 14.2 GB. [2020-10-11 18:25:43,882 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 251.1 MB. Free memory is still 227.5 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 753.72 ms. Allocated memory was 251.1 MB in the beginning and 313.0 MB in the end (delta: 61.9 MB). Free memory was 206.3 MB in the beginning and 258.8 MB in the end (delta: -52.5 MB). Peak memory consumption was 26.9 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 72.33 ms. Allocated memory is still 313.0 MB. Free memory was 258.8 MB in the beginning and 256.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 39.96 ms. Allocated memory is still 313.0 MB. Free memory was 256.2 MB in the beginning and 253.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 1950.00 ms. Allocated memory was 313.0 MB in the beginning and 358.1 MB in the end (delta: 45.1 MB). Free memory was 253.7 MB in the beginning and 204.1 MB in the end (delta: 49.7 MB). Peak memory consumption was 95.1 MB. Max. memory is 14.2 GB. * TraceAbstraction took 19818.92 ms. Allocated memory was 358.1 MB in the beginning and 912.3 MB in the end (delta: 554.2 MB). Free memory was 204.1 MB in the beginning and 417.6 MB in the end (delta: -213.5 MB). Peak memory consumption was 340.7 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 t1469; 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(&t1469, ((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 t1470; 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(&t1470, ((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 t1471; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=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=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(&t1471, ((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}, 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 t1472; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=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=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(&t1472, ((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}, 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}, 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}, 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}, 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}, 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] [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=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] [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=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=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] [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 [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: 19.4s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 16.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 257 SDtfs, 496 SDslu, 1267 SDs, 0 SdLazy, 1404 SolverSat, 332 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 191 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=995occurred 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, 2.0s InterpolantComputationTime, 966 NumberOfCodeBlocks, 966 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 873 ConstructedInterpolants, 0 QuantifiedInterpolants, 241286 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...