/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe032_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-11 18:45:13,777 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-11 18:45:13,781 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-11 18:45:13,822 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-11 18:45:13,822 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-11 18:45:13,833 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-11 18:45:13,835 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-11 18:45:13,839 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-11 18:45:13,841 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-11 18:45:13,844 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-11 18:45:13,846 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-11 18:45:13,848 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-11 18:45:13,848 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-11 18:45:13,851 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-11 18:45:13,854 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-11 18:45:13,855 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-11 18:45:13,856 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-11 18:45:13,857 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-11 18:45:13,858 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-11 18:45:13,863 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-11 18:45:13,864 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-11 18:45:13,865 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-11 18:45:13,868 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-11 18:45:13,869 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-11 18:45:13,871 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-11 18:45:13,872 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-11 18:45:13,872 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-11 18:45:13,875 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-11 18:45:13,875 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-11 18:45:13,876 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-11 18:45:13,877 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-11 18:45:13,877 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-11 18:45:13,878 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-11 18:45:13,878 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-11 18:45:13,880 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-11 18:45:13,880 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-11 18:45:13,880 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-11 18:45:13,881 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-11 18:45:13,881 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-11 18:45:13,882 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-11 18:45:13,883 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-11 18:45:13,884 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf [2020-10-11 18:45:13,932 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-11 18:45:13,932 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-11 18:45:13,934 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-11 18:45:13,934 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-11 18:45:13,934 INFO L138 SettingsManager]: * Use SBE=true [2020-10-11 18:45:13,934 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-11 18:45:13,935 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-11 18:45:13,935 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-11 18:45:13,935 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-11 18:45:13,935 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-11 18:45:13,936 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-11 18:45:13,937 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-11 18:45:13,937 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-11 18:45:13,937 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-11 18:45:13,937 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-11 18:45:13,938 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-11 18:45:13,938 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-11 18:45:13,938 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-11 18:45:13,938 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-11 18:45:13,938 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-11 18:45:13,939 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-11 18:45:13,939 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 18:45:13,939 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-11 18:45:13,939 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-11 18:45:13,939 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-11 18:45:13,940 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-11 18:45:13,940 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-11 18:45:13,940 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-10-11 18:45:13,940 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-11 18:45:13,940 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-11 18:45:14,216 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-11 18:45:14,225 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-11 18:45:14,229 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-11 18:45:14,230 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-11 18:45:14,233 INFO L275 PluginConnector]: CDTParser initialized [2020-10-11 18:45:14,234 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe032_pso.oepc.i [2020-10-11 18:45:14,305 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72977c1ea/2bf7bb06b26c48a8830205e76ff8f6c0/FLAGb1f2e5326 [2020-10-11 18:45:14,842 INFO L306 CDTParser]: Found 1 translation units. [2020-10-11 18:45:14,843 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe032_pso.oepc.i [2020-10-11 18:45:14,870 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72977c1ea/2bf7bb06b26c48a8830205e76ff8f6c0/FLAGb1f2e5326 [2020-10-11 18:45:15,136 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72977c1ea/2bf7bb06b26c48a8830205e76ff8f6c0 [2020-10-11 18:45:15,148 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-11 18:45:15,150 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-11 18:45:15,151 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-11 18:45:15,153 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-11 18:45:15,157 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-11 18:45:15,158 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:45:15" (1/1) ... [2020-10-11 18:45:15,161 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ebbaf3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:45:15, skipping insertion in model container [2020-10-11 18:45:15,161 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:45:15" (1/1) ... [2020-10-11 18:45:15,170 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-11 18:45:15,235 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-11 18:45:15,828 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:45:15,841 INFO L203 MainTranslator]: Completed pre-run [2020-10-11 18:45:15,945 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:45:16,018 INFO L208 MainTranslator]: Completed translation [2020-10-11 18:45:16,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:45:16 WrapperNode [2020-10-11 18:45:16,019 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-11 18:45:16,020 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-11 18:45:16,020 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-11 18:45:16,020 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-11 18:45:16,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:45:16" (1/1) ... [2020-10-11 18:45:16,052 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:45:16" (1/1) ... [2020-10-11 18:45:16,090 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-11 18:45:16,091 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-11 18:45:16,091 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-11 18:45:16,091 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-11 18:45:16,101 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:45:16" (1/1) ... [2020-10-11 18:45:16,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:45:16" (1/1) ... [2020-10-11 18:45:16,108 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:45:16" (1/1) ... [2020-10-11 18:45:16,108 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:45:16" (1/1) ... [2020-10-11 18:45:16,132 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:45:16" (1/1) ... [2020-10-11 18:45:16,139 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:45:16" (1/1) ... [2020-10-11 18:45:16,161 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:45:16" (1/1) ... [2020-10-11 18:45:16,171 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-11 18:45:16,175 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-11 18:45:16,175 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-11 18:45:16,176 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-11 18:45:16,176 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:45:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 18:45:16,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-11 18:45:16,258 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-11 18:45:16,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-11 18:45:16,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-11 18:45:16,259 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-11 18:45:16,259 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-11 18:45:16,260 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-11 18:45:16,261 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-11 18:45:16,261 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-11 18:45:16,262 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-11 18:45:16,262 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-11 18:45:16,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-11 18:45:16,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-11 18:45:16,265 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-11 18:45:19,672 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-11 18:45:19,673 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-11 18:45:19,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:45:19 BoogieIcfgContainer [2020-10-11 18:45:19,676 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-11 18:45:19,679 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-11 18:45:19,679 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-11 18:45:19,684 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-11 18:45:19,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:45:15" (1/3) ... [2020-10-11 18:45:19,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79910646 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:45:19, skipping insertion in model container [2020-10-11 18:45:19,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:45:16" (2/3) ... [2020-10-11 18:45:19,686 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79910646 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:45:19, skipping insertion in model container [2020-10-11 18:45:19,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:45:19" (3/3) ... [2020-10-11 18:45:19,688 INFO L111 eAbstractionObserver]: Analyzing ICFG safe032_pso.oepc.i [2020-10-11 18:45:19,704 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-11 18:45:19,715 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-11 18:45:19,717 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-11 18:45:19,815 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,816 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,816 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,816 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,817 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,817 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,818 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,818 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,818 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,818 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,818 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,819 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,819 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,819 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,819 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,820 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,820 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,820 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,821 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,821 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,821 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,821 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,822 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,822 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,822 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,822 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,823 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,823 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,823 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,823 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,824 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,824 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,824 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,824 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,825 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,825 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,825 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,825 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,828 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,829 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,829 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,830 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,830 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,830 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,830 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,830 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,830 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,831 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,831 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,831 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,831 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,832 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,832 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,832 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,832 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,832 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,833 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,833 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,833 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,833 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,833 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,833 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,834 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,834 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,834 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,834 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,834 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,834 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,835 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,835 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,835 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,835 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,835 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,835 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,836 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,836 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,836 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,836 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,836 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,836 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,837 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,837 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,837 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,837 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,837 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,837 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,838 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,838 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,838 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,840 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,840 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,841 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,841 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,841 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,843 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,843 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,844 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,844 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,844 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,844 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,844 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,844 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,845 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,845 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,845 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,845 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,846 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,846 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,846 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,846 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,847 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,847 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,848 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,852 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,853 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,853 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,853 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,853 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,854 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,854 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,854 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,854 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,855 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,855 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,855 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,856 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,856 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,856 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,857 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,857 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,857 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,857 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,858 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,858 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,858 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,859 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,859 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,859 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,860 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,860 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,864 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,864 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,865 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,865 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,865 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,866 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,866 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,866 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,867 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,867 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,867 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,867 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,868 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,868 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,868 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,868 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,869 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,869 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,869 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,870 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,870 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,870 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,870 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,871 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,871 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,871 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,872 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,872 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,872 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,873 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,873 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,873 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,873 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,874 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,874 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,874 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,875 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,875 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,875 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,877 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,878 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,878 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,879 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,879 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,879 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,880 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,880 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,880 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,880 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,881 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,881 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:19,900 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-11 18:45:19,924 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 18:45:19,925 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-11 18:45:19,925 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 18:45:19,925 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 18:45:19,925 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 18:45:19,925 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 18:45:19,926 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 18:45:19,926 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 18:45:19,941 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 199 flow [2020-10-11 18:45:19,988 INFO L129 PetriNetUnfolder]: 2/89 cut-off events. [2020-10-11 18:45:19,988 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:45:19,993 INFO L80 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-11 18:45:19,994 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 92 transitions, 199 flow [2020-10-11 18:45:20,001 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 89 transitions, 187 flow [2020-10-11 18:45:20,018 INFO L129 PetriNetUnfolder]: 0/56 cut-off events. [2020-10-11 18:45:20,019 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:45:20,019 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:45:20,020 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:45:20,021 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:45:20,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:45:20,028 INFO L82 PathProgramCache]: Analyzing trace with hash 546711899, now seen corresponding path program 1 times [2020-10-11 18:45:20,039 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:45:20,039 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246909652] [2020-10-11 18:45:20,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:45:20,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:45:20,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:45:20,359 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246909652] [2020-10-11 18:45:20,360 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:45:20,360 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 18:45:20,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175997151] [2020-10-11 18:45:20,373 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 18:45:20,374 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:45:20,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 18:45:20,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 18:45:20,527 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 92 [2020-10-11 18:45:20,529 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 89 transitions, 187 flow. Second operand 3 states. [2020-10-11 18:45:20,529 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:45:20,529 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 92 [2020-10-11 18:45:20,531 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:45:20,562 INFO L129 PetriNetUnfolder]: 0/86 cut-off events. [2020-10-11 18:45:20,562 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:45:20,563 INFO L80 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 86 events. 0/86 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 63 event pairs, 0 based on Foata normal form. 4/88 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2020-10-11 18:45:20,564 INFO L132 encePairwiseOnDemand]: 87/92 looper letters, 0 selfloop transitions, 2 changer transitions 11/86 dead transitions. [2020-10-11 18:45:20,564 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 86 transitions, 185 flow [2020-10-11 18:45:20,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 18:45:20,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-11 18:45:20,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 268 transitions. [2020-10-11 18:45:20,581 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9710144927536232 [2020-10-11 18:45:20,582 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 268 transitions. [2020-10-11 18:45:20,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 268 transitions. [2020-10-11 18:45:20,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:45:20,588 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 268 transitions. [2020-10-11 18:45:20,592 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-11 18:45:20,598 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-11 18:45:20,598 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-11 18:45:20,601 INFO L185 Difference]: Start difference. First operand has 97 places, 89 transitions, 187 flow. Second operand 3 states and 268 transitions. [2020-10-11 18:45:20,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 86 transitions, 185 flow [2020-10-11 18:45:20,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 86 transitions, 182 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-11 18:45:20,611 INFO L241 Difference]: Finished difference. Result has 95 places, 75 transitions, 160 flow [2020-10-11 18:45:20,614 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=95, PETRI_TRANSITIONS=75} [2020-10-11 18:45:20,615 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, -2 predicate places. [2020-10-11 18:45:20,615 INFO L481 AbstractCegarLoop]: Abstraction has has 95 places, 75 transitions, 160 flow [2020-10-11 18:45:20,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 18:45:20,616 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:45:20,616 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:45:20,616 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-11 18:45:20,616 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:45:20,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:45:20,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1437305828, now seen corresponding path program 1 times [2020-10-11 18:45:20,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:45:20,617 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522076271] [2020-10-11 18:45:20,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:45:20,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:45:20,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:45:20,930 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522076271] [2020-10-11 18:45:20,931 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:45:20,931 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:45:20,931 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023117185] [2020-10-11 18:45:20,936 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:45:20,936 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:45:20,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:45:20,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:45:21,100 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 92 [2020-10-11 18:45:21,101 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 75 transitions, 160 flow. Second operand 6 states. [2020-10-11 18:45:21,101 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:45:21,101 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 92 [2020-10-11 18:45:21,101 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:45:21,295 INFO L129 PetriNetUnfolder]: 24/148 cut-off events. [2020-10-11 18:45:21,295 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:45:21,299 INFO L80 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 148 events. 24/148 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 430 event pairs, 5 based on Foata normal form. 4/150 useless extension candidates. Maximal degree in co-relation 178. Up to 31 conditions per place. [2020-10-11 18:45:21,300 INFO L132 encePairwiseOnDemand]: 85/92 looper letters, 8 selfloop transitions, 3 changer transitions 19/96 dead transitions. [2020-10-11 18:45:21,300 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 96 transitions, 262 flow [2020-10-11 18:45:21,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:45:21,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:45:21,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 761 transitions. [2020-10-11 18:45:21,310 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9190821256038647 [2020-10-11 18:45:21,310 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 761 transitions. [2020-10-11 18:45:21,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 761 transitions. [2020-10-11 18:45:21,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:45:21,312 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 761 transitions. [2020-10-11 18:45:21,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:45:21,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:45:21,319 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:45:21,319 INFO L185 Difference]: Start difference. First operand has 95 places, 75 transitions, 160 flow. Second operand 9 states and 761 transitions. [2020-10-11 18:45:21,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 96 transitions, 262 flow [2020-10-11 18:45:21,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 96 transitions, 258 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-11 18:45:21,325 INFO L241 Difference]: Finished difference. Result has 97 places, 77 transitions, 199 flow [2020-10-11 18:45:21,325 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=199, PETRI_PLACES=97, PETRI_TRANSITIONS=77} [2020-10-11 18:45:21,326 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 0 predicate places. [2020-10-11 18:45:21,326 INFO L481 AbstractCegarLoop]: Abstraction has has 97 places, 77 transitions, 199 flow [2020-10-11 18:45:21,326 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:45:21,326 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:45:21,327 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] [2020-10-11 18:45:21,327 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-11 18:45:21,327 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:45:21,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:45:21,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1974773853, now seen corresponding path program 1 times [2020-10-11 18:45:21,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:45:21,329 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735228435] [2020-10-11 18:45:21,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:45:21,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:45:21,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:45:21,618 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735228435] [2020-10-11 18:45:21,619 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:45:21,619 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:45:21,619 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128437307] [2020-10-11 18:45:21,620 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:45:21,620 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:45:21,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:45:21,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:45:21,804 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 92 [2020-10-11 18:45:21,805 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 77 transitions, 199 flow. Second operand 6 states. [2020-10-11 18:45:21,805 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:45:21,805 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 92 [2020-10-11 18:45:21,805 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:45:22,027 INFO L129 PetriNetUnfolder]: 28/171 cut-off events. [2020-10-11 18:45:22,027 INFO L130 PetriNetUnfolder]: For 172/173 co-relation queries the response was YES. [2020-10-11 18:45:22,029 INFO L80 FinitePrefix]: Finished finitePrefix Result has 372 conditions, 171 events. 28/171 cut-off events. For 172/173 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 535 event pairs, 9 based on Foata normal form. 6/172 useless extension candidates. Maximal degree in co-relation 337. Up to 31 conditions per place. [2020-10-11 18:45:22,030 INFO L132 encePairwiseOnDemand]: 86/92 looper letters, 6 selfloop transitions, 2 changer transitions 10/87 dead transitions. [2020-10-11 18:45:22,030 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 87 transitions, 273 flow [2020-10-11 18:45:22,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:45:22,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:45:22,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 758 transitions. [2020-10-11 18:45:22,033 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9154589371980676 [2020-10-11 18:45:22,034 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 758 transitions. [2020-10-11 18:45:22,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 758 transitions. [2020-10-11 18:45:22,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:45:22,035 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 758 transitions. [2020-10-11 18:45:22,036 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:45:22,038 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:45:22,038 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:45:22,038 INFO L185 Difference]: Start difference. First operand has 97 places, 77 transitions, 199 flow. Second operand 9 states and 758 transitions. [2020-10-11 18:45:22,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 87 transitions, 273 flow [2020-10-11 18:45:22,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 87 transitions, 256 flow, removed 7 selfloop flow, removed 4 redundant places. [2020-10-11 18:45:22,043 INFO L241 Difference]: Finished difference. Result has 102 places, 77 transitions, 210 flow [2020-10-11 18:45:22,044 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=210, PETRI_PLACES=102, PETRI_TRANSITIONS=77} [2020-10-11 18:45:22,044 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 5 predicate places. [2020-10-11 18:45:22,044 INFO L481 AbstractCegarLoop]: Abstraction has has 102 places, 77 transitions, 210 flow [2020-10-11 18:45:22,044 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:45:22,044 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:45:22,045 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:45:22,045 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-11 18:45:22,045 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:45:22,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:45:22,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1417914563, now seen corresponding path program 1 times [2020-10-11 18:45:22,046 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:45:22,046 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042815926] [2020-10-11 18:45:22,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:45:22,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:45:22,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:45:22,386 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042815926] [2020-10-11 18:45:22,387 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:45:22,387 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 18:45:22,387 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992548666] [2020-10-11 18:45:22,387 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 18:45:22,388 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:45:22,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 18:45:22,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-10-11 18:45:22,864 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 92 [2020-10-11 18:45:22,865 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 77 transitions, 210 flow. Second operand 10 states. [2020-10-11 18:45:22,865 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:45:22,866 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 92 [2020-10-11 18:45:22,866 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:45:23,555 INFO L129 PetriNetUnfolder]: 339/769 cut-off events. [2020-10-11 18:45:23,556 INFO L130 PetriNetUnfolder]: For 801/801 co-relation queries the response was YES. [2020-10-11 18:45:23,561 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1888 conditions, 769 events. 339/769 cut-off events. For 801/801 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3930 event pairs, 65 based on Foata normal form. 16/763 useless extension candidates. Maximal degree in co-relation 1832. Up to 321 conditions per place. [2020-10-11 18:45:23,567 INFO L132 encePairwiseOnDemand]: 80/92 looper letters, 21 selfloop transitions, 10 changer transitions 25/115 dead transitions. [2020-10-11 18:45:23,567 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 115 transitions, 429 flow [2020-10-11 18:45:23,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 18:45:23,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-11 18:45:23,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 981 transitions. [2020-10-11 18:45:23,571 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8202341137123745 [2020-10-11 18:45:23,571 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 981 transitions. [2020-10-11 18:45:23,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 981 transitions. [2020-10-11 18:45:23,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:45:23,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 981 transitions. [2020-10-11 18:45:23,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-11 18:45:23,577 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-11 18:45:23,577 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-11 18:45:23,577 INFO L185 Difference]: Start difference. First operand has 102 places, 77 transitions, 210 flow. Second operand 13 states and 981 transitions. [2020-10-11 18:45:23,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 115 transitions, 429 flow [2020-10-11 18:45:23,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 115 transitions, 395 flow, removed 14 selfloop flow, removed 8 redundant places. [2020-10-11 18:45:23,587 INFO L241 Difference]: Finished difference. Result has 109 places, 83 transitions, 260 flow [2020-10-11 18:45:23,587 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=260, PETRI_PLACES=109, PETRI_TRANSITIONS=83} [2020-10-11 18:45:23,588 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 12 predicate places. [2020-10-11 18:45:23,588 INFO L481 AbstractCegarLoop]: Abstraction has has 109 places, 83 transitions, 260 flow [2020-10-11 18:45:23,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 18:45:23,588 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:45:23,588 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] [2020-10-11 18:45:23,588 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-11 18:45:23,589 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:45:23,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:45:23,589 INFO L82 PathProgramCache]: Analyzing trace with hash -2017494161, now seen corresponding path program 1 times [2020-10-11 18:45:23,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:45:23,590 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948079825] [2020-10-11 18:45:23,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:45:23,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:45:23,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:45:23,751 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948079825] [2020-10-11 18:45:23,751 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:45:23,751 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:45:23,752 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757053385] [2020-10-11 18:45:23,752 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:45:23,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:45:23,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:45:23,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:45:23,873 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 92 [2020-10-11 18:45:23,874 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 83 transitions, 260 flow. Second operand 6 states. [2020-10-11 18:45:23,874 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:45:23,874 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 92 [2020-10-11 18:45:23,874 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:45:24,040 INFO L129 PetriNetUnfolder]: 36/325 cut-off events. [2020-10-11 18:45:24,041 INFO L130 PetriNetUnfolder]: For 350/363 co-relation queries the response was YES. [2020-10-11 18:45:24,043 INFO L80 FinitePrefix]: Finished finitePrefix Result has 702 conditions, 325 events. 36/325 cut-off events. For 350/363 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1716 event pairs, 11 based on Foata normal form. 4/318 useless extension candidates. Maximal degree in co-relation 644. Up to 45 conditions per place. [2020-10-11 18:45:24,045 INFO L132 encePairwiseOnDemand]: 86/92 looper letters, 13 selfloop transitions, 6 changer transitions 6/97 dead transitions. [2020-10-11 18:45:24,045 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 97 transitions, 410 flow [2020-10-11 18:45:24,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:45:24,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:45:24,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 755 transitions. [2020-10-11 18:45:24,049 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9118357487922706 [2020-10-11 18:45:24,049 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 755 transitions. [2020-10-11 18:45:24,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 755 transitions. [2020-10-11 18:45:24,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:45:24,050 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 755 transitions. [2020-10-11 18:45:24,052 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:45:24,054 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:45:24,054 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:45:24,054 INFO L185 Difference]: Start difference. First operand has 109 places, 83 transitions, 260 flow. Second operand 9 states and 755 transitions. [2020-10-11 18:45:24,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 97 transitions, 410 flow [2020-10-11 18:45:24,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 97 transitions, 354 flow, removed 24 selfloop flow, removed 9 redundant places. [2020-10-11 18:45:24,059 INFO L241 Difference]: Finished difference. Result has 109 places, 86 transitions, 289 flow [2020-10-11 18:45:24,059 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=289, PETRI_PLACES=109, PETRI_TRANSITIONS=86} [2020-10-11 18:45:24,060 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 12 predicate places. [2020-10-11 18:45:24,060 INFO L481 AbstractCegarLoop]: Abstraction has has 109 places, 86 transitions, 289 flow [2020-10-11 18:45:24,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:45:24,060 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:45:24,060 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:45:24,060 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-11 18:45:24,061 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:45:24,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:45:24,061 INFO L82 PathProgramCache]: Analyzing trace with hash 322285659, now seen corresponding path program 1 times [2020-10-11 18:45:24,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:45:24,062 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838632388] [2020-10-11 18:45:24,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:45:24,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:45:24,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:45:24,482 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838632388] [2020-10-11 18:45:24,482 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:45:24,482 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-10-11 18:45:24,482 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219348255] [2020-10-11 18:45:24,483 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-11 18:45:24,483 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:45:24,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-11 18:45:24,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2020-10-11 18:45:26,916 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 92 [2020-10-11 18:45:26,917 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 86 transitions, 289 flow. Second operand 13 states. [2020-10-11 18:45:26,917 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:45:26,917 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 92 [2020-10-11 18:45:26,918 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:45:27,689 INFO L129 PetriNetUnfolder]: 594/1396 cut-off events. [2020-10-11 18:45:27,689 INFO L130 PetriNetUnfolder]: For 2060/2368 co-relation queries the response was YES. [2020-10-11 18:45:27,696 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3719 conditions, 1396 events. 594/1396 cut-off events. For 2060/2368 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 9033 event pairs, 66 based on Foata normal form. 30/1376 useless extension candidates. Maximal degree in co-relation 3656. Up to 564 conditions per place. [2020-10-11 18:45:27,702 INFO L132 encePairwiseOnDemand]: 77/92 looper letters, 29 selfloop transitions, 15 changer transitions 33/133 dead transitions. [2020-10-11 18:45:27,703 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 133 transitions, 638 flow [2020-10-11 18:45:27,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 18:45:27,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-11 18:45:27,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1086 transitions. [2020-10-11 18:45:27,707 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.7869565217391304 [2020-10-11 18:45:27,707 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1086 transitions. [2020-10-11 18:45:27,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1086 transitions. [2020-10-11 18:45:27,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:45:27,708 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1086 transitions. [2020-10-11 18:45:27,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-11 18:45:27,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-11 18:45:27,714 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-11 18:45:27,715 INFO L185 Difference]: Start difference. First operand has 109 places, 86 transitions, 289 flow. Second operand 15 states and 1086 transitions. [2020-10-11 18:45:27,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 133 transitions, 638 flow [2020-10-11 18:45:27,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 133 transitions, 599 flow, removed 18 selfloop flow, removed 4 redundant places. [2020-10-11 18:45:27,727 INFO L241 Difference]: Finished difference. Result has 124 places, 87 transitions, 335 flow [2020-10-11 18:45:27,728 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=335, PETRI_PLACES=124, PETRI_TRANSITIONS=87} [2020-10-11 18:45:27,728 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 27 predicate places. [2020-10-11 18:45:27,728 INFO L481 AbstractCegarLoop]: Abstraction has has 124 places, 87 transitions, 335 flow [2020-10-11 18:45:27,729 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-11 18:45:27,729 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:45:27,729 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:45:27,729 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-11 18:45:27,729 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:45:27,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:45:27,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1812909317, now seen corresponding path program 2 times [2020-10-11 18:45:27,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:45:27,730 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772880175] [2020-10-11 18:45:27,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:45:27,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:45:28,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:45:28,161 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772880175] [2020-10-11 18:45:28,161 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:45:28,162 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-10-11 18:45:28,162 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149146134] [2020-10-11 18:45:28,162 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-11 18:45:28,163 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:45:28,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-11 18:45:28,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2020-10-11 18:45:29,341 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 92 [2020-10-11 18:45:29,342 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 87 transitions, 335 flow. Second operand 15 states. [2020-10-11 18:45:29,343 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:45:29,343 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 92 [2020-10-11 18:45:29,343 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:45:30,471 INFO L129 PetriNetUnfolder]: 539/1305 cut-off events. [2020-10-11 18:45:30,471 INFO L130 PetriNetUnfolder]: For 4998/5505 co-relation queries the response was YES. [2020-10-11 18:45:30,481 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4921 conditions, 1305 events. 539/1305 cut-off events. For 4998/5505 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 8482 event pairs, 64 based on Foata normal form. 50/1302 useless extension candidates. Maximal degree in co-relation 4847. Up to 524 conditions per place. [2020-10-11 18:45:30,489 INFO L132 encePairwiseOnDemand]: 75/92 looper letters, 26 selfloop transitions, 22 changer transitions 26/130 dead transitions. [2020-10-11 18:45:30,490 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 130 transitions, 804 flow [2020-10-11 18:45:30,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-11 18:45:30,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-10-11 18:45:30,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1222 transitions. [2020-10-11 18:45:30,495 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.7813299232736572 [2020-10-11 18:45:30,495 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1222 transitions. [2020-10-11 18:45:30,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1222 transitions. [2020-10-11 18:45:30,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:45:30,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1222 transitions. [2020-10-11 18:45:30,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 18 states. [2020-10-11 18:45:30,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 18 states. [2020-10-11 18:45:30,503 INFO L81 ComplementDD]: Finished complementDD. Result 18 states. [2020-10-11 18:45:30,504 INFO L185 Difference]: Start difference. First operand has 124 places, 87 transitions, 335 flow. Second operand 17 states and 1222 transitions. [2020-10-11 18:45:30,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 130 transitions, 804 flow [2020-10-11 18:45:30,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 130 transitions, 754 flow, removed 16 selfloop flow, removed 11 redundant places. [2020-10-11 18:45:30,520 INFO L241 Difference]: Finished difference. Result has 127 places, 96 transitions, 456 flow [2020-10-11 18:45:30,520 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=456, PETRI_PLACES=127, PETRI_TRANSITIONS=96} [2020-10-11 18:45:30,520 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 30 predicate places. [2020-10-11 18:45:30,520 INFO L481 AbstractCegarLoop]: Abstraction has has 127 places, 96 transitions, 456 flow [2020-10-11 18:45:30,521 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-11 18:45:30,521 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:45:30,521 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:45:30,521 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-11 18:45:30,521 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:45:30,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:45:30,522 INFO L82 PathProgramCache]: Analyzing trace with hash 18595423, now seen corresponding path program 3 times [2020-10-11 18:45:30,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:45:30,522 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627558374] [2020-10-11 18:45:30,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:45:30,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:45:30,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:45:30,969 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627558374] [2020-10-11 18:45:30,970 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:45:30,970 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-10-11 18:45:30,970 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275574973] [2020-10-11 18:45:30,970 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-11 18:45:30,971 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:45:30,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-11 18:45:30,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2020-10-11 18:45:33,466 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 92 [2020-10-11 18:45:33,468 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 96 transitions, 456 flow. Second operand 13 states. [2020-10-11 18:45:33,468 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:45:33,468 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 92 [2020-10-11 18:45:33,468 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:45:34,648 INFO L129 PetriNetUnfolder]: 472/1331 cut-off events. [2020-10-11 18:45:34,649 INFO L130 PetriNetUnfolder]: For 9489/10030 co-relation queries the response was YES. [2020-10-11 18:45:34,658 INFO L80 FinitePrefix]: Finished finitePrefix Result has 6326 conditions, 1331 events. 472/1331 cut-off events. For 9489/10030 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 9333 event pairs, 69 based on Foata normal form. 109/1399 useless extension candidates. Maximal degree in co-relation 6250. Up to 547 conditions per place. [2020-10-11 18:45:34,667 INFO L132 encePairwiseOnDemand]: 77/92 looper letters, 26 selfloop transitions, 28 changer transitions 28/141 dead transitions. [2020-10-11 18:45:34,667 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 141 transitions, 1169 flow [2020-10-11 18:45:34,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 18:45:34,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-11 18:45:34,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1097 transitions. [2020-10-11 18:45:34,671 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.7949275362318841 [2020-10-11 18:45:34,671 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1097 transitions. [2020-10-11 18:45:34,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1097 transitions. [2020-10-11 18:45:34,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:45:34,673 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1097 transitions. [2020-10-11 18:45:34,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-11 18:45:34,677 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-11 18:45:34,678 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-11 18:45:34,678 INFO L185 Difference]: Start difference. First operand has 127 places, 96 transitions, 456 flow. Second operand 15 states and 1097 transitions. [2020-10-11 18:45:34,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 141 transitions, 1169 flow [2020-10-11 18:45:34,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 141 transitions, 1120 flow, removed 17 selfloop flow, removed 10 redundant places. [2020-10-11 18:45:34,693 INFO L241 Difference]: Finished difference. Result has 134 places, 108 transitions, 692 flow [2020-10-11 18:45:34,693 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=692, PETRI_PLACES=134, PETRI_TRANSITIONS=108} [2020-10-11 18:45:34,693 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 37 predicate places. [2020-10-11 18:45:34,694 INFO L481 AbstractCegarLoop]: Abstraction has has 134 places, 108 transitions, 692 flow [2020-10-11 18:45:34,694 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-11 18:45:34,694 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:45:34,694 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:45:34,694 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-11 18:45:34,694 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:45:34,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:45:34,695 INFO L82 PathProgramCache]: Analyzing trace with hash -2061189151, now seen corresponding path program 1 times [2020-10-11 18:45:34,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:45:34,695 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685317416] [2020-10-11 18:45:34,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:45:34,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:45:34,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:45:34,934 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685317416] [2020-10-11 18:45:34,934 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:45:34,934 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-11 18:45:34,934 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660194829] [2020-10-11 18:45:34,935 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 18:45:34,935 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:45:34,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 18:45:34,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-10-11 18:45:36,616 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 92 [2020-10-11 18:45:36,617 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 108 transitions, 692 flow. Second operand 11 states. [2020-10-11 18:45:36,617 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:45:36,617 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 92 [2020-10-11 18:45:36,617 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:45:37,350 INFO L129 PetriNetUnfolder]: 427/1132 cut-off events. [2020-10-11 18:45:37,351 INFO L130 PetriNetUnfolder]: For 16042/16948 co-relation queries the response was YES. [2020-10-11 18:45:37,359 INFO L80 FinitePrefix]: Finished finitePrefix Result has 6916 conditions, 1132 events. 427/1132 cut-off events. For 16042/16948 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 7668 event pairs, 62 based on Foata normal form. 82/1171 useless extension candidates. Maximal degree in co-relation 6836. Up to 482 conditions per place. [2020-10-11 18:45:37,370 INFO L132 encePairwiseOnDemand]: 77/92 looper letters, 54 selfloop transitions, 38 changer transitions 18/166 dead transitions. [2020-10-11 18:45:37,371 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 166 transitions, 1691 flow [2020-10-11 18:45:37,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 18:45:37,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-11 18:45:37,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1083 transitions. [2020-10-11 18:45:37,376 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.7847826086956522 [2020-10-11 18:45:37,376 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1083 transitions. [2020-10-11 18:45:37,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1083 transitions. [2020-10-11 18:45:37,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:45:37,378 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1083 transitions. [2020-10-11 18:45:37,381 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-11 18:45:37,385 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-11 18:45:37,385 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-11 18:45:37,385 INFO L185 Difference]: Start difference. First operand has 134 places, 108 transitions, 692 flow. Second operand 15 states and 1083 transitions. [2020-10-11 18:45:37,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 166 transitions, 1691 flow [2020-10-11 18:45:37,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 166 transitions, 1444 flow, removed 120 selfloop flow, removed 13 redundant places. [2020-10-11 18:45:37,411 INFO L241 Difference]: Finished difference. Result has 136 places, 132 transitions, 1026 flow [2020-10-11 18:45:37,411 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=599, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1026, PETRI_PLACES=136, PETRI_TRANSITIONS=132} [2020-10-11 18:45:37,412 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 39 predicate places. [2020-10-11 18:45:37,412 INFO L481 AbstractCegarLoop]: Abstraction has has 136 places, 132 transitions, 1026 flow [2020-10-11 18:45:37,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 18:45:37,412 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:45:37,412 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:45:37,412 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-11 18:45:37,412 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:45:37,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:45:37,413 INFO L82 PathProgramCache]: Analyzing trace with hash 538268173, now seen corresponding path program 2 times [2020-10-11 18:45:37,413 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:45:37,413 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206450955] [2020-10-11 18:45:37,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:45:37,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:45:37,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:45:37,758 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206450955] [2020-10-11 18:45:37,759 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:45:37,759 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-10-11 18:45:37,759 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691313746] [2020-10-11 18:45:37,760 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-11 18:45:37,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:45:37,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-11 18:45:37,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2020-10-11 18:45:40,663 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 92 [2020-10-11 18:45:40,664 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 132 transitions, 1026 flow. Second operand 15 states. [2020-10-11 18:45:40,664 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:45:40,665 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 92 [2020-10-11 18:45:40,665 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:45:42,056 INFO L129 PetriNetUnfolder]: 497/1328 cut-off events. [2020-10-11 18:45:42,057 INFO L130 PetriNetUnfolder]: For 11421/13105 co-relation queries the response was YES. [2020-10-11 18:45:42,066 INFO L80 FinitePrefix]: Finished finitePrefix Result has 7245 conditions, 1328 events. 497/1328 cut-off events. For 11421/13105 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 9493 event pairs, 51 based on Foata normal form. 244/1532 useless extension candidates. Maximal degree in co-relation 7163. Up to 565 conditions per place. [2020-10-11 18:45:42,074 INFO L132 encePairwiseOnDemand]: 75/92 looper letters, 52 selfloop transitions, 61 changer transitions 43/211 dead transitions. [2020-10-11 18:45:42,075 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 211 transitions, 2302 flow [2020-10-11 18:45:42,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-10-11 18:45:42,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-10-11 18:45:42,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1848 transitions. [2020-10-11 18:45:42,081 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.7725752508361204 [2020-10-11 18:45:42,081 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 1848 transitions. [2020-10-11 18:45:42,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 1848 transitions. [2020-10-11 18:45:42,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:45:42,082 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 1848 transitions. [2020-10-11 18:45:42,085 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 27 states. [2020-10-11 18:45:42,089 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 27 states. [2020-10-11 18:45:42,089 INFO L81 ComplementDD]: Finished complementDD. Result 27 states. [2020-10-11 18:45:42,090 INFO L185 Difference]: Start difference. First operand has 136 places, 132 transitions, 1026 flow. Second operand 26 states and 1848 transitions. [2020-10-11 18:45:42,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 211 transitions, 2302 flow [2020-10-11 18:45:42,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 211 transitions, 2219 flow, removed 38 selfloop flow, removed 7 redundant places. [2020-10-11 18:45:42,114 INFO L241 Difference]: Finished difference. Result has 166 places, 154 transitions, 1463 flow [2020-10-11 18:45:42,115 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=957, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=1463, PETRI_PLACES=166, PETRI_TRANSITIONS=154} [2020-10-11 18:45:42,115 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 69 predicate places. [2020-10-11 18:45:42,115 INFO L481 AbstractCegarLoop]: Abstraction has has 166 places, 154 transitions, 1463 flow [2020-10-11 18:45:42,115 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-11 18:45:42,116 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:45:42,116 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:45:42,116 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-11 18:45:42,116 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:45:42,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:45:42,116 INFO L82 PathProgramCache]: Analyzing trace with hash 266930695, now seen corresponding path program 1 times [2020-10-11 18:45:42,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:45:42,117 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249170518] [2020-10-11 18:45:42,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:45:42,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:45:42,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:45:42,861 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249170518] [2020-10-11 18:45:42,861 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:45:42,861 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-10-11 18:45:42,861 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417087948] [2020-10-11 18:45:42,862 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-11 18:45:42,862 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:45:42,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-11 18:45:42,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2020-10-11 18:45:46,461 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 92 [2020-10-11 18:45:46,463 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 154 transitions, 1463 flow. Second operand 17 states. [2020-10-11 18:45:46,463 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:45:46,463 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 92 [2020-10-11 18:45:46,463 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:45:47,073 INFO L129 PetriNetUnfolder]: 467/1213 cut-off events. [2020-10-11 18:45:47,073 INFO L130 PetriNetUnfolder]: For 22363/24003 co-relation queries the response was YES. [2020-10-11 18:45:47,082 INFO L80 FinitePrefix]: Finished finitePrefix Result has 8427 conditions, 1213 events. 467/1213 cut-off events. For 22363/24003 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 8212 event pairs, 70 based on Foata normal form. 119/1277 useless extension candidates. Maximal degree in co-relation 8329. Up to 610 conditions per place. [2020-10-11 18:45:47,091 INFO L132 encePairwiseOnDemand]: 77/92 looper letters, 68 selfloop transitions, 39 changer transitions 29/191 dead transitions. [2020-10-11 18:45:47,091 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 191 transitions, 2350 flow [2020-10-11 18:45:47,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 18:45:47,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-11 18:45:47,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 919 transitions. [2020-10-11 18:45:47,093 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.7683946488294314 [2020-10-11 18:45:47,093 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 919 transitions. [2020-10-11 18:45:47,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 919 transitions. [2020-10-11 18:45:47,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:45:47,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 919 transitions. [2020-10-11 18:45:47,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-11 18:45:47,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-11 18:45:47,097 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-11 18:45:47,097 INFO L185 Difference]: Start difference. First operand has 166 places, 154 transitions, 1463 flow. Second operand 13 states and 919 transitions. [2020-10-11 18:45:47,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 191 transitions, 2350 flow [2020-10-11 18:45:47,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 191 transitions, 2107 flow, removed 97 selfloop flow, removed 17 redundant places. [2020-10-11 18:45:47,141 INFO L241 Difference]: Finished difference. Result has 155 places, 154 transitions, 1492 flow [2020-10-11 18:45:47,142 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=1320, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1492, PETRI_PLACES=155, PETRI_TRANSITIONS=154} [2020-10-11 18:45:47,142 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 58 predicate places. [2020-10-11 18:45:47,142 INFO L481 AbstractCegarLoop]: Abstraction has has 155 places, 154 transitions, 1492 flow [2020-10-11 18:45:47,142 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-11 18:45:47,142 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:45:47,143 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:45:47,143 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-11 18:45:47,143 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:45:47,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:45:47,143 INFO L82 PathProgramCache]: Analyzing trace with hash -2125812619, now seen corresponding path program 3 times [2020-10-11 18:45:47,144 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:45:47,144 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806561977] [2020-10-11 18:45:47,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:45:47,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:45:47,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:45:47,517 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806561977] [2020-10-11 18:45:47,517 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:45:47,518 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-10-11 18:45:47,518 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583182638] [2020-10-11 18:45:47,518 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-11 18:45:47,519 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:45:47,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-11 18:45:47,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2020-10-11 18:45:50,055 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 92 [2020-10-11 18:45:50,055 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 154 transitions, 1492 flow. Second operand 13 states. [2020-10-11 18:45:50,056 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:45:50,056 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 92 [2020-10-11 18:45:50,056 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:45:50,755 INFO L129 PetriNetUnfolder]: 474/1261 cut-off events. [2020-10-11 18:45:50,755 INFO L130 PetriNetUnfolder]: For 15037/16285 co-relation queries the response was YES. [2020-10-11 18:45:50,761 INFO L80 FinitePrefix]: Finished finitePrefix Result has 7770 conditions, 1261 events. 474/1261 cut-off events. For 15037/16285 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 8961 event pairs, 71 based on Foata normal form. 123/1334 useless extension candidates. Maximal degree in co-relation 7681. Up to 579 conditions per place. [2020-10-11 18:45:50,769 INFO L132 encePairwiseOnDemand]: 79/92 looper letters, 83 selfloop transitions, 20 changer transitions 34/194 dead transitions. [2020-10-11 18:45:50,769 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 194 transitions, 2359 flow [2020-10-11 18:45:50,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 18:45:50,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-11 18:45:50,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 885 transitions. [2020-10-11 18:45:50,772 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8016304347826086 [2020-10-11 18:45:50,772 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 885 transitions. [2020-10-11 18:45:50,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 885 transitions. [2020-10-11 18:45:50,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:45:50,772 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 885 transitions. [2020-10-11 18:45:50,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-11 18:45:50,775 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-11 18:45:50,775 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-11 18:45:50,775 INFO L185 Difference]: Start difference. First operand has 155 places, 154 transitions, 1492 flow. Second operand 12 states and 885 transitions. [2020-10-11 18:45:50,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 194 transitions, 2359 flow [2020-10-11 18:45:50,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 194 transitions, 2149 flow, removed 65 selfloop flow, removed 15 redundant places. [2020-10-11 18:45:50,809 INFO L241 Difference]: Finished difference. Result has 154 places, 155 transitions, 1419 flow [2020-10-11 18:45:50,810 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=1343, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1419, PETRI_PLACES=154, PETRI_TRANSITIONS=155} [2020-10-11 18:45:50,810 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 57 predicate places. [2020-10-11 18:45:50,810 INFO L481 AbstractCegarLoop]: Abstraction has has 154 places, 155 transitions, 1419 flow [2020-10-11 18:45:50,810 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-11 18:45:50,810 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:45:50,811 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:45:50,811 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-11 18:45:50,811 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:45:50,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:45:50,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1794648935, now seen corresponding path program 4 times [2020-10-11 18:45:50,812 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:45:50,812 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409195908] [2020-10-11 18:45:50,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:45:50,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:45:51,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:45:51,090 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409195908] [2020-10-11 18:45:51,090 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:45:51,090 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 18:45:51,090 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521759371] [2020-10-11 18:45:51,091 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 18:45:51,091 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:45:51,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 18:45:51,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-10-11 18:45:52,468 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 92 [2020-10-11 18:45:52,468 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 155 transitions, 1419 flow. Second operand 10 states. [2020-10-11 18:45:52,469 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:45:52,469 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 92 [2020-10-11 18:45:52,469 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:45:53,100 INFO L129 PetriNetUnfolder]: 390/1308 cut-off events. [2020-10-11 18:45:53,100 INFO L130 PetriNetUnfolder]: For 12261/12974 co-relation queries the response was YES. [2020-10-11 18:45:53,107 INFO L80 FinitePrefix]: Finished finitePrefix Result has 6740 conditions, 1308 events. 390/1308 cut-off events. For 12261/12974 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 10077 event pairs, 57 based on Foata normal form. 112/1373 useless extension candidates. Maximal degree in co-relation 6656. Up to 432 conditions per place. [2020-10-11 18:45:53,115 INFO L132 encePairwiseOnDemand]: 79/92 looper letters, 62 selfloop transitions, 35 changer transitions 19/184 dead transitions. [2020-10-11 18:45:53,116 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 184 transitions, 2038 flow [2020-10-11 18:45:53,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 18:45:53,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-11 18:45:53,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 928 transitions. [2020-10-11 18:45:53,126 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8405797101449275 [2020-10-11 18:45:53,127 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 928 transitions. [2020-10-11 18:45:53,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 928 transitions. [2020-10-11 18:45:53,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:45:53,127 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 928 transitions. [2020-10-11 18:45:53,128 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-11 18:45:53,130 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-11 18:45:53,130 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-11 18:45:53,130 INFO L185 Difference]: Start difference. First operand has 154 places, 155 transitions, 1419 flow. Second operand 12 states and 928 transitions. [2020-10-11 18:45:53,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 184 transitions, 2038 flow [2020-10-11 18:45:53,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 184 transitions, 1927 flow, removed 14 selfloop flow, removed 10 redundant places. [2020-10-11 18:45:53,163 INFO L241 Difference]: Finished difference. Result has 157 places, 160 transitions, 1520 flow [2020-10-11 18:45:53,163 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=1326, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1520, PETRI_PLACES=157, PETRI_TRANSITIONS=160} [2020-10-11 18:45:53,164 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 60 predicate places. [2020-10-11 18:45:53,164 INFO L481 AbstractCegarLoop]: Abstraction has has 157 places, 160 transitions, 1520 flow [2020-10-11 18:45:53,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 18:45:53,164 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:45:53,164 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:45:53,164 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-11 18:45:53,164 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:45:53,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:45:53,165 INFO L82 PathProgramCache]: Analyzing trace with hash 708108299, now seen corresponding path program 2 times [2020-10-11 18:45:53,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:45:53,165 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663703887] [2020-10-11 18:45:53,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:45:53,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:45:53,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:45:53,918 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663703887] [2020-10-11 18:45:53,918 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:45:53,918 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-10-11 18:45:53,919 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047586819] [2020-10-11 18:45:53,919 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-11 18:45:53,919 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:45:53,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-11 18:45:53,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2020-10-11 18:45:56,460 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 92 [2020-10-11 18:45:56,461 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 160 transitions, 1520 flow. Second operand 16 states. [2020-10-11 18:45:56,462 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:45:56,462 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 92 [2020-10-11 18:45:56,462 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:45:57,932 INFO L129 PetriNetUnfolder]: 496/1751 cut-off events. [2020-10-11 18:45:57,932 INFO L130 PetriNetUnfolder]: For 23641/24921 co-relation queries the response was YES. [2020-10-11 18:45:57,940 INFO L80 FinitePrefix]: Finished finitePrefix Result has 10162 conditions, 1751 events. 496/1751 cut-off events. For 23641/24921 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 15924 event pairs, 41 based on Foata normal form. 232/1940 useless extension candidates. Maximal degree in co-relation 10072. Up to 552 conditions per place. [2020-10-11 18:45:57,947 INFO L132 encePairwiseOnDemand]: 76/92 looper letters, 105 selfloop transitions, 36 changer transitions 37/232 dead transitions. [2020-10-11 18:45:57,947 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 232 transitions, 3153 flow [2020-10-11 18:45:57,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-10-11 18:45:57,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-10-11 18:45:57,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1541 transitions. [2020-10-11 18:45:57,950 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.7613636363636364 [2020-10-11 18:45:57,951 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 1541 transitions. [2020-10-11 18:45:57,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 1541 transitions. [2020-10-11 18:45:57,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:45:57,952 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1541 transitions. [2020-10-11 18:45:57,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 23 states. [2020-10-11 18:45:57,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 23 states. [2020-10-11 18:45:57,956 INFO L81 ComplementDD]: Finished complementDD. Result 23 states. [2020-10-11 18:45:57,956 INFO L185 Difference]: Start difference. First operand has 157 places, 160 transitions, 1520 flow. Second operand 22 states and 1541 transitions. [2020-10-11 18:45:57,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 232 transitions, 3153 flow [2020-10-11 18:45:57,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 232 transitions, 2969 flow, removed 85 selfloop flow, removed 9 redundant places. [2020-10-11 18:45:58,002 INFO L241 Difference]: Finished difference. Result has 176 places, 174 transitions, 1931 flow [2020-10-11 18:45:58,002 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=1462, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1931, PETRI_PLACES=176, PETRI_TRANSITIONS=174} [2020-10-11 18:45:58,003 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 79 predicate places. [2020-10-11 18:45:58,003 INFO L481 AbstractCegarLoop]: Abstraction has has 176 places, 174 transitions, 1931 flow [2020-10-11 18:45:58,003 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-11 18:45:58,003 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:45:58,003 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:45:58,003 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-11 18:45:58,003 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:45:58,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:45:58,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1604620043, now seen corresponding path program 1 times [2020-10-11 18:45:58,004 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:45:58,004 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091727192] [2020-10-11 18:45:58,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:45:58,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:45:58,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:45:58,395 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091727192] [2020-10-11 18:45:58,395 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:45:58,395 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-10-11 18:45:58,395 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848761328] [2020-10-11 18:45:58,396 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-11 18:45:58,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:45:58,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-11 18:45:58,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2020-10-11 18:46:01,576 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 92 [2020-10-11 18:46:01,577 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 174 transitions, 1931 flow. Second operand 14 states. [2020-10-11 18:46:01,577 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:46:01,577 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 92 [2020-10-11 18:46:01,577 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:46:02,464 INFO L129 PetriNetUnfolder]: 417/1508 cut-off events. [2020-10-11 18:46:02,465 INFO L130 PetriNetUnfolder]: For 22712/23800 co-relation queries the response was YES. [2020-10-11 18:46:02,473 INFO L80 FinitePrefix]: Finished finitePrefix Result has 9012 conditions, 1508 events. 417/1508 cut-off events. For 22712/23800 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 13575 event pairs, 110 based on Foata normal form. 169/1633 useless extension candidates. Maximal degree in co-relation 8914. Up to 716 conditions per place. [2020-10-11 18:46:02,479 INFO L132 encePairwiseOnDemand]: 76/92 looper letters, 89 selfloop transitions, 36 changer transitions 23/205 dead transitions. [2020-10-11 18:46:02,479 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 205 transitions, 2684 flow [2020-10-11 18:46:02,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 18:46:02,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-11 18:46:02,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1024 transitions. [2020-10-11 18:46:02,482 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.7950310559006211 [2020-10-11 18:46:02,483 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1024 transitions. [2020-10-11 18:46:02,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1024 transitions. [2020-10-11 18:46:02,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:46:02,483 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1024 transitions. [2020-10-11 18:46:02,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-11 18:46:02,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-11 18:46:02,486 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-11 18:46:02,487 INFO L185 Difference]: Start difference. First operand has 176 places, 174 transitions, 1931 flow. Second operand 14 states and 1024 transitions. [2020-10-11 18:46:02,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 205 transitions, 2684 flow [2020-10-11 18:46:02,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 205 transitions, 2545 flow, removed 60 selfloop flow, removed 16 redundant places. [2020-10-11 18:46:02,529 INFO L241 Difference]: Finished difference. Result has 169 places, 178 transitions, 1953 flow [2020-10-11 18:46:02,530 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=1805, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1953, PETRI_PLACES=169, PETRI_TRANSITIONS=178} [2020-10-11 18:46:02,530 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 72 predicate places. [2020-10-11 18:46:02,530 INFO L481 AbstractCegarLoop]: Abstraction has has 169 places, 178 transitions, 1953 flow [2020-10-11 18:46:02,530 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-11 18:46:02,530 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:46:02,530 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:46:02,530 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-11 18:46:02,531 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:46:02,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:46:02,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1482265353, now seen corresponding path program 2 times [2020-10-11 18:46:02,531 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:46:02,531 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896958496] [2020-10-11 18:46:02,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:46:02,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:46:02,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:46:02,850 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896958496] [2020-10-11 18:46:02,852 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:46:02,853 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-10-11 18:46:02,854 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643051070] [2020-10-11 18:46:02,855 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-11 18:46:02,855 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:46:02,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-11 18:46:02,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2020-10-11 18:46:05,930 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 92 [2020-10-11 18:46:05,930 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 178 transitions, 1953 flow. Second operand 14 states. [2020-10-11 18:46:05,930 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:46:05,931 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 92 [2020-10-11 18:46:05,931 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:46:06,613 INFO L129 PetriNetUnfolder]: 393/1419 cut-off events. [2020-10-11 18:46:06,613 INFO L130 PetriNetUnfolder]: For 18287/19548 co-relation queries the response was YES. [2020-10-11 18:46:06,619 INFO L80 FinitePrefix]: Finished finitePrefix Result has 8196 conditions, 1419 events. 393/1419 cut-off events. For 18287/19548 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 12396 event pairs, 117 based on Foata normal form. 196/1571 useless extension candidates. Maximal degree in co-relation 8101. Up to 680 conditions per place. [2020-10-11 18:46:06,624 INFO L132 encePairwiseOnDemand]: 76/92 looper letters, 74 selfloop transitions, 41 changer transitions 25/196 dead transitions. [2020-10-11 18:46:06,625 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 196 transitions, 2533 flow [2020-10-11 18:46:06,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 18:46:06,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-11 18:46:06,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1008 transitions. [2020-10-11 18:46:06,630 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.782608695652174 [2020-10-11 18:46:06,630 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1008 transitions. [2020-10-11 18:46:06,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1008 transitions. [2020-10-11 18:46:06,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:46:06,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1008 transitions. [2020-10-11 18:46:06,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-11 18:46:06,634 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-11 18:46:06,634 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-11 18:46:06,634 INFO L185 Difference]: Start difference. First operand has 169 places, 178 transitions, 1953 flow. Second operand 14 states and 1008 transitions. [2020-10-11 18:46:06,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 196 transitions, 2533 flow [2020-10-11 18:46:06,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 196 transitions, 2437 flow, removed 19 selfloop flow, removed 12 redundant places. [2020-10-11 18:46:06,677 INFO L241 Difference]: Finished difference. Result has 169 places, 169 transitions, 1808 flow [2020-10-11 18:46:06,678 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=1865, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1808, PETRI_PLACES=169, PETRI_TRANSITIONS=169} [2020-10-11 18:46:06,678 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 72 predicate places. [2020-10-11 18:46:06,678 INFO L481 AbstractCegarLoop]: Abstraction has has 169 places, 169 transitions, 1808 flow [2020-10-11 18:46:06,678 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-11 18:46:06,678 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:46:06,679 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:46:06,679 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-11 18:46:06,679 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:46:06,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:46:06,679 INFO L82 PathProgramCache]: Analyzing trace with hash -123758203, now seen corresponding path program 3 times [2020-10-11 18:46:06,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:46:06,680 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191330488] [2020-10-11 18:46:06,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:46:06,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:46:06,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:46:07,000 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191330488] [2020-10-11 18:46:07,000 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:46:07,000 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-10-11 18:46:07,000 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294742618] [2020-10-11 18:46:07,001 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-11 18:46:07,001 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:46:07,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-11 18:46:07,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2020-10-11 18:46:09,825 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 92 [2020-10-11 18:46:09,826 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 169 transitions, 1808 flow. Second operand 14 states. [2020-10-11 18:46:09,826 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:46:09,826 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 92 [2020-10-11 18:46:09,826 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:46:11,126 INFO L129 PetriNetUnfolder]: 392/1507 cut-off events. [2020-10-11 18:46:11,126 INFO L130 PetriNetUnfolder]: For 18755/20120 co-relation queries the response was YES. [2020-10-11 18:46:11,139 INFO L80 FinitePrefix]: Finished finitePrefix Result has 8276 conditions, 1507 events. 392/1507 cut-off events. For 18755/20120 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 13697 event pairs, 59 based on Foata normal form. 269/1738 useless extension candidates. Maximal degree in co-relation 8182. Up to 613 conditions per place. [2020-10-11 18:46:11,145 INFO L132 encePairwiseOnDemand]: 77/92 looper letters, 88 selfloop transitions, 41 changer transitions 30/215 dead transitions. [2020-10-11 18:46:11,145 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 215 transitions, 2802 flow [2020-10-11 18:46:11,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-10-11 18:46:11,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-10-11 18:46:11,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1661 transitions. [2020-10-11 18:46:11,149 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.7849716446124764 [2020-10-11 18:46:11,149 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 1661 transitions. [2020-10-11 18:46:11,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 1661 transitions. [2020-10-11 18:46:11,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:46:11,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 1661 transitions. [2020-10-11 18:46:11,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 24 states. [2020-10-11 18:46:11,154 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 24 states. [2020-10-11 18:46:11,154 INFO L81 ComplementDD]: Finished complementDD. Result 24 states. [2020-10-11 18:46:11,154 INFO L185 Difference]: Start difference. First operand has 169 places, 169 transitions, 1808 flow. Second operand 23 states and 1661 transitions. [2020-10-11 18:46:11,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 215 transitions, 2802 flow [2020-10-11 18:46:11,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 215 transitions, 2606 flow, removed 56 selfloop flow, removed 13 redundant places. [2020-10-11 18:46:11,199 INFO L241 Difference]: Finished difference. Result has 188 places, 177 transitions, 1955 flow [2020-10-11 18:46:11,199 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=1676, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=1955, PETRI_PLACES=188, PETRI_TRANSITIONS=177} [2020-10-11 18:46:11,199 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 91 predicate places. [2020-10-11 18:46:11,200 INFO L481 AbstractCegarLoop]: Abstraction has has 188 places, 177 transitions, 1955 flow [2020-10-11 18:46:11,200 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-11 18:46:11,200 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:46:11,200 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:46:11,200 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-11 18:46:11,200 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:46:11,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:46:11,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1688382663, now seen corresponding path program 4 times [2020-10-11 18:46:11,201 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:46:11,201 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362822446] [2020-10-11 18:46:11,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:46:11,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:46:11,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:46:11,854 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362822446] [2020-10-11 18:46:11,855 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:46:11,855 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-10-11 18:46:11,855 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844541932] [2020-10-11 18:46:11,855 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-11 18:46:11,856 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:46:11,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-11 18:46:11,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-10-11 18:46:15,690 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 92 [2020-10-11 18:46:15,691 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 177 transitions, 1955 flow. Second operand 13 states. [2020-10-11 18:46:15,691 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:46:15,691 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 92 [2020-10-11 18:46:15,691 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:46:16,553 INFO L129 PetriNetUnfolder]: 321/1490 cut-off events. [2020-10-11 18:46:16,560 INFO L130 PetriNetUnfolder]: For 16328/16856 co-relation queries the response was YES. [2020-10-11 18:46:16,573 INFO L80 FinitePrefix]: Finished finitePrefix Result has 7636 conditions, 1490 events. 321/1490 cut-off events. For 16328/16856 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 13854 event pairs, 66 based on Foata normal form. 79/1529 useless extension candidates. Maximal degree in co-relation 7532. Up to 364 conditions per place. [2020-10-11 18:46:16,578 INFO L132 encePairwiseOnDemand]: 80/92 looper letters, 72 selfloop transitions, 36 changer transitions 23/198 dead transitions. [2020-10-11 18:46:16,578 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 198 transitions, 2594 flow [2020-10-11 18:46:16,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 18:46:16,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-11 18:46:16,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1011 transitions. [2020-10-11 18:46:16,581 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.7849378881987578 [2020-10-11 18:46:16,581 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1011 transitions. [2020-10-11 18:46:16,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1011 transitions. [2020-10-11 18:46:16,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:46:16,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1011 transitions. [2020-10-11 18:46:16,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-11 18:46:16,585 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-11 18:46:16,585 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-11 18:46:16,585 INFO L185 Difference]: Start difference. First operand has 188 places, 177 transitions, 1955 flow. Second operand 14 states and 1011 transitions. [2020-10-11 18:46:16,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 198 transitions, 2594 flow [2020-10-11 18:46:16,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 198 transitions, 2402 flow, removed 86 selfloop flow, removed 18 redundant places. [2020-10-11 18:46:16,655 INFO L241 Difference]: Finished difference. Result has 178 places, 169 transitions, 1826 flow [2020-10-11 18:46:16,656 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=1857, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1826, PETRI_PLACES=178, PETRI_TRANSITIONS=169} [2020-10-11 18:46:16,656 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 81 predicate places. [2020-10-11 18:46:16,656 INFO L481 AbstractCegarLoop]: Abstraction has has 178 places, 169 transitions, 1826 flow [2020-10-11 18:46:16,656 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-11 18:46:16,656 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:46:16,657 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:46:16,657 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-11 18:46:16,657 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:46:16,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:46:16,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1973299974, now seen corresponding path program 1 times [2020-10-11 18:46:16,657 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:46:16,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729968988] [2020-10-11 18:46:16,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:46:16,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:46:16,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:46:16,823 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729968988] [2020-10-11 18:46:16,823 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:46:16,823 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:46:16,824 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897651083] [2020-10-11 18:46:16,825 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:46:16,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:46:16,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:46:16,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:46:16,971 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 92 [2020-10-11 18:46:16,972 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 169 transitions, 1826 flow. Second operand 6 states. [2020-10-11 18:46:16,972 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:46:16,972 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 92 [2020-10-11 18:46:16,972 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:46:17,821 INFO L129 PetriNetUnfolder]: 1779/4537 cut-off events. [2020-10-11 18:46:17,821 INFO L130 PetriNetUnfolder]: For 15970/16189 co-relation queries the response was YES. [2020-10-11 18:46:17,854 INFO L80 FinitePrefix]: Finished finitePrefix Result has 12339 conditions, 4537 events. 1779/4537 cut-off events. For 15970/16189 co-relation queries the response was YES. Maximal size of possible extension queue 686. Compared 46457 event pairs, 122 based on Foata normal form. 165/4365 useless extension candidates. Maximal degree in co-relation 12245. Up to 1441 conditions per place. [2020-10-11 18:46:17,862 INFO L132 encePairwiseOnDemand]: 83/92 looper letters, 19 selfloop transitions, 16 changer transitions 0/156 dead transitions. [2020-10-11 18:46:17,862 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 156 transitions, 1350 flow [2020-10-11 18:46:17,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:46:17,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:46:17,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 748 transitions. [2020-10-11 18:46:17,865 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9033816425120773 [2020-10-11 18:46:17,865 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 748 transitions. [2020-10-11 18:46:17,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 748 transitions. [2020-10-11 18:46:17,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:46:17,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 748 transitions. [2020-10-11 18:46:17,867 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:46:17,868 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:46:17,868 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:46:17,868 INFO L185 Difference]: Start difference. First operand has 178 places, 169 transitions, 1826 flow. Second operand 9 states and 748 transitions. [2020-10-11 18:46:17,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 156 transitions, 1350 flow [2020-10-11 18:46:17,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 156 transitions, 1234 flow, removed 24 selfloop flow, removed 22 redundant places. [2020-10-11 18:46:17,929 INFO L241 Difference]: Finished difference. Result has 163 places, 145 transitions, 1225 flow [2020-10-11 18:46:17,930 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=1114, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1225, PETRI_PLACES=163, PETRI_TRANSITIONS=145} [2020-10-11 18:46:17,930 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 66 predicate places. [2020-10-11 18:46:17,930 INFO L481 AbstractCegarLoop]: Abstraction has has 163 places, 145 transitions, 1225 flow [2020-10-11 18:46:17,930 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:46:17,930 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:46:17,930 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:46:17,931 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-11 18:46:17,931 INFO L429 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:46:17,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:46:17,931 INFO L82 PathProgramCache]: Analyzing trace with hash -2007774397, now seen corresponding path program 1 times [2020-10-11 18:46:17,931 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:46:17,932 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079657454] [2020-10-11 18:46:17,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:46:17,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:46:18,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:46:18,068 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079657454] [2020-10-11 18:46:18,068 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:46:18,068 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:46:18,068 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24514471] [2020-10-11 18:46:18,069 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:46:18,069 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:46:18,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:46:18,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:46:18,297 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 92 [2020-10-11 18:46:18,298 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 145 transitions, 1225 flow. Second operand 7 states. [2020-10-11 18:46:18,298 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:46:18,298 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 92 [2020-10-11 18:46:18,298 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:46:19,028 INFO L129 PetriNetUnfolder]: 1625/4746 cut-off events. [2020-10-11 18:46:19,028 INFO L130 PetriNetUnfolder]: For 13823/17569 co-relation queries the response was YES. [2020-10-11 18:46:19,061 INFO L80 FinitePrefix]: Finished finitePrefix Result has 16250 conditions, 4746 events. 1625/4746 cut-off events. For 13823/17569 co-relation queries the response was YES. Maximal size of possible extension queue 715. Compared 53359 event pairs, 18 based on Foata normal form. 893/5349 useless extension candidates. Maximal degree in co-relation 16167. Up to 1705 conditions per place. [2020-10-11 18:46:19,069 INFO L132 encePairwiseOnDemand]: 83/92 looper letters, 15 selfloop transitions, 31 changer transitions 6/161 dead transitions. [2020-10-11 18:46:19,069 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 161 transitions, 1374 flow [2020-10-11 18:46:19,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 18:46:19,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-11 18:46:19,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 998 transitions. [2020-10-11 18:46:19,077 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9039855072463768 [2020-10-11 18:46:19,077 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 998 transitions. [2020-10-11 18:46:19,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 998 transitions. [2020-10-11 18:46:19,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:46:19,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 998 transitions. [2020-10-11 18:46:19,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-11 18:46:19,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-11 18:46:19,080 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-11 18:46:19,080 INFO L185 Difference]: Start difference. First operand has 163 places, 145 transitions, 1225 flow. Second operand 12 states and 998 transitions. [2020-10-11 18:46:19,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 161 transitions, 1374 flow [2020-10-11 18:46:19,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 161 transitions, 1261 flow, removed 5 selfloop flow, removed 13 redundant places. [2020-10-11 18:46:19,124 INFO L241 Difference]: Finished difference. Result has 164 places, 152 transitions, 1206 flow [2020-10-11 18:46:19,125 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=976, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1206, PETRI_PLACES=164, PETRI_TRANSITIONS=152} [2020-10-11 18:46:19,125 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 67 predicate places. [2020-10-11 18:46:19,125 INFO L481 AbstractCegarLoop]: Abstraction has has 164 places, 152 transitions, 1206 flow [2020-10-11 18:46:19,125 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:46:19,125 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:46:19,125 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:46:19,126 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-11 18:46:19,126 INFO L429 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:46:19,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:46:19,126 INFO L82 PathProgramCache]: Analyzing trace with hash 3980562, now seen corresponding path program 1 times [2020-10-11 18:46:19,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:46:19,126 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770933233] [2020-10-11 18:46:19,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:46:19,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:46:19,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:46:19,320 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770933233] [2020-10-11 18:46:19,321 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:46:19,321 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-11 18:46:19,321 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767725706] [2020-10-11 18:46:19,321 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 18:46:19,321 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:46:19,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 18:46:19,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-11 18:46:19,498 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 92 [2020-10-11 18:46:19,499 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 152 transitions, 1206 flow. Second operand 8 states. [2020-10-11 18:46:19,499 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:46:19,499 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 92 [2020-10-11 18:46:19,499 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:46:20,344 INFO L129 PetriNetUnfolder]: 1273/4370 cut-off events. [2020-10-11 18:46:20,344 INFO L130 PetriNetUnfolder]: For 16167/21878 co-relation queries the response was YES. [2020-10-11 18:46:20,383 INFO L80 FinitePrefix]: Finished finitePrefix Result has 16486 conditions, 4370 events. 1273/4370 cut-off events. For 16167/21878 co-relation queries the response was YES. Maximal size of possible extension queue 711. Compared 52378 event pairs, 0 based on Foata normal form. 911/5004 useless extension candidates. Maximal degree in co-relation 16404. Up to 1392 conditions per place. [2020-10-11 18:46:20,388 INFO L132 encePairwiseOnDemand]: 83/92 looper letters, 10 selfloop transitions, 36 changer transitions 30/171 dead transitions. [2020-10-11 18:46:20,388 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 171 transitions, 1460 flow [2020-10-11 18:46:20,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 18:46:20,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-11 18:46:20,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1236 transitions. [2020-10-11 18:46:20,391 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8956521739130435 [2020-10-11 18:46:20,391 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1236 transitions. [2020-10-11 18:46:20,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1236 transitions. [2020-10-11 18:46:20,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:46:20,392 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1236 transitions. [2020-10-11 18:46:20,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-11 18:46:20,394 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-11 18:46:20,395 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-11 18:46:20,395 INFO L185 Difference]: Start difference. First operand has 164 places, 152 transitions, 1206 flow. Second operand 15 states and 1236 transitions. [2020-10-11 18:46:20,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 171 transitions, 1460 flow [2020-10-11 18:46:20,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 171 transitions, 1242 flow, removed 91 selfloop flow, removed 8 redundant places. [2020-10-11 18:46:20,580 INFO L241 Difference]: Finished difference. Result has 176 places, 138 transitions, 970 flow [2020-10-11 18:46:20,580 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=1020, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=970, PETRI_PLACES=176, PETRI_TRANSITIONS=138} [2020-10-11 18:46:20,581 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 79 predicate places. [2020-10-11 18:46:20,581 INFO L481 AbstractCegarLoop]: Abstraction has has 176 places, 138 transitions, 970 flow [2020-10-11 18:46:20,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 18:46:20,581 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:46:20,581 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:46:20,581 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-11 18:46:20,581 INFO L429 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:46:20,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:46:20,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1953587005, now seen corresponding path program 1 times [2020-10-11 18:46:20,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:46:20,582 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510921500] [2020-10-11 18:46:20,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:46:20,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:46:21,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:46:21,136 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510921500] [2020-10-11 18:46:21,136 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:46:21,137 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-10-11 18:46:21,137 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762443412] [2020-10-11 18:46:21,138 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-11 18:46:21,138 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:46:21,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-11 18:46:21,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2020-10-11 18:46:27,368 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 92 [2020-10-11 18:46:27,369 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 138 transitions, 970 flow. Second operand 17 states. [2020-10-11 18:46:27,369 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:46:27,369 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 92 [2020-10-11 18:46:27,370 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:46:28,043 INFO L129 PetriNetUnfolder]: 637/2600 cut-off events. [2020-10-11 18:46:28,043 INFO L130 PetriNetUnfolder]: For 5839/6029 co-relation queries the response was YES. [2020-10-11 18:46:28,069 INFO L80 FinitePrefix]: Finished finitePrefix Result has 7706 conditions, 2600 events. 637/2600 cut-off events. For 5839/6029 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 29760 event pairs, 0 based on Foata normal form. 8/2464 useless extension candidates. Maximal degree in co-relation 7627. Up to 342 conditions per place. [2020-10-11 18:46:28,074 INFO L132 encePairwiseOnDemand]: 79/92 looper letters, 35 selfloop transitions, 7 changer transitions 15/144 dead transitions. [2020-10-11 18:46:28,074 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 144 transitions, 1113 flow [2020-10-11 18:46:28,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 18:46:28,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-11 18:46:28,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 961 transitions. [2020-10-11 18:46:28,076 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.7461180124223602 [2020-10-11 18:46:28,076 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 961 transitions. [2020-10-11 18:46:28,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 961 transitions. [2020-10-11 18:46:28,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:46:28,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 961 transitions. [2020-10-11 18:46:28,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-11 18:46:28,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-11 18:46:28,080 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-11 18:46:28,080 INFO L185 Difference]: Start difference. First operand has 176 places, 138 transitions, 970 flow. Second operand 14 states and 961 transitions. [2020-10-11 18:46:28,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 144 transitions, 1113 flow [2020-10-11 18:46:28,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 144 transitions, 1006 flow, removed 25 selfloop flow, removed 19 redundant places. [2020-10-11 18:46:28,171 INFO L241 Difference]: Finished difference. Result has 169 places, 129 transitions, 803 flow [2020-10-11 18:46:28,172 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=867, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=803, PETRI_PLACES=169, PETRI_TRANSITIONS=129} [2020-10-11 18:46:28,172 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 72 predicate places. [2020-10-11 18:46:28,172 INFO L481 AbstractCegarLoop]: Abstraction has has 169 places, 129 transitions, 803 flow [2020-10-11 18:46:28,172 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-11 18:46:28,172 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:46:28,172 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:46:28,173 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-11 18:46:28,173 INFO L429 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:46:28,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:46:28,173 INFO L82 PathProgramCache]: Analyzing trace with hash -750930005, now seen corresponding path program 2 times [2020-10-11 18:46:28,173 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:46:28,174 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105512725] [2020-10-11 18:46:28,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:46:28,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:46:28,233 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:46:28,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:46:28,285 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:46:28,330 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-11 18:46:28,331 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-11 18:46:28,331 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-11 18:46:28,369 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,369 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,370 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,370 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,371 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,371 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,371 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,371 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,371 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,371 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,372 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,372 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,372 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,372 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,372 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,373 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,373 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,373 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,373 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,373 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,373 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,373 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,374 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,374 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,374 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,374 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,375 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,375 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,375 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,375 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,375 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,375 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,375 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,376 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,376 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,376 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,376 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,376 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,376 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,377 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,377 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,377 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,377 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,377 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,377 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,378 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,378 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,378 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,378 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,378 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,378 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,379 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,379 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,379 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,379 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,379 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,379 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,379 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,380 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,380 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,380 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,380 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,380 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,381 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,381 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,381 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,381 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,381 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,381 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,382 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,382 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,382 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,382 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,382 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,382 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,382 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,383 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,383 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,383 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,383 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,383 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,383 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,384 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,384 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,384 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,384 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,384 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,384 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,384 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,385 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,385 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,386 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,386 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,386 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,386 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,386 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,386 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,386 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,387 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,387 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,387 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,387 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,387 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,387 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,387 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,388 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,388 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,388 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,388 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,388 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,388 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,388 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,389 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,389 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,389 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,389 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,389 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,389 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,389 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,390 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,390 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,390 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,390 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:28,390 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:28,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 06:46:28 BasicIcfg [2020-10-11 18:46:28,480 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-11 18:46:28,483 INFO L168 Benchmark]: Toolchain (without parser) took 73332.84 ms. Allocated memory was 252.7 MB in the beginning and 1.1 GB in the end (delta: 832.6 MB). Free memory was 207.1 MB in the beginning and 453.2 MB in the end (delta: -246.1 MB). Peak memory consumption was 586.5 MB. Max. memory is 14.2 GB. [2020-10-11 18:46:28,483 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 252.7 MB. Free memory was 230.8 MB in the beginning and 229.9 MB in the end (delta: 839.2 kB). Peak memory consumption was 839.2 kB. Max. memory is 14.2 GB. [2020-10-11 18:46:28,484 INFO L168 Benchmark]: CACSL2BoogieTranslator took 868.71 ms. Allocated memory was 252.7 MB in the beginning and 318.8 MB in the end (delta: 66.1 MB). Free memory was 207.1 MB in the beginning and 263.7 MB in the end (delta: -56.6 MB). Peak memory consumption was 27.8 MB. Max. memory is 14.2 GB. [2020-10-11 18:46:28,485 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.30 ms. Allocated memory is still 318.8 MB. Free memory was 263.7 MB in the beginning and 260.4 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB. [2020-10-11 18:46:28,485 INFO L168 Benchmark]: Boogie Preprocessor took 81.17 ms. Allocated memory is still 318.8 MB. Free memory was 260.4 MB in the beginning and 257.0 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB. [2020-10-11 18:46:28,486 INFO L168 Benchmark]: RCFGBuilder took 3501.59 ms. Allocated memory was 318.8 MB in the beginning and 373.8 MB in the end (delta: 55.1 MB). Free memory was 257.0 MB in the beginning and 165.4 MB in the end (delta: 91.5 MB). Peak memory consumption was 146.6 MB. Max. memory is 14.2 GB. [2020-10-11 18:46:28,487 INFO L168 Benchmark]: TraceAbstraction took 68801.31 ms. Allocated memory was 373.8 MB in the beginning and 1.1 GB in the end (delta: 711.5 MB). Free memory was 165.4 MB in the beginning and 453.2 MB in the end (delta: -287.8 MB). Peak memory consumption was 423.7 MB. Max. memory is 14.2 GB. [2020-10-11 18:46:28,490 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.49 ms. Allocated memory is still 252.7 MB. Free memory was 230.8 MB in the beginning and 229.9 MB in the end (delta: 839.2 kB). Peak memory consumption was 839.2 kB. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 868.71 ms. Allocated memory was 252.7 MB in the beginning and 318.8 MB in the end (delta: 66.1 MB). Free memory was 207.1 MB in the beginning and 263.7 MB in the end (delta: -56.6 MB). Peak memory consumption was 27.8 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 70.30 ms. Allocated memory is still 318.8 MB. Free memory was 263.7 MB in the beginning and 260.4 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 81.17 ms. Allocated memory is still 318.8 MB. Free memory was 260.4 MB in the beginning and 257.0 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB. * RCFGBuilder took 3501.59 ms. Allocated memory was 318.8 MB in the beginning and 373.8 MB in the end (delta: 55.1 MB). Free memory was 257.0 MB in the beginning and 165.4 MB in the end (delta: 91.5 MB). Peak memory consumption was 146.6 MB. Max. memory is 14.2 GB. * TraceAbstraction took 68801.31 ms. Allocated memory was 373.8 MB in the beginning and 1.1 GB in the end (delta: 711.5 MB). Free memory was 165.4 MB in the beginning and 453.2 MB in the end (delta: -287.8 MB). Peak memory consumption was 423.7 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 8]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L701] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L703] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L704] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L705] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L707] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L708] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L709] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L710] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L711] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L712] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L713] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L714] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L715] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L716] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L717] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L718] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L719] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L720] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L721] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L722] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L723] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L725] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L726] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L727] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L838] 0 pthread_t t2543; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L839] FCALL, FORK 0 pthread_create(&t2543, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L840] 0 pthread_t t2544; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L841] FCALL, FORK 0 pthread_create(&t2544, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L842] 0 pthread_t t2545; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L843] FCALL, FORK 0 pthread_create(&t2545, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L801] 3 x$w_buff1 = x$w_buff0 [L802] 3 x$w_buff0 = 2 [L803] 3 x$w_buff1_used = x$w_buff0_used [L804] 3 x$w_buff0_used = (_Bool)1 [L8] COND FALSE 3 !(!expression) [L806] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L807] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L808] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L809] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L810] 3 x$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L813] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L731] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L737] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L738] 1 x$flush_delayed = weak$$choice2 [L739] 1 x$mem_tmp = x [L740] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1 [L740] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L741] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L742] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L742] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L743] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L744] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L745] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L745] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L745] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L745] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L745] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L746] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L746] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L747] 1 __unbuffered_p0_EAX = x [L748] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L748] 1 x = x$flush_delayed ? x$mem_tmp : x [L749] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L761] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L764] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L764] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L764] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L764] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L765] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L765] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L766] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L766] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L767] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L768] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L771] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 2 x$flush_delayed = weak$$choice2 [L774] 2 x$mem_tmp = x [L775] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L775] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L776] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L776] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0) [L776] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L776] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L777] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L777] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1) [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1 [L777] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1) [L777] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L777] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L778] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L778] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used) [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used) [L778] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L778] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L779] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L780] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2) [L780] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L780] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L781] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L781] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] 2 __unbuffered_p1_EAX = x [L783] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L783] 2 x = x$flush_delayed ? x$mem_tmp : x [L784] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L787] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L787] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L788] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L789] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L791] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L816] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L816] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L817] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L817] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L818] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L818] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L819] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L819] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L820] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L820] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L823] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L849] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L849] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L850] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L850] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L851] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L851] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L852] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L852] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L853] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L853] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L856] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L857] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L858] 0 x$flush_delayed = weak$$choice2 [L859] 0 x$mem_tmp = x [L860] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1 [L860] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L860] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L861] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L861] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L862] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L862] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L862] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L862] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L863] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L863] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L863] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L863] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L864] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L865] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L866] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L866] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L866] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L866] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L868] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L868] 0 x = x$flush_delayed ? x$mem_tmp : x [L869] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L8] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L8] 0 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 91 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 68.4s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 59.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1259 SDtfs, 1938 SDslu, 8044 SDs, 0 SdLazy, 7258 SolverSat, 1008 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 421 GetRequests, 43 SyntacticMatches, 6 SemanticMatches, 372 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1422 ImplicationChecksByTransitivity, 9.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1955occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 1428 NumberOfCodeBlocks, 1428 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1337 ConstructedInterpolants, 0 QuantifiedInterpolants, 645839 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...