/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe-SemanticLooper.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix047_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 04:52:35,865 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 04:52:35,869 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 04:52:35,909 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 04:52:35,910 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 04:52:35,921 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 04:52:35,922 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 04:52:35,926 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 04:52:35,928 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 04:52:35,930 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 04:52:35,931 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 04:52:35,933 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 04:52:35,934 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 04:52:35,939 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 04:52:35,940 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 04:52:35,941 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 04:52:35,943 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 04:52:35,946 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 04:52:35,948 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 04:52:35,952 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 04:52:35,954 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 04:52:35,957 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 04:52:35,958 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 04:52:35,959 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 04:52:35,965 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 04:52:35,965 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 04:52:35,965 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 04:52:35,968 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 04:52:35,969 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 04:52:35,970 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 04:52:35,970 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 04:52:35,971 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 04:52:35,971 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 04:52:35,973 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 04:52:35,974 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 04:52:35,974 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 04:52:35,975 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 04:52:35,975 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 04:52:35,976 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 04:52:35,977 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 04:52:35,978 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 04:52:35,979 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe-SemanticLooper.epf [2020-10-16 04:52:36,025 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 04:52:36,026 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 04:52:36,028 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 04:52:36,028 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 04:52:36,028 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 04:52:36,028 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 04:52:36,028 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 04:52:36,029 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 04:52:36,029 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 04:52:36,029 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 04:52:36,030 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 04:52:36,030 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 04:52:36,031 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 04:52:36,031 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 04:52:36,031 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 04:52:36,031 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 04:52:36,032 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 04:52:36,032 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 04:52:36,032 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 04:52:36,032 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 04:52:36,032 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 04:52:36,033 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 04:52:36,033 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 04:52:36,033 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 04:52:36,033 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 04:52:36,033 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 04:52:36,033 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 04:52:36,034 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 04:52:36,034 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 04:52:36,304 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 04:52:36,315 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 04:52:36,319 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 04:52:36,320 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 04:52:36,320 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 04:52:36,320 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_power.opt.i [2020-10-16 04:52:36,399 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0accccdfb/2223a398d515417abee6aebe09ea43b3/FLAG16d00b1bc [2020-10-16 04:52:36,969 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 04:52:36,970 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_power.opt.i [2020-10-16 04:52:36,984 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0accccdfb/2223a398d515417abee6aebe09ea43b3/FLAG16d00b1bc [2020-10-16 04:52:37,292 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0accccdfb/2223a398d515417abee6aebe09ea43b3 [2020-10-16 04:52:37,300 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 04:52:37,302 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 04:52:37,303 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 04:52:37,303 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 04:52:37,307 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 04:52:37,308 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:52:37" (1/1) ... [2020-10-16 04:52:37,313 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c2e7388 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:52:37, skipping insertion in model container [2020-10-16 04:52:37,314 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:52:37" (1/1) ... [2020-10-16 04:52:37,321 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 04:52:37,364 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 04:52:37,891 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:52:37,903 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 04:52:37,967 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:52:38,044 INFO L208 MainTranslator]: Completed translation [2020-10-16 04:52:38,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:52:38 WrapperNode [2020-10-16 04:52:38,045 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 04:52:38,046 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 04:52:38,046 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 04:52:38,046 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 04:52:38,056 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:52:38" (1/1) ... [2020-10-16 04:52:38,076 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:52:38" (1/1) ... [2020-10-16 04:52:38,119 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 04:52:38,119 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 04:52:38,119 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 04:52:38,120 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 04:52:38,135 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:52:38" (1/1) ... [2020-10-16 04:52:38,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:52:38" (1/1) ... [2020-10-16 04:52:38,142 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:52:38" (1/1) ... [2020-10-16 04:52:38,143 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:52:38" (1/1) ... [2020-10-16 04:52:38,158 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:52:38" (1/1) ... [2020-10-16 04:52:38,168 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:52:38" (1/1) ... [2020-10-16 04:52:38,175 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:52:38" (1/1) ... [2020-10-16 04:52:38,181 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 04:52:38,181 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 04:52:38,182 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 04:52:38,182 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 04:52:38,183 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:52:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 04:52:38,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 04:52:38,263 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 04:52:38,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 04:52:38,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 04:52:38,264 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 04:52:38,265 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 04:52:38,265 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 04:52:38,265 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 04:52:38,266 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 04:52:38,267 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 04:52:38,269 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-16 04:52:38,269 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-16 04:52:38,269 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 04:52:38,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 04:52:38,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 04:52:38,272 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 04:52:40,235 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 04:52:40,235 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 04:52:40,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:52:40 BoogieIcfgContainer [2020-10-16 04:52:40,238 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 04:52:40,239 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 04:52:40,240 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 04:52:40,243 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 04:52:40,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 04:52:37" (1/3) ... [2020-10-16 04:52:40,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@688cffd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:52:40, skipping insertion in model container [2020-10-16 04:52:40,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:52:38" (2/3) ... [2020-10-16 04:52:40,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@688cffd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:52:40, skipping insertion in model container [2020-10-16 04:52:40,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:52:40" (3/3) ... [2020-10-16 04:52:40,247 INFO L111 eAbstractionObserver]: Analyzing ICFG mix047_power.opt.i [2020-10-16 04:52:40,259 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 04:52:40,266 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 04:52:40,267 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 04:52:40,297 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,298 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,298 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,298 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,298 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,299 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,299 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,299 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,300 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,300 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,300 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,300 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,301 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,301 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,301 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,302 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,302 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,302 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,302 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,303 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,303 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,303 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,303 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,304 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,304 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,304 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,305 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,305 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,305 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,305 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,305 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,306 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,306 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,306 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,306 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,307 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,307 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,307 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,307 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,307 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,308 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,308 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,312 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,312 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,315 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,316 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,316 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,316 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,316 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,317 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,317 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,317 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,317 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,317 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,321 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,322 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,322 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,322 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,322 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,323 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,323 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,323 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,323 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,323 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,324 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,324 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,325 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,326 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,326 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,326 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:40,344 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-16 04:52:40,366 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 04:52:40,366 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 04:52:40,366 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 04:52:40,366 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 04:52:40,367 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 04:52:40,367 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 04:52:40,367 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 04:52:40,367 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 04:52:40,382 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 122 places, 111 transitions, 242 flow [2020-10-16 04:52:40,436 INFO L129 PetriNetUnfolder]: 2/107 cut-off events. [2020-10-16 04:52:40,437 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:52:40,442 INFO L80 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2020-10-16 04:52:40,443 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 111 transitions, 242 flow [2020-10-16 04:52:40,451 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 107 transitions, 226 flow [2020-10-16 04:52:40,453 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 04:52:40,456 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 107 transitions, 226 flow [2020-10-16 04:52:40,459 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 107 transitions, 226 flow [2020-10-16 04:52:40,460 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 118 places, 107 transitions, 226 flow [2020-10-16 04:52:40,491 INFO L129 PetriNetUnfolder]: 2/107 cut-off events. [2020-10-16 04:52:40,492 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:52:40,493 INFO L80 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2020-10-16 04:52:40,497 INFO L117 LiptonReduction]: Number of co-enabled transitions 2540 [2020-10-16 04:52:40,581 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:52:40,582 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:40,585 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:52:40,586 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:40,705 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:52:40,705 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:40,707 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 1] term [2020-10-16 04:52:40,708 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:40,787 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:40,787 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:40,799 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:52:40,800 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:40,801 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:52:40,802 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:40,807 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:52:40,808 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:52:40,811 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:52:40,811 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:52:40,815 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:52:40,816 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:52:40,819 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-16 04:52:40,820 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:40,822 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-16 04:52:40,822 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:40,827 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-16 04:52:40,828 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:40,888 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:52:40,889 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:40,890 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:52:40,891 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:40,894 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 04:52:40,895 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:52:40,899 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-16 04:52:40,899 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:40,996 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:52:40,997 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:40,998 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:40,998 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:41,001 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:41,001 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:52:41,004 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:52:41,005 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:52:41,025 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:41,025 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:41,027 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:41,027 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:41,029 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:41,030 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:52:41,032 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:52:41,033 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:52:41,085 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:41,086 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:41,087 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:41,088 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:41,090 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:41,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:52:41,093 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:52:41,093 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:52:41,112 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:41,112 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:41,114 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:41,114 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:41,116 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:41,116 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:52:41,119 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:52:41,119 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:52:41,160 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:52:41,161 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:41,162 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:52:41,163 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:41,187 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:52:41,188 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:41,189 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:52:41,189 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:41,217 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:52:41,217 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:41,218 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:52:41,219 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:41,241 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:52:41,241 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:41,242 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:52:41,243 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:41,391 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:52:41,391 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:41,392 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:52:41,393 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:41,411 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:52:41,411 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:41,412 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:52:41,412 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:41,463 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:52:41,464 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:41,465 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:52:41,465 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:41,468 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 04:52:41,469 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:52:41,472 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-16 04:52:41,472 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:41,521 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:52:41,521 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:41,527 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:52:41,528 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:41,529 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:52:41,529 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:41,533 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:52:41,533 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:52:41,535 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:52:41,536 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:52:41,538 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:52:41,539 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:52:41,541 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-16 04:52:41,542 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:41,544 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-16 04:52:41,544 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:41,578 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-16 04:52:41,578 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:41,625 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:52:41,626 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:41,627 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:52:41,627 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:41,652 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:52:41,653 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:41,654 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:52:41,654 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:41,681 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:52:41,682 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:41,683 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 1] term [2020-10-16 04:52:41,683 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:41,703 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:52:41,704 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:41,705 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:52:41,705 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:41,960 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-10-16 04:52:41,984 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:52:41,985 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:41,986 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:52:41,986 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:42,006 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:52:42,006 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:42,007 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:52:42,007 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:42,534 WARN L193 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 04:52:42,677 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-16 04:52:42,882 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 04:52:43,005 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 04:52:43,026 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:52:43,026 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:43,064 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-10-16 04:52:43,064 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:43,065 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:52:43,065 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:43,084 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:52:43,084 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:43,085 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:52:43,086 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:43,094 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:52:43,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:43,096 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-16 04:52:43,096 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:43,097 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-16 04:52:43,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:43,121 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:52:43,121 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:43,122 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:52:43,123 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:43,145 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:52:43,146 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:43,147 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:52:43,147 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:43,194 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:52:43,195 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:43,196 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:52:43,196 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:43,216 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:52:43,217 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:43,218 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:52:43,218 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:43,290 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:52:43,291 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:43,294 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:52:43,295 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:43,296 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:52:43,296 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:43,298 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:52:43,299 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:52:43,300 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:52:43,301 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:52:43,302 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:52:43,302 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:52:43,304 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-16 04:52:43,304 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:43,305 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-16 04:52:43,305 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:43,307 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-16 04:52:43,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:43,358 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:52:43,359 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:43,360 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:52:43,361 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:43,364 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 04:52:43,365 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:52:43,369 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-16 04:52:43,369 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:43,510 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:52:43,511 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:43,543 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:52:43,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:43,545 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:52:43,545 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:43,581 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:52:43,583 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:43,585 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:52:43,586 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:43,684 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:52:43,685 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:43,686 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:52:43,686 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:43,689 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 04:52:43,689 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:52:43,692 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-16 04:52:43,692 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:43,761 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:43,764 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:43,774 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:52:43,775 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:43,777 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:52:43,778 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:43,781 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:52:43,782 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:52:43,785 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:52:43,786 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:52:43,788 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:52:43,789 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:52:43,792 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-16 04:52:43,792 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:43,796 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-16 04:52:43,797 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:43,800 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-16 04:52:43,800 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:43,887 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:52:43,887 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:43,889 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:52:43,889 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:43,918 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:52:43,918 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:43,919 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:52:43,920 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:44,035 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:52:44,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:44,037 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:52:44,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:44,067 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:52:44,068 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:44,069 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:52:44,070 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:44,269 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:52:44,269 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:44,270 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:52:44,270 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:44,293 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:52:44,293 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:44,294 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:52:44,294 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:44,557 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:52:44,557 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:45,421 WARN L193 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2020-10-16 04:52:45,542 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-10-16 04:52:45,553 INFO L132 LiptonReduction]: Checked pairs total: 6794 [2020-10-16 04:52:45,553 INFO L134 LiptonReduction]: Total number of compositions: 88 [2020-10-16 04:52:45,556 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5105 [2020-10-16 04:52:45,564 INFO L129 PetriNetUnfolder]: 0/19 cut-off events. [2020-10-16 04:52:45,564 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:52:45,564 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:52:45,565 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:52:45,566 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:52:45,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:52:45,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1430044184, now seen corresponding path program 1 times [2020-10-16 04:52:45,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:52:45,582 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109097354] [2020-10-16 04:52:45,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:52:45,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:52:45,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-16 04:52:45,855 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109097354] [2020-10-16 04:52:45,856 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:52:45,856 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:52:45,857 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996863428] [2020-10-16 04:52:45,867 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:52:45,867 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:52:45,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:52:45,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:52:45,887 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 199 [2020-10-16 04:52:45,890 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 72 flow. Second operand 3 states. [2020-10-16 04:52:45,890 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:52:45,890 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 199 [2020-10-16 04:52:45,892 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:52:45,965 INFO L129 PetriNetUnfolder]: 16/70 cut-off events. [2020-10-16 04:52:45,965 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:52:45,966 INFO L80 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 70 events. 16/70 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 213 event pairs, 6 based on Foata normal form. 6/67 useless extension candidates. Maximal degree in co-relation 107. Up to 27 conditions per place. [2020-10-16 04:52:45,968 INFO L132 encePairwiseOnDemand]: 195/199 looper letters, 7 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2020-10-16 04:52:45,968 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 31 transitions, 92 flow [2020-10-16 04:52:45,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:52:45,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:52:45,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 525 transitions. [2020-10-16 04:52:45,987 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8793969849246231 [2020-10-16 04:52:45,987 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 525 transitions. [2020-10-16 04:52:45,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 525 transitions. [2020-10-16 04:52:45,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:52:45,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 525 transitions. [2020-10-16 04:52:45,998 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:52:46,005 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:52:46,006 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:52:46,008 INFO L185 Difference]: Start difference. First operand has 42 places, 30 transitions, 72 flow. Second operand 3 states and 525 transitions. [2020-10-16 04:52:46,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 31 transitions, 92 flow [2020-10-16 04:52:46,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 31 transitions, 88 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-16 04:52:46,014 INFO L241 Difference]: Finished difference. Result has 39 places, 28 transitions, 68 flow [2020-10-16 04:52:46,017 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2020-10-16 04:52:46,018 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2020-10-16 04:52:46,018 INFO L481 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 68 flow [2020-10-16 04:52:46,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:52:46,019 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:52:46,019 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:52:46,019 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 04:52:46,019 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:52:46,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:52:46,020 INFO L82 PathProgramCache]: Analyzing trace with hash 667622400, now seen corresponding path program 1 times [2020-10-16 04:52:46,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:52:46,020 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924727067] [2020-10-16 04:52:46,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:52:46,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:52:46,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:52:46,214 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924727067] [2020-10-16 04:52:46,214 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:52:46,214 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 04:52:46,215 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909639633] [2020-10-16 04:52:46,216 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:52:46,216 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:52:46,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:52:46,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:52:46,219 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 199 [2020-10-16 04:52:46,219 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 68 flow. Second operand 4 states. [2020-10-16 04:52:46,219 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:52:46,219 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 199 [2020-10-16 04:52:46,220 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:52:46,275 INFO L129 PetriNetUnfolder]: 12/71 cut-off events. [2020-10-16 04:52:46,275 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:52:46,276 INFO L80 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 71 events. 12/71 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 226 event pairs, 3 based on Foata normal form. 0/66 useless extension candidates. Maximal degree in co-relation 108. Up to 20 conditions per place. [2020-10-16 04:52:46,276 INFO L132 encePairwiseOnDemand]: 194/199 looper letters, 4 selfloop transitions, 3 changer transitions 8/37 dead transitions. [2020-10-16 04:52:46,276 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 37 transitions, 116 flow [2020-10-16 04:52:46,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:52:46,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:52:46,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 857 transitions. [2020-10-16 04:52:46,280 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8613065326633166 [2020-10-16 04:52:46,280 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 857 transitions. [2020-10-16 04:52:46,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 857 transitions. [2020-10-16 04:52:46,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:52:46,281 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 857 transitions. [2020-10-16 04:52:46,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:52:46,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:52:46,285 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:52:46,285 INFO L185 Difference]: Start difference. First operand has 39 places, 28 transitions, 68 flow. Second operand 5 states and 857 transitions. [2020-10-16 04:52:46,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 37 transitions, 116 flow [2020-10-16 04:52:46,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 37 transitions, 112 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 04:52:46,287 INFO L241 Difference]: Finished difference. Result has 44 places, 29 transitions, 89 flow [2020-10-16 04:52:46,287 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=89, PETRI_PLACES=44, PETRI_TRANSITIONS=29} [2020-10-16 04:52:46,287 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2020-10-16 04:52:46,288 INFO L481 AbstractCegarLoop]: Abstraction has has 44 places, 29 transitions, 89 flow [2020-10-16 04:52:46,288 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:52:46,288 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:52:46,288 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:52:46,288 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 04:52:46,288 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:52:46,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:52:46,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1745373452, now seen corresponding path program 1 times [2020-10-16 04:52:46,289 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:52:46,289 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931380989] [2020-10-16 04:52:46,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:52:46,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:52:46,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:52:46,421 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931380989] [2020-10-16 04:52:46,421 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:52:46,422 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 04:52:46,422 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471080176] [2020-10-16 04:52:46,422 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:52:46,423 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:52:46,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:52:46,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:52:46,426 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 199 [2020-10-16 04:52:46,427 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 29 transitions, 89 flow. Second operand 4 states. [2020-10-16 04:52:46,427 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:52:46,427 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 199 [2020-10-16 04:52:46,427 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:52:46,492 INFO L129 PetriNetUnfolder]: 7/59 cut-off events. [2020-10-16 04:52:46,492 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2020-10-16 04:52:46,493 INFO L80 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 59 events. 7/59 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 169 event pairs, 3 based on Foata normal form. 5/60 useless extension candidates. Maximal degree in co-relation 107. Up to 17 conditions per place. [2020-10-16 04:52:46,494 INFO L132 encePairwiseOnDemand]: 195/199 looper letters, 2 selfloop transitions, 2 changer transitions 2/31 dead transitions. [2020-10-16 04:52:46,494 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 107 flow [2020-10-16 04:52:46,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:52:46,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:52:46,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 838 transitions. [2020-10-16 04:52:46,500 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.842211055276382 [2020-10-16 04:52:46,501 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 838 transitions. [2020-10-16 04:52:46,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 838 transitions. [2020-10-16 04:52:46,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:52:46,502 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 838 transitions. [2020-10-16 04:52:46,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:52:46,507 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:52:46,508 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:52:46,508 INFO L185 Difference]: Start difference. First operand has 44 places, 29 transitions, 89 flow. Second operand 5 states and 838 transitions. [2020-10-16 04:52:46,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 107 flow [2020-10-16 04:52:46,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 31 transitions, 102 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 04:52:46,510 INFO L241 Difference]: Finished difference. Result has 46 places, 29 transitions, 96 flow [2020-10-16 04:52:46,510 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=96, PETRI_PLACES=46, PETRI_TRANSITIONS=29} [2020-10-16 04:52:46,510 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2020-10-16 04:52:46,510 INFO L481 AbstractCegarLoop]: Abstraction has has 46 places, 29 transitions, 96 flow [2020-10-16 04:52:46,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:52:46,511 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:52:46,511 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:52:46,511 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 04:52:46,511 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:52:46,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:52:46,512 INFO L82 PathProgramCache]: Analyzing trace with hash -739666052, now seen corresponding path program 1 times [2020-10-16 04:52:46,512 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:52:46,512 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092520273] [2020-10-16 04:52:46,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:52:46,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:52:46,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:52:46,604 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092520273] [2020-10-16 04:52:46,604 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:52:46,605 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 04:52:46,605 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798094713] [2020-10-16 04:52:46,606 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:52:46,606 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:52:46,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:52:46,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:52:46,608 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 199 [2020-10-16 04:52:46,609 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 29 transitions, 96 flow. Second operand 4 states. [2020-10-16 04:52:46,609 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:52:46,609 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 199 [2020-10-16 04:52:46,609 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:52:46,674 INFO L129 PetriNetUnfolder]: 19/83 cut-off events. [2020-10-16 04:52:46,674 INFO L130 PetriNetUnfolder]: For 100/109 co-relation queries the response was YES. [2020-10-16 04:52:46,677 INFO L80 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 83 events. 19/83 cut-off events. For 100/109 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 295 event pairs, 6 based on Foata normal form. 5/82 useless extension candidates. Maximal degree in co-relation 185. Up to 26 conditions per place. [2020-10-16 04:52:46,678 INFO L132 encePairwiseOnDemand]: 194/199 looper letters, 4 selfloop transitions, 3 changer transitions 5/36 dead transitions. [2020-10-16 04:52:46,679 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 36 transitions, 138 flow [2020-10-16 04:52:46,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:52:46,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:52:46,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 854 transitions. [2020-10-16 04:52:46,683 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8582914572864322 [2020-10-16 04:52:46,683 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 854 transitions. [2020-10-16 04:52:46,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 854 transitions. [2020-10-16 04:52:46,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:52:46,684 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 854 transitions. [2020-10-16 04:52:46,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:52:46,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:52:46,689 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:52:46,689 INFO L185 Difference]: Start difference. First operand has 46 places, 29 transitions, 96 flow. Second operand 5 states and 854 transitions. [2020-10-16 04:52:46,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 36 transitions, 138 flow [2020-10-16 04:52:46,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 36 transitions, 130 flow, removed 2 selfloop flow, removed 4 redundant places. [2020-10-16 04:52:46,693 INFO L241 Difference]: Finished difference. Result has 47 places, 31 transitions, 115 flow [2020-10-16 04:52:46,694 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=115, PETRI_PLACES=47, PETRI_TRANSITIONS=31} [2020-10-16 04:52:46,694 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 5 predicate places. [2020-10-16 04:52:46,694 INFO L481 AbstractCegarLoop]: Abstraction has has 47 places, 31 transitions, 115 flow [2020-10-16 04:52:46,694 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:52:46,694 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:52:46,694 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:52:46,695 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 04:52:46,695 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:52:46,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:52:46,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1875187583, now seen corresponding path program 1 times [2020-10-16 04:52:46,696 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:52:46,696 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371383065] [2020-10-16 04:52:46,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:52:46,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:52:46,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:52:46,864 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371383065] [2020-10-16 04:52:46,865 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:52:46,865 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:52:46,866 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981621308] [2020-10-16 04:52:46,866 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:52:46,866 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:52:46,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:52:46,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:52:46,868 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 199 [2020-10-16 04:52:46,869 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 31 transitions, 115 flow. Second operand 4 states. [2020-10-16 04:52:46,869 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:52:46,869 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 199 [2020-10-16 04:52:46,870 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:52:46,963 INFO L129 PetriNetUnfolder]: 11/81 cut-off events. [2020-10-16 04:52:46,963 INFO L130 PetriNetUnfolder]: For 118/169 co-relation queries the response was YES. [2020-10-16 04:52:46,964 INFO L80 FinitePrefix]: Finished finitePrefix Result has 226 conditions, 81 events. 11/81 cut-off events. For 118/169 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 324 event pairs, 2 based on Foata normal form. 6/81 useless extension candidates. Maximal degree in co-relation 210. Up to 23 conditions per place. [2020-10-16 04:52:46,965 INFO L132 encePairwiseOnDemand]: 195/199 looper letters, 5 selfloop transitions, 3 changer transitions 2/34 dead transitions. [2020-10-16 04:52:46,965 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 34 transitions, 157 flow [2020-10-16 04:52:46,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:52:46,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:52:46,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 851 transitions. [2020-10-16 04:52:46,968 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8552763819095477 [2020-10-16 04:52:46,969 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 851 transitions. [2020-10-16 04:52:46,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 851 transitions. [2020-10-16 04:52:46,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:52:46,970 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 851 transitions. [2020-10-16 04:52:46,972 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:52:46,973 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:52:46,974 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:52:46,974 INFO L185 Difference]: Start difference. First operand has 47 places, 31 transitions, 115 flow. Second operand 5 states and 851 transitions. [2020-10-16 04:52:46,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 34 transitions, 157 flow [2020-10-16 04:52:46,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 34 transitions, 146 flow, removed 4 selfloop flow, removed 2 redundant places. [2020-10-16 04:52:46,976 INFO L241 Difference]: Finished difference. Result has 50 places, 31 transitions, 123 flow [2020-10-16 04:52:46,977 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=123, PETRI_PLACES=50, PETRI_TRANSITIONS=31} [2020-10-16 04:52:46,977 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2020-10-16 04:52:46,977 INFO L481 AbstractCegarLoop]: Abstraction has has 50 places, 31 transitions, 123 flow [2020-10-16 04:52:46,977 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:52:46,977 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:52:46,977 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:52:46,978 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 04:52:46,978 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:52:46,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:52:46,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1914313475, now seen corresponding path program 1 times [2020-10-16 04:52:46,978 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:52:46,979 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965616101] [2020-10-16 04:52:46,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:52:47,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:52:47,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:52:47,107 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965616101] [2020-10-16 04:52:47,108 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:52:47,108 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:52:47,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950245752] [2020-10-16 04:52:47,108 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 04:52:47,108 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:52:47,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 04:52:47,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-16 04:52:47,110 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 199 [2020-10-16 04:52:47,111 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 31 transitions, 123 flow. Second operand 6 states. [2020-10-16 04:52:47,111 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:52:47,111 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 199 [2020-10-16 04:52:47,112 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:52:47,476 INFO L129 PetriNetUnfolder]: 206/473 cut-off events. [2020-10-16 04:52:47,476 INFO L130 PetriNetUnfolder]: For 1531/1669 co-relation queries the response was YES. [2020-10-16 04:52:47,480 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1331 conditions, 473 events. 206/473 cut-off events. For 1531/1669 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2791 event pairs, 108 based on Foata normal form. 34/472 useless extension candidates. Maximal degree in co-relation 1313. Up to 243 conditions per place. [2020-10-16 04:52:47,484 INFO L132 encePairwiseOnDemand]: 191/199 looper letters, 9 selfloop transitions, 8 changer transitions 9/49 dead transitions. [2020-10-16 04:52:47,484 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 49 transitions, 227 flow [2020-10-16 04:52:47,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 04:52:47,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 04:52:47,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1205 transitions. [2020-10-16 04:52:47,489 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7569095477386935 [2020-10-16 04:52:47,489 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1205 transitions. [2020-10-16 04:52:47,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1205 transitions. [2020-10-16 04:52:47,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:52:47,491 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1205 transitions. [2020-10-16 04:52:47,493 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 04:52:47,496 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 04:52:47,496 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 04:52:47,496 INFO L185 Difference]: Start difference. First operand has 50 places, 31 transitions, 123 flow. Second operand 8 states and 1205 transitions. [2020-10-16 04:52:47,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 49 transitions, 227 flow [2020-10-16 04:52:47,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 49 transitions, 218 flow, removed 3 selfloop flow, removed 3 redundant places. [2020-10-16 04:52:47,503 INFO L241 Difference]: Finished difference. Result has 58 places, 38 transitions, 176 flow [2020-10-16 04:52:47,503 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=176, PETRI_PLACES=58, PETRI_TRANSITIONS=38} [2020-10-16 04:52:47,504 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 16 predicate places. [2020-10-16 04:52:47,504 INFO L481 AbstractCegarLoop]: Abstraction has has 58 places, 38 transitions, 176 flow [2020-10-16 04:52:47,504 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 04:52:47,504 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:52:47,504 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:52:47,504 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 04:52:47,504 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:52:47,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:52:47,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1502969219, now seen corresponding path program 2 times [2020-10-16 04:52:47,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:52:47,505 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078150299] [2020-10-16 04:52:47,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:52:47,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:52:47,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:52:47,639 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078150299] [2020-10-16 04:52:47,639 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:52:47,639 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:52:47,639 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69541508] [2020-10-16 04:52:47,640 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 04:52:47,640 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:52:47,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 04:52:47,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 04:52:47,642 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 199 [2020-10-16 04:52:47,644 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 38 transitions, 176 flow. Second operand 6 states. [2020-10-16 04:52:47,645 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:52:47,645 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 199 [2020-10-16 04:52:47,645 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:52:47,868 INFO L129 PetriNetUnfolder]: 168/410 cut-off events. [2020-10-16 04:52:47,869 INFO L130 PetriNetUnfolder]: For 2081/2179 co-relation queries the response was YES. [2020-10-16 04:52:47,872 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1479 conditions, 410 events. 168/410 cut-off events. For 2081/2179 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2416 event pairs, 92 based on Foata normal form. 40/421 useless extension candidates. Maximal degree in co-relation 1456. Up to 216 conditions per place. [2020-10-16 04:52:47,876 INFO L132 encePairwiseOnDemand]: 193/199 looper letters, 11 selfloop transitions, 9 changer transitions 6/49 dead transitions. [2020-10-16 04:52:47,876 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 49 transitions, 284 flow [2020-10-16 04:52:47,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 04:52:47,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 04:52:47,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 904 transitions. [2020-10-16 04:52:47,880 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7571189279731994 [2020-10-16 04:52:47,881 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 904 transitions. [2020-10-16 04:52:47,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 904 transitions. [2020-10-16 04:52:47,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:52:47,882 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 904 transitions. [2020-10-16 04:52:47,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 04:52:47,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 04:52:47,886 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 04:52:47,886 INFO L185 Difference]: Start difference. First operand has 58 places, 38 transitions, 176 flow. Second operand 6 states and 904 transitions. [2020-10-16 04:52:47,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 49 transitions, 284 flow [2020-10-16 04:52:47,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 49 transitions, 280 flow, removed 2 selfloop flow, removed 2 redundant places. [2020-10-16 04:52:47,892 INFO L241 Difference]: Finished difference. Result has 62 places, 42 transitions, 231 flow [2020-10-16 04:52:47,892 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=231, PETRI_PLACES=62, PETRI_TRANSITIONS=42} [2020-10-16 04:52:47,892 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 20 predicate places. [2020-10-16 04:52:47,892 INFO L481 AbstractCegarLoop]: Abstraction has has 62 places, 42 transitions, 231 flow [2020-10-16 04:52:47,892 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 04:52:47,892 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:52:47,893 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:52:47,893 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 04:52:47,893 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:52:47,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:52:47,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1756456555, now seen corresponding path program 1 times [2020-10-16 04:52:47,894 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:52:47,894 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977482965] [2020-10-16 04:52:47,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:52:47,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:52:48,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:52:48,036 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977482965] [2020-10-16 04:52:48,036 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:52:48,036 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:52:48,036 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248860857] [2020-10-16 04:52:48,037 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:52:48,037 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:52:48,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:52:48,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:52:48,039 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 199 [2020-10-16 04:52:48,040 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 42 transitions, 231 flow. Second operand 7 states. [2020-10-16 04:52:48,040 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:52:48,040 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 199 [2020-10-16 04:52:48,040 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:52:48,317 INFO L129 PetriNetUnfolder]: 143/367 cut-off events. [2020-10-16 04:52:48,317 INFO L130 PetriNetUnfolder]: For 2007/2092 co-relation queries the response was YES. [2020-10-16 04:52:48,321 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1506 conditions, 367 events. 143/367 cut-off events. For 2007/2092 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2099 event pairs, 21 based on Foata normal form. 40/375 useless extension candidates. Maximal degree in co-relation 1479. Up to 143 conditions per place. [2020-10-16 04:52:48,325 INFO L132 encePairwiseOnDemand]: 192/199 looper letters, 12 selfloop transitions, 14 changer transitions 5/54 dead transitions. [2020-10-16 04:52:48,325 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 54 transitions, 375 flow [2020-10-16 04:52:48,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:52:48,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:52:48,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1053 transitions. [2020-10-16 04:52:48,331 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7559224694903087 [2020-10-16 04:52:48,331 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1053 transitions. [2020-10-16 04:52:48,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1053 transitions. [2020-10-16 04:52:48,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:52:48,333 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1053 transitions. [2020-10-16 04:52:48,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:52:48,337 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:52:48,337 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:52:48,337 INFO L185 Difference]: Start difference. First operand has 62 places, 42 transitions, 231 flow. Second operand 7 states and 1053 transitions. [2020-10-16 04:52:48,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 54 transitions, 375 flow [2020-10-16 04:52:48,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 54 transitions, 366 flow, removed 3 selfloop flow, removed 2 redundant places. [2020-10-16 04:52:48,344 INFO L241 Difference]: Finished difference. Result has 67 places, 46 transitions, 300 flow [2020-10-16 04:52:48,344 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=300, PETRI_PLACES=67, PETRI_TRANSITIONS=46} [2020-10-16 04:52:48,345 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 25 predicate places. [2020-10-16 04:52:48,345 INFO L481 AbstractCegarLoop]: Abstraction has has 67 places, 46 transitions, 300 flow [2020-10-16 04:52:48,345 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:52:48,345 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:52:48,345 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:52:48,345 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 04:52:48,346 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:52:48,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:52:48,346 INFO L82 PathProgramCache]: Analyzing trace with hash 83323636, now seen corresponding path program 1 times [2020-10-16 04:52:48,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:52:48,348 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653093451] [2020-10-16 04:52:48,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:52:48,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:52:48,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:52:48,740 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653093451] [2020-10-16 04:52:48,740 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:52:48,740 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:52:48,740 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614236069] [2020-10-16 04:52:48,742 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:52:48,742 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:52:48,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:52:48,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:52:48,744 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 199 [2020-10-16 04:52:48,745 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 46 transitions, 300 flow. Second operand 7 states. [2020-10-16 04:52:48,745 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:52:48,745 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 199 [2020-10-16 04:52:48,745 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:52:48,998 INFO L129 PetriNetUnfolder]: 141/354 cut-off events. [2020-10-16 04:52:48,998 INFO L130 PetriNetUnfolder]: For 2249/2342 co-relation queries the response was YES. [2020-10-16 04:52:49,001 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1661 conditions, 354 events. 141/354 cut-off events. For 2249/2342 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1958 event pairs, 27 based on Foata normal form. 26/350 useless extension candidates. Maximal degree in co-relation 1631. Up to 176 conditions per place. [2020-10-16 04:52:49,005 INFO L132 encePairwiseOnDemand]: 191/199 looper letters, 19 selfloop transitions, 12 changer transitions 2/56 dead transitions. [2020-10-16 04:52:49,006 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 56 transitions, 455 flow [2020-10-16 04:52:49,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:52:49,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:52:49,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1029 transitions. [2020-10-16 04:52:49,010 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7386934673366834 [2020-10-16 04:52:49,010 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1029 transitions. [2020-10-16 04:52:49,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1029 transitions. [2020-10-16 04:52:49,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:52:49,012 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1029 transitions. [2020-10-16 04:52:49,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:52:49,017 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:52:49,017 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:52:49,017 INFO L185 Difference]: Start difference. First operand has 67 places, 46 transitions, 300 flow. Second operand 7 states and 1029 transitions. [2020-10-16 04:52:49,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 56 transitions, 455 flow [2020-10-16 04:52:49,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 56 transitions, 415 flow, removed 20 selfloop flow, removed 2 redundant places. [2020-10-16 04:52:49,026 INFO L241 Difference]: Finished difference. Result has 73 places, 51 transitions, 360 flow [2020-10-16 04:52:49,026 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=360, PETRI_PLACES=73, PETRI_TRANSITIONS=51} [2020-10-16 04:52:49,027 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 31 predicate places. [2020-10-16 04:52:49,027 INFO L481 AbstractCegarLoop]: Abstraction has has 73 places, 51 transitions, 360 flow [2020-10-16 04:52:49,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:52:49,027 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:52:49,027 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:52:49,027 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 04:52:49,028 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:52:49,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:52:49,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1384350984, now seen corresponding path program 2 times [2020-10-16 04:52:49,029 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:52:49,030 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110008277] [2020-10-16 04:52:49,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:52:49,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:52:49,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:52:49,377 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110008277] [2020-10-16 04:52:49,377 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:52:49,377 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 04:52:49,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603507586] [2020-10-16 04:52:49,378 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 04:52:49,378 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:52:49,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 04:52:49,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-16 04:52:49,380 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 199 [2020-10-16 04:52:49,381 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 51 transitions, 360 flow. Second operand 8 states. [2020-10-16 04:52:49,381 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:52:49,381 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 199 [2020-10-16 04:52:49,381 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:52:49,688 INFO L129 PetriNetUnfolder]: 121/334 cut-off events. [2020-10-16 04:52:49,688 INFO L130 PetriNetUnfolder]: For 1856/1953 co-relation queries the response was YES. [2020-10-16 04:52:49,692 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1513 conditions, 334 events. 121/334 cut-off events. For 1856/1953 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1897 event pairs, 19 based on Foata normal form. 31/340 useless extension candidates. Maximal degree in co-relation 1479. Up to 114 conditions per place. [2020-10-16 04:52:49,696 INFO L132 encePairwiseOnDemand]: 193/199 looper letters, 15 selfloop transitions, 15 changer transitions 2/55 dead transitions. [2020-10-16 04:52:49,697 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 55 transitions, 464 flow [2020-10-16 04:52:49,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:52:49,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:52:49,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1035 transitions. [2020-10-16 04:52:49,702 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7430007178750897 [2020-10-16 04:52:49,702 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1035 transitions. [2020-10-16 04:52:49,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1035 transitions. [2020-10-16 04:52:49,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:52:49,703 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1035 transitions. [2020-10-16 04:52:49,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:52:49,709 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:52:49,709 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:52:49,709 INFO L185 Difference]: Start difference. First operand has 73 places, 51 transitions, 360 flow. Second operand 7 states and 1035 transitions. [2020-10-16 04:52:49,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 55 transitions, 464 flow [2020-10-16 04:52:49,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 55 transitions, 433 flow, removed 12 selfloop flow, removed 3 redundant places. [2020-10-16 04:52:49,717 INFO L241 Difference]: Finished difference. Result has 77 places, 51 transitions, 381 flow [2020-10-16 04:52:49,718 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=381, PETRI_PLACES=77, PETRI_TRANSITIONS=51} [2020-10-16 04:52:49,718 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 35 predicate places. [2020-10-16 04:52:49,718 INFO L481 AbstractCegarLoop]: Abstraction has has 77 places, 51 transitions, 381 flow [2020-10-16 04:52:49,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 04:52:49,718 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:52:49,719 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:52:49,719 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 04:52:49,719 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:52:49,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:52:49,719 INFO L82 PathProgramCache]: Analyzing trace with hash 144173304, now seen corresponding path program 1 times [2020-10-16 04:52:49,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:52:49,720 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414590768] [2020-10-16 04:52:49,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:52:49,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:52:49,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:52:49,792 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414590768] [2020-10-16 04:52:49,792 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:52:49,792 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:52:49,792 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860189171] [2020-10-16 04:52:49,793 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:52:49,793 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:52:49,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:52:49,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:52:49,794 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 199 [2020-10-16 04:52:49,795 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 51 transitions, 381 flow. Second operand 4 states. [2020-10-16 04:52:49,795 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:52:49,795 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 199 [2020-10-16 04:52:49,795 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:52:50,169 INFO L129 PetriNetUnfolder]: 736/1484 cut-off events. [2020-10-16 04:52:50,169 INFO L130 PetriNetUnfolder]: For 5828/6108 co-relation queries the response was YES. [2020-10-16 04:52:50,181 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5047 conditions, 1484 events. 736/1484 cut-off events. For 5828/6108 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 10921 event pairs, 282 based on Foata normal form. 130/1385 useless extension candidates. Maximal degree in co-relation 5011. Up to 747 conditions per place. [2020-10-16 04:52:50,193 INFO L132 encePairwiseOnDemand]: 192/199 looper letters, 12 selfloop transitions, 10 changer transitions 0/64 dead transitions. [2020-10-16 04:52:50,194 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 64 transitions, 451 flow [2020-10-16 04:52:50,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:52:50,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:52:50,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 862 transitions. [2020-10-16 04:52:50,197 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8663316582914573 [2020-10-16 04:52:50,197 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 862 transitions. [2020-10-16 04:52:50,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 862 transitions. [2020-10-16 04:52:50,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:52:50,198 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 862 transitions. [2020-10-16 04:52:50,200 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:52:50,202 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:52:50,202 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:52:50,202 INFO L185 Difference]: Start difference. First operand has 77 places, 51 transitions, 381 flow. Second operand 5 states and 862 transitions. [2020-10-16 04:52:50,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 64 transitions, 451 flow [2020-10-16 04:52:50,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 64 transitions, 407 flow, removed 7 selfloop flow, removed 7 redundant places. [2020-10-16 04:52:50,217 INFO L241 Difference]: Finished difference. Result has 75 places, 60 transitions, 420 flow [2020-10-16 04:52:50,217 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=420, PETRI_PLACES=75, PETRI_TRANSITIONS=60} [2020-10-16 04:52:50,217 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 33 predicate places. [2020-10-16 04:52:50,217 INFO L481 AbstractCegarLoop]: Abstraction has has 75 places, 60 transitions, 420 flow [2020-10-16 04:52:50,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:52:50,218 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:52:50,218 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:52:50,218 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 04:52:50,218 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:52:50,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:52:50,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1404575101, now seen corresponding path program 1 times [2020-10-16 04:52:50,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:52:50,219 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712548625] [2020-10-16 04:52:50,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:52:50,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:52:50,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:52:50,289 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712548625] [2020-10-16 04:52:50,289 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:52:50,290 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:52:50,290 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957477846] [2020-10-16 04:52:50,290 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:52:50,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:52:50,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:52:50,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:52:50,292 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 199 [2020-10-16 04:52:50,292 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 60 transitions, 420 flow. Second operand 5 states. [2020-10-16 04:52:50,292 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:52:50,293 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 199 [2020-10-16 04:52:50,293 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:52:50,534 INFO L129 PetriNetUnfolder]: 467/1044 cut-off events. [2020-10-16 04:52:50,535 INFO L130 PetriNetUnfolder]: For 3593/6549 co-relation queries the response was YES. [2020-10-16 04:52:50,544 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4292 conditions, 1044 events. 467/1044 cut-off events. For 3593/6549 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 7604 event pairs, 76 based on Foata normal form. 301/1176 useless extension candidates. Maximal degree in co-relation 4257. Up to 673 conditions per place. [2020-10-16 04:52:50,552 INFO L132 encePairwiseOnDemand]: 192/199 looper letters, 12 selfloop transitions, 19 changer transitions 0/73 dead transitions. [2020-10-16 04:52:50,553 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 73 transitions, 558 flow [2020-10-16 04:52:50,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:52:50,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:52:50,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1207 transitions. [2020-10-16 04:52:50,557 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8664752333094041 [2020-10-16 04:52:50,557 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1207 transitions. [2020-10-16 04:52:50,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1207 transitions. [2020-10-16 04:52:50,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:52:50,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1207 transitions. [2020-10-16 04:52:50,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:52:50,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:52:50,564 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:52:50,564 INFO L185 Difference]: Start difference. First operand has 75 places, 60 transitions, 420 flow. Second operand 7 states and 1207 transitions. [2020-10-16 04:52:50,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 73 transitions, 558 flow [2020-10-16 04:52:50,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 73 transitions, 553 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 04:52:50,573 INFO L241 Difference]: Finished difference. Result has 83 places, 69 transitions, 557 flow [2020-10-16 04:52:50,573 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=557, PETRI_PLACES=83, PETRI_TRANSITIONS=69} [2020-10-16 04:52:50,573 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 41 predicate places. [2020-10-16 04:52:50,573 INFO L481 AbstractCegarLoop]: Abstraction has has 83 places, 69 transitions, 557 flow [2020-10-16 04:52:50,573 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:52:50,574 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:52:50,574 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] [2020-10-16 04:52:50,574 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 04:52:50,574 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:52:50,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:52:50,574 INFO L82 PathProgramCache]: Analyzing trace with hash -582631258, now seen corresponding path program 1 times [2020-10-16 04:52:50,575 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:52:50,575 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283891392] [2020-10-16 04:52:50,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:52:50,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:52:50,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:52:50,638 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283891392] [2020-10-16 04:52:50,638 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:52:50,639 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:52:50,639 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14424400] [2020-10-16 04:52:50,639 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:52:50,639 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:52:50,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:52:50,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:52:50,642 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 199 [2020-10-16 04:52:50,642 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 69 transitions, 557 flow. Second operand 4 states. [2020-10-16 04:52:50,642 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:52:50,642 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 199 [2020-10-16 04:52:50,642 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:52:50,926 INFO L129 PetriNetUnfolder]: 741/1591 cut-off events. [2020-10-16 04:52:50,926 INFO L130 PetriNetUnfolder]: For 7569/11931 co-relation queries the response was YES. [2020-10-16 04:52:50,942 INFO L80 FinitePrefix]: Finished finitePrefix Result has 7788 conditions, 1591 events. 741/1591 cut-off events. For 7569/11931 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 12244 event pairs, 119 based on Foata normal form. 62/1371 useless extension candidates. Maximal degree in co-relation 7749. Up to 1093 conditions per place. [2020-10-16 04:52:50,954 INFO L132 encePairwiseOnDemand]: 195/199 looper letters, 5 selfloop transitions, 5 changer transitions 0/72 dead transitions. [2020-10-16 04:52:50,954 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 72 transitions, 605 flow [2020-10-16 04:52:50,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:52:50,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:52:50,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 851 transitions. [2020-10-16 04:52:50,957 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8552763819095477 [2020-10-16 04:52:50,957 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 851 transitions. [2020-10-16 04:52:50,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 851 transitions. [2020-10-16 04:52:50,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:52:50,958 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 851 transitions. [2020-10-16 04:52:50,960 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:52:50,962 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:52:50,962 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:52:50,962 INFO L185 Difference]: Start difference. First operand has 83 places, 69 transitions, 557 flow. Second operand 5 states and 851 transitions. [2020-10-16 04:52:50,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 72 transitions, 605 flow [2020-10-16 04:52:50,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 72 transitions, 551 flow, removed 19 selfloop flow, removed 3 redundant places. [2020-10-16 04:52:50,988 INFO L241 Difference]: Finished difference. Result has 87 places, 71 transitions, 546 flow [2020-10-16 04:52:50,989 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=505, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=546, PETRI_PLACES=87, PETRI_TRANSITIONS=71} [2020-10-16 04:52:50,989 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 45 predicate places. [2020-10-16 04:52:50,989 INFO L481 AbstractCegarLoop]: Abstraction has has 87 places, 71 transitions, 546 flow [2020-10-16 04:52:50,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:52:50,989 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:52:50,989 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] [2020-10-16 04:52:50,989 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 04:52:50,990 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:52:50,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:52:50,990 INFO L82 PathProgramCache]: Analyzing trace with hash 929356676, now seen corresponding path program 1 times [2020-10-16 04:52:50,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:52:50,990 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031163445] [2020-10-16 04:52:50,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:52:51,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:52:51,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:52:51,118 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031163445] [2020-10-16 04:52:51,118 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:52:51,119 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:52:51,119 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151827739] [2020-10-16 04:52:51,119 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 04:52:51,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:52:51,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 04:52:51,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 04:52:51,121 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 199 [2020-10-16 04:52:51,121 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 71 transitions, 546 flow. Second operand 6 states. [2020-10-16 04:52:51,121 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:52:51,122 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 199 [2020-10-16 04:52:51,122 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:52:51,437 INFO L129 PetriNetUnfolder]: 519/1128 cut-off events. [2020-10-16 04:52:51,437 INFO L130 PetriNetUnfolder]: For 6931/12079 co-relation queries the response was YES. [2020-10-16 04:52:51,447 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5639 conditions, 1128 events. 519/1128 cut-off events. For 6931/12079 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 8257 event pairs, 14 based on Foata normal form. 496/1385 useless extension candidates. Maximal degree in co-relation 5598. Up to 737 conditions per place. [2020-10-16 04:52:51,457 INFO L132 encePairwiseOnDemand]: 192/199 looper letters, 6 selfloop transitions, 28 changer transitions 5/76 dead transitions. [2020-10-16 04:52:51,457 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 76 transitions, 666 flow [2020-10-16 04:52:51,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 04:52:51,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 04:52:51,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1552 transitions. [2020-10-16 04:52:51,464 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8665549972082636 [2020-10-16 04:52:51,464 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1552 transitions. [2020-10-16 04:52:51,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1552 transitions. [2020-10-16 04:52:51,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:52:51,466 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1552 transitions. [2020-10-16 04:52:51,470 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 04:52:51,474 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 04:52:51,474 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 04:52:51,474 INFO L185 Difference]: Start difference. First operand has 87 places, 71 transitions, 546 flow. Second operand 9 states and 1552 transitions. [2020-10-16 04:52:51,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 76 transitions, 666 flow [2020-10-16 04:52:51,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 76 transitions, 632 flow, removed 5 selfloop flow, removed 7 redundant places. [2020-10-16 04:52:51,490 INFO L241 Difference]: Finished difference. Result has 91 places, 71 transitions, 602 flow [2020-10-16 04:52:51,491 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=602, PETRI_PLACES=91, PETRI_TRANSITIONS=71} [2020-10-16 04:52:51,491 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 49 predicate places. [2020-10-16 04:52:51,491 INFO L481 AbstractCegarLoop]: Abstraction has has 91 places, 71 transitions, 602 flow [2020-10-16 04:52:51,491 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 04:52:51,492 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:52:51,492 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:52:51,492 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 04:52:51,492 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:52:51,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:52:51,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1381157918, now seen corresponding path program 1 times [2020-10-16 04:52:51,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:52:51,493 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941411145] [2020-10-16 04:52:51,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:52:51,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:52:51,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:52:51,570 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941411145] [2020-10-16 04:52:51,571 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:52:51,571 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:52:51,571 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649776600] [2020-10-16 04:52:51,571 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:52:51,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:52:51,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:52:51,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:52:51,573 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 199 [2020-10-16 04:52:51,574 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 71 transitions, 602 flow. Second operand 5 states. [2020-10-16 04:52:51,574 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:52:51,574 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 199 [2020-10-16 04:52:51,574 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:52:51,845 INFO L129 PetriNetUnfolder]: 930/2034 cut-off events. [2020-10-16 04:52:51,846 INFO L130 PetriNetUnfolder]: For 15550/19395 co-relation queries the response was YES. [2020-10-16 04:52:51,863 INFO L80 FinitePrefix]: Finished finitePrefix Result has 11039 conditions, 2034 events. 930/2034 cut-off events. For 15550/19395 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 17366 event pairs, 22 based on Foata normal form. 21/1662 useless extension candidates. Maximal degree in co-relation 10998. Up to 1329 conditions per place. [2020-10-16 04:52:51,878 INFO L132 encePairwiseOnDemand]: 195/199 looper letters, 7 selfloop transitions, 3 changer transitions 1/76 dead transitions. [2020-10-16 04:52:51,878 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 76 transitions, 686 flow [2020-10-16 04:52:51,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:52:51,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:52:51,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 825 transitions. [2020-10-16 04:52:51,882 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8291457286432161 [2020-10-16 04:52:51,882 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 825 transitions. [2020-10-16 04:52:51,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 825 transitions. [2020-10-16 04:52:51,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:52:51,883 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 825 transitions. [2020-10-16 04:52:51,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:52:51,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:52:51,887 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:52:51,887 INFO L185 Difference]: Start difference. First operand has 91 places, 71 transitions, 602 flow. Second operand 5 states and 825 transitions. [2020-10-16 04:52:51,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 76 transitions, 686 flow [2020-10-16 04:52:52,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 76 transitions, 585 flow, removed 36 selfloop flow, removed 5 redundant places. [2020-10-16 04:52:52,075 INFO L241 Difference]: Finished difference. Result has 92 places, 73 transitions, 540 flow [2020-10-16 04:52:52,076 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=540, PETRI_PLACES=92, PETRI_TRANSITIONS=73} [2020-10-16 04:52:52,076 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 50 predicate places. [2020-10-16 04:52:52,076 INFO L481 AbstractCegarLoop]: Abstraction has has 92 places, 73 transitions, 540 flow [2020-10-16 04:52:52,076 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:52:52,076 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:52:52,076 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:52:52,076 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 04:52:52,077 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:52:52,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:52:52,077 INFO L82 PathProgramCache]: Analyzing trace with hash 507641468, now seen corresponding path program 2 times [2020-10-16 04:52:52,077 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:52:52,077 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481309067] [2020-10-16 04:52:52,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:52:52,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:52:52,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:52:52,169 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481309067] [2020-10-16 04:52:52,170 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:52:52,170 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 04:52:52,170 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834838217] [2020-10-16 04:52:52,170 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:52:52,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:52:52,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:52:52,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:52:52,172 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 199 [2020-10-16 04:52:52,173 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 73 transitions, 540 flow. Second operand 7 states. [2020-10-16 04:52:52,173 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:52:52,173 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 199 [2020-10-16 04:52:52,173 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:52:52,742 INFO L129 PetriNetUnfolder]: 877/1856 cut-off events. [2020-10-16 04:52:52,742 INFO L130 PetriNetUnfolder]: For 7629/13923 co-relation queries the response was YES. [2020-10-16 04:52:52,754 INFO L80 FinitePrefix]: Finished finitePrefix Result has 8173 conditions, 1856 events. 877/1856 cut-off events. For 7629/13923 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 15552 event pairs, 0 based on Foata normal form. 887/2355 useless extension candidates. Maximal degree in co-relation 8130. Up to 620 conditions per place. [2020-10-16 04:52:52,765 INFO L132 encePairwiseOnDemand]: 192/199 looper letters, 2 selfloop transitions, 30 changer transitions 20/78 dead transitions. [2020-10-16 04:52:52,765 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 78 transitions, 674 flow [2020-10-16 04:52:52,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-16 04:52:52,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-16 04:52:52,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1889 transitions. [2020-10-16 04:52:52,771 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8629511192325263 [2020-10-16 04:52:52,772 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1889 transitions. [2020-10-16 04:52:52,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1889 transitions. [2020-10-16 04:52:52,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:52:52,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1889 transitions. [2020-10-16 04:52:52,777 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-16 04:52:52,782 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-16 04:52:52,782 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-16 04:52:52,782 INFO L185 Difference]: Start difference. First operand has 92 places, 73 transitions, 540 flow. Second operand 11 states and 1889 transitions. [2020-10-16 04:52:52,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 78 transitions, 674 flow [2020-10-16 04:52:52,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 78 transitions, 619 flow, removed 21 selfloop flow, removed 7 redundant places. [2020-10-16 04:52:52,864 INFO L241 Difference]: Finished difference. Result has 98 places, 58 transitions, 455 flow [2020-10-16 04:52:52,865 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=455, PETRI_PLACES=98, PETRI_TRANSITIONS=58} [2020-10-16 04:52:52,865 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 56 predicate places. [2020-10-16 04:52:52,865 INFO L481 AbstractCegarLoop]: Abstraction has has 98 places, 58 transitions, 455 flow [2020-10-16 04:52:52,865 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:52:52,865 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:52:52,865 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] [2020-10-16 04:52:52,866 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 04:52:52,866 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:52:52,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:52:52,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1261354147, now seen corresponding path program 1 times [2020-10-16 04:52:52,866 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:52:52,867 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145857608] [2020-10-16 04:52:52,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:52:52,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 04:52:52,926 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 04:52:52,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 04:52:52,971 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 04:52:53,026 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 04:52:53,027 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 04:52:53,028 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-16 04:52:53,059 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,059 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,060 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,060 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,060 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,061 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,061 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,061 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,061 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,061 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,061 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,061 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,062 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,062 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,063 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,063 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,063 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,063 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,063 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,063 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,063 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,064 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,066 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,066 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,067 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,067 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,067 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,067 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,067 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,067 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,067 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,068 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,068 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,068 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,072 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,073 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,073 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,073 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,073 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,074 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,074 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,074 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,074 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,074 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,074 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,074 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,075 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,075 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,075 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,075 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,075 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,075 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,075 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,076 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,076 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,076 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 04:52:53 BasicIcfg [2020-10-16 04:52:53,181 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 04:52:53,182 INFO L168 Benchmark]: Toolchain (without parser) took 15880.87 ms. Allocated memory was 253.8 MB in the beginning and 645.9 MB in the end (delta: 392.2 MB). Free memory was 208.5 MB in the beginning and 498.3 MB in the end (delta: -289.9 MB). Peak memory consumption was 102.3 MB. Max. memory is 14.2 GB. [2020-10-16 04:52:53,183 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 253.8 MB. Free memory is still 230.1 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 04:52:53,184 INFO L168 Benchmark]: CACSL2BoogieTranslator took 742.37 ms. Allocated memory was 253.8 MB in the beginning and 322.4 MB in the end (delta: 68.7 MB). Free memory was 208.5 MB in the beginning and 270.5 MB in the end (delta: -62.0 MB). Peak memory consumption was 29.6 MB. Max. memory is 14.2 GB. [2020-10-16 04:52:53,185 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.16 ms. Allocated memory is still 322.4 MB. Free memory was 270.5 MB in the beginning and 268.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 04:52:53,185 INFO L168 Benchmark]: Boogie Preprocessor took 61.73 ms. Allocated memory is still 322.4 MB. Free memory was 268.0 MB in the beginning and 265.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 04:52:53,190 INFO L168 Benchmark]: RCFGBuilder took 2056.77 ms. Allocated memory was 322.4 MB in the beginning and 361.2 MB in the end (delta: 38.8 MB). Free memory was 265.5 MB in the beginning and 200.9 MB in the end (delta: 64.6 MB). Peak memory consumption was 103.4 MB. Max. memory is 14.2 GB. [2020-10-16 04:52:53,191 INFO L168 Benchmark]: TraceAbstraction took 12941.28 ms. Allocated memory was 361.2 MB in the beginning and 645.9 MB in the end (delta: 284.7 MB). Free memory was 200.9 MB in the beginning and 498.3 MB in the end (delta: -297.5 MB). There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 04:52:53,199 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.18 ms. Allocated memory is still 253.8 MB. Free memory is still 230.1 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 742.37 ms. Allocated memory was 253.8 MB in the beginning and 322.4 MB in the end (delta: 68.7 MB). Free memory was 208.5 MB in the beginning and 270.5 MB in the end (delta: -62.0 MB). Peak memory consumption was 29.6 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 73.16 ms. Allocated memory is still 322.4 MB. Free memory was 270.5 MB in the beginning and 268.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 61.73 ms. Allocated memory is still 322.4 MB. Free memory was 268.0 MB in the beginning and 265.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2056.77 ms. Allocated memory was 322.4 MB in the beginning and 361.2 MB in the end (delta: 38.8 MB). Free memory was 265.5 MB in the beginning and 200.9 MB in the end (delta: 64.6 MB). Peak memory consumption was 103.4 MB. Max. memory is 14.2 GB. * TraceAbstraction took 12941.28 ms. Allocated memory was 361.2 MB in the beginning and 645.9 MB in the end (delta: 284.7 MB). Free memory was 200.9 MB in the beginning and 498.3 MB in the end (delta: -297.5 MB). There was no memory consumed. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1640 VarBasedMoverChecksPositive, 61 VarBasedMoverChecksNegative, 15 SemBasedMoverChecksPositive, 46 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.1s, 209 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 5.0s, 118 PlacesBefore, 42 PlacesAfterwards, 107 TransitionsBefore, 30 TransitionsAfterwards, 2540 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 88 TotalNumberOfCompositions, 6794 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p3_EAX = 0; [L703] 0 int __unbuffered_p3_EBX = 0; [L705] 0 int a = 0; [L707] 0 int b = 0; [L708] 0 _Bool main$tmp_guard0; [L709] 0 _Bool main$tmp_guard1; [L711] 0 int x = 0; [L713] 0 int y = 0; [L715] 0 int z = 0; [L716] 0 _Bool z$flush_delayed; [L717] 0 int z$mem_tmp; [L718] 0 _Bool z$r_buff0_thd0; [L719] 0 _Bool z$r_buff0_thd1; [L720] 0 _Bool z$r_buff0_thd2; [L721] 0 _Bool z$r_buff0_thd3; [L722] 0 _Bool z$r_buff0_thd4; [L723] 0 _Bool z$r_buff1_thd0; [L724] 0 _Bool z$r_buff1_thd1; [L725] 0 _Bool z$r_buff1_thd2; [L726] 0 _Bool z$r_buff1_thd3; [L727] 0 _Bool z$r_buff1_thd4; [L728] 0 _Bool z$read_delayed; [L729] 0 int *z$read_delayed_var; [L730] 0 int z$w_buff0; [L731] 0 _Bool z$w_buff0_used; [L732] 0 int z$w_buff1; [L733] 0 _Bool z$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L833] 0 pthread_t t1253; [L834] FCALL, FORK 0 pthread_create(&t1253, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] 0 pthread_t t1254; [L836] FCALL, FORK 0 pthread_create(&t1254, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] 0 pthread_t t1255; [L838] FCALL, FORK 0 pthread_create(&t1255, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] 0 pthread_t t1256; [L840] FCALL, FORK 0 pthread_create(&t1256, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 4 z$w_buff1 = z$w_buff0 [L790] 4 z$w_buff0 = 2 [L791] 4 z$w_buff1_used = z$w_buff0_used [L792] 4 z$w_buff0_used = (_Bool)1 [L7] COND TRUE 4 !expression [L7] 4 __VERIFIER_error() [L794] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L795] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L796] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L797] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L798] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L799] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 4 a = 1 [L805] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L808] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L739] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L775] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L776] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L776] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L777] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L777] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L778] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L778] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L779] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L779] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L811] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L811] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L812] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L812] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L813] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L813] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L814] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L814] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L815] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 1 return 0; [L762] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 2 return 0; [L782] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 3 return 0; [L818] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 4 return 0; [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L846] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L846] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L846] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L846] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L847] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L848] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L849] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L850] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L853] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L854] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L855] 0 z$flush_delayed = weak$$choice2 [L856] 0 z$mem_tmp = z [L857] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1 [L857] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L857] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L858] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L858] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L858] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L858] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L859] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L859] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L859] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L859] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L860] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L860] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L861] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L861] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L862] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L863] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L865] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L865] 0 z = z$flush_delayed ? z$mem_tmp : z [L866] 0 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 110 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: 12.6s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.1s, HoareTripleCheckerStatistics: 79 SDtfs, 62 SDslu, 71 SDs, 0 SdLazy, 450 SolverSat, 131 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=602occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 304 NumberOfCodeBlocks, 304 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 261 ConstructedInterpolants, 0 QuantifiedInterpolants, 32269 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...