/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/mix028_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 04:46:30,792 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 04:46:30,795 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 04:46:30,832 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 04:46:30,833 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 04:46:30,841 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 04:46:30,844 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 04:46:30,848 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 04:46:30,850 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 04:46:30,851 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 04:46:30,851 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 04:46:30,854 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 04:46:30,855 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 04:46:30,859 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 04:46:30,861 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 04:46:30,863 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 04:46:30,864 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 04:46:30,865 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 04:46:30,866 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 04:46:30,872 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 04:46:30,875 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 04:46:30,879 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 04:46:30,880 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 04:46:30,880 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 04:46:30,882 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 04:46:30,883 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 04:46:30,883 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 04:46:30,892 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 04:46:30,893 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 04:46:30,893 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 04:46:30,894 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 04:46:30,897 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 04:46:30,898 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 04:46:30,898 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 04:46:30,900 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 04:46:30,901 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 04:46:30,901 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 04:46:30,901 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 04:46:30,902 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 04:46:30,903 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 04:46:30,904 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 04:46:30,905 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:46:30,944 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 04:46:30,945 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 04:46:30,946 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 04:46:30,947 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 04:46:30,947 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 04:46:30,947 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 04:46:30,947 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 04:46:30,947 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 04:46:30,948 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 04:46:30,948 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 04:46:30,949 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 04:46:30,949 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 04:46:30,950 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 04:46:30,950 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 04:46:30,950 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 04:46:30,951 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 04:46:30,951 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 04:46:30,951 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 04:46:30,951 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 04:46:30,952 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 04:46:30,952 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 04:46:30,952 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 04:46:30,952 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 04:46:30,952 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 04:46:30,953 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 04:46:30,953 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 04:46:30,953 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 04:46:30,953 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 04:46:30,953 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 04:46:31,236 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 04:46:31,247 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 04:46:31,251 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 04:46:31,254 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 04:46:31,255 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 04:46:31,256 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_power.opt.i [2020-10-16 04:46:31,317 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/635b3e726/41e5e0e4471f42afb6fa4812c95b611e/FLAG387844f99 [2020-10-16 04:46:31,867 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 04:46:31,868 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_power.opt.i [2020-10-16 04:46:31,884 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/635b3e726/41e5e0e4471f42afb6fa4812c95b611e/FLAG387844f99 [2020-10-16 04:46:32,141 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/635b3e726/41e5e0e4471f42afb6fa4812c95b611e [2020-10-16 04:46:32,149 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 04:46:32,151 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 04:46:32,152 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 04:46:32,152 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 04:46:32,157 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 04:46:32,158 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:46:32" (1/1) ... [2020-10-16 04:46:32,161 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11c5db74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:46:32, skipping insertion in model container [2020-10-16 04:46:32,162 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:46:32" (1/1) ... [2020-10-16 04:46:32,170 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 04:46:32,215 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 04:46:32,789 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:46:32,802 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 04:46:32,869 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:46:32,947 INFO L208 MainTranslator]: Completed translation [2020-10-16 04:46:32,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:46:32 WrapperNode [2020-10-16 04:46:32,948 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 04:46:32,949 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 04:46:32,949 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 04:46:32,949 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 04:46:32,958 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:46:32" (1/1) ... [2020-10-16 04:46:32,978 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:46:32" (1/1) ... [2020-10-16 04:46:33,020 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 04:46:33,020 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 04:46:33,020 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 04:46:33,020 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 04:46:33,029 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:46:32" (1/1) ... [2020-10-16 04:46:33,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:46:32" (1/1) ... [2020-10-16 04:46:33,034 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:46:32" (1/1) ... [2020-10-16 04:46:33,034 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:46:32" (1/1) ... [2020-10-16 04:46:33,045 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:46:32" (1/1) ... [2020-10-16 04:46:33,050 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:46:32" (1/1) ... [2020-10-16 04:46:33,053 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:46:32" (1/1) ... [2020-10-16 04:46:33,059 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 04:46:33,059 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 04:46:33,060 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 04:46:33,060 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 04:46:33,061 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:46:32" (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:46:33,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 04:46:33,163 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 04:46:33,163 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 04:46:33,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 04:46:33,163 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 04:46:33,164 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 04:46:33,165 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 04:46:33,165 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 04:46:33,166 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 04:46:33,166 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 04:46:33,168 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 04:46:33,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 04:46:33,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 04:46:33,173 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:46:35,305 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 04:46:35,306 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 04:46:35,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:46:35 BoogieIcfgContainer [2020-10-16 04:46:35,308 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 04:46:35,310 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 04:46:35,310 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 04:46:35,313 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 04:46:35,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 04:46:32" (1/3) ... [2020-10-16 04:46:35,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52d73abd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:46:35, skipping insertion in model container [2020-10-16 04:46:35,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:46:32" (2/3) ... [2020-10-16 04:46:35,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52d73abd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:46:35, skipping insertion in model container [2020-10-16 04:46:35,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:46:35" (3/3) ... [2020-10-16 04:46:35,317 INFO L111 eAbstractionObserver]: Analyzing ICFG mix028_power.opt.i [2020-10-16 04:46:35,329 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 04:46:35,337 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 04:46:35,338 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 04:46:35,367 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,368 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,368 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,368 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,369 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,369 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,369 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,369 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,370 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,370 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,370 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,371 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,371 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,371 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,372 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,372 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,372 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,372 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,373 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,373 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,373 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,374 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,374 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,374 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,374 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,375 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,375 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,375 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,376 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,376 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,376 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,376 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,377 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,377 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,377 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,377 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,378 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,378 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,378 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,378 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,378 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,379 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,379 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,383 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,384 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,384 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,384 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,384 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,385 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,393 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,393 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,393 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,393 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,394 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,394 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,394 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,394 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,395 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,395 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,397 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,397 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,397 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,397 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,398 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,398 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,398 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,398 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,399 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,399 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,399 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,399 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:35,417 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 04:46:35,439 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 04:46:35,439 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 04:46:35,440 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 04:46:35,440 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 04:46:35,440 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 04:46:35,440 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 04:46:35,440 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 04:46:35,441 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 04:46:35,455 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 102 places, 94 transitions, 203 flow [2020-10-16 04:46:35,503 INFO L129 PetriNetUnfolder]: 2/91 cut-off events. [2020-10-16 04:46:35,504 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:46:35,509 INFO L80 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 91 events. 2/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2020-10-16 04:46:35,509 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 94 transitions, 203 flow [2020-10-16 04:46:35,552 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 91 transitions, 191 flow [2020-10-16 04:46:35,554 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 04:46:35,558 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 91 transitions, 191 flow [2020-10-16 04:46:35,561 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 91 transitions, 191 flow [2020-10-16 04:46:35,562 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 99 places, 91 transitions, 191 flow [2020-10-16 04:46:35,605 INFO L129 PetriNetUnfolder]: 2/91 cut-off events. [2020-10-16 04:46:35,606 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:46:35,607 INFO L80 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 91 events. 2/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2020-10-16 04:46:35,612 INFO L117 LiptonReduction]: Number of co-enabled transitions 1724 [2020-10-16 04:46:35,794 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:35,794 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:35,796 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:35,797 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:35,801 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:35,802 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:35,805 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:35,806 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:35,829 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:35,830 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:35,831 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:35,831 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:35,835 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:35,835 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:35,838 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:35,838 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:35,914 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:35,915 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:35,916 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:35,917 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:35,919 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:35,920 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:35,922 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:35,923 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:35,941 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:35,941 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:35,943 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:35,943 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:35,946 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:35,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:35,949 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:35,950 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:35,985 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 04:46:35,986 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:35,988 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 04:46:35,988 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:36,004 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:46:36,004 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:36,005 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:46:36,006 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:36,007 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:46:36,007 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:36,040 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-10-16 04:46:36,040 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:36,042 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 04:46:36,042 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:37,397 WARN L193 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 228 DAG size of output: 187 [2020-10-16 04:46:37,420 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-10-16 04:46:37,420 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:37,421 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 04:46:37,422 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:38,282 WARN L193 SmtUtils]: Spent 850.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 124 [2020-10-16 04:46:38,394 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:46:38,394 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:38,449 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:38,449 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:38,450 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:38,450 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:38,453 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:38,453 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:38,456 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:38,456 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:38,475 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:38,475 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:38,476 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:38,476 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:38,478 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:38,479 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:38,481 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:38,482 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:38,533 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:38,534 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:38,535 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:38,535 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:38,537 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:38,538 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:38,540 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:38,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:38,575 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:38,575 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:38,576 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:38,577 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:38,579 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:38,579 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:38,583 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:38,583 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:38,647 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:38,647 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:38,648 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:38,648 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:38,650 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:38,651 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:38,655 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:38,655 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:38,677 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:38,677 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:38,678 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:38,679 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:38,681 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:38,681 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:38,683 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:38,683 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:39,449 WARN L193 SmtUtils]: Spent 457.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2020-10-16 04:46:39,864 WARN L193 SmtUtils]: Spent 409.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2020-10-16 04:46:39,920 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:46:39,920 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:40,573 WARN L193 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-16 04:46:41,660 WARN L193 SmtUtils]: Spent 925.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 108 [2020-10-16 04:46:41,958 WARN L193 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2020-10-16 04:46:42,002 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:42,003 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:42,004 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:42,004 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:42,006 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:42,006 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:42,008 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:42,008 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:42,033 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:42,033 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:42,034 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:42,034 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:42,035 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:42,035 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:42,037 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:42,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:42,193 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:42,193 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:42,194 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:42,194 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:42,196 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:42,197 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:42,198 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:42,199 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:42,215 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:42,215 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:42,216 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:42,216 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:42,218 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:42,218 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:42,220 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:42,221 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:42,261 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:46:42,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:42,337 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:42,338 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:42,338 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:42,339 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:42,340 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:42,341 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:42,342 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:42,343 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:42,360 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:42,360 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:42,361 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:42,361 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:42,363 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:42,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:42,365 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:42,365 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:42,465 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:42,465 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:42,466 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:42,466 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:42,469 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:42,469 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:42,471 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:42,471 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:42,485 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:42,488 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:42,489 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:42,490 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:42,493 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:42,494 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:42,498 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:42,499 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:43,340 WARN L193 SmtUtils]: Spent 723.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 132 [2020-10-16 04:46:43,665 WARN L193 SmtUtils]: Spent 322.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2020-10-16 04:46:43,766 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:46:43,767 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:46:43,769 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:46:43,769 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:43,786 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:46:43,786 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:43,787 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 3, 2, 1] term [2020-10-16 04:46:43,787 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:43,788 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:43,791 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:43,792 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:43,792 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:43,793 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:43,794 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:43,795 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:43,795 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:43,797 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:46:43,800 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:43,801 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:43,801 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:43,802 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:43,802 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:43,852 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:46:43,852 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:43,853 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 3, 2, 1] term [2020-10-16 04:46:43,854 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:43,854 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:43,854 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:43,855 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:43,856 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:43,857 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:43,858 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:43,859 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:43,859 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:43,861 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:46:43,861 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:43,862 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:43,863 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:43,864 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:43,864 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:43,886 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:46:43,886 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:46:43,888 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:46:43,889 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:43,999 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:46:43,999 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:44,000 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 3, 2, 1] term [2020-10-16 04:46:44,000 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:44,001 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:44,001 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:44,002 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:44,002 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:44,003 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:44,003 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:44,004 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:44,004 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:44,005 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:46:44,005 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:44,006 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:44,006 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:44,008 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:44,008 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:44,023 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:46:44,024 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:46:44,026 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:46:44,026 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:44,319 WARN L193 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2020-10-16 04:46:44,431 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-16 04:46:44,505 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:46:44,506 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:44,506 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 3, 2, 1] term [2020-10-16 04:46:44,507 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:44,507 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:44,508 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:44,509 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:44,509 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:44,510 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:44,511 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:44,512 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:44,513 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:44,514 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:46:44,514 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:44,516 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:44,516 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:44,517 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:44,518 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:44,537 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:46:44,538 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:46:44,540 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:46:44,540 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:44,577 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:46:44,578 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:46:44,580 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:46:44,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:44,599 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:46:44,599 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:44,600 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 3, 2, 1] term [2020-10-16 04:46:44,600 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:44,601 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:44,601 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:44,602 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:44,602 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:44,604 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:44,605 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:44,607 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:44,607 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:44,611 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:46:44,611 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:44,616 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:44,617 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:44,619 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:44,619 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:44,704 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:46:44,705 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:46:44,707 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:46:44,707 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:44,725 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:46:44,725 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:44,726 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 3, 2, 1] term [2020-10-16 04:46:44,727 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:44,727 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:44,728 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:44,729 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:44,729 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:44,730 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:44,731 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:44,732 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:44,732 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:44,735 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:46:44,735 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:44,737 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:44,738 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:44,739 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:44,740 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:44,783 INFO L132 LiptonReduction]: Checked pairs total: 4822 [2020-10-16 04:46:44,783 INFO L134 LiptonReduction]: Total number of compositions: 78 [2020-10-16 04:46:44,786 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9234 [2020-10-16 04:46:44,792 INFO L129 PetriNetUnfolder]: 0/6 cut-off events. [2020-10-16 04:46:44,793 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:46:44,793 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:46:44,794 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2020-10-16 04:46:44,794 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:46:44,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:46:44,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1007243959, now seen corresponding path program 1 times [2020-10-16 04:46:44,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:46:44,811 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420220049] [2020-10-16 04:46:44,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:46:44,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:46:45,039 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:46:45,040 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420220049] [2020-10-16 04:46:45,041 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:46:45,042 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:46:45,043 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153203049] [2020-10-16 04:46:45,055 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:46:45,055 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:46:45,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:46:45,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:46:45,075 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 172 [2020-10-16 04:46:45,080 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states. [2020-10-16 04:46:45,080 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:46:45,080 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 172 [2020-10-16 04:46:45,082 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:46:45,199 INFO L129 PetriNetUnfolder]: 69/141 cut-off events. [2020-10-16 04:46:45,200 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:46:45,200 INFO L80 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 141 events. 69/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 600 event pairs, 39 based on Foata normal form. 11/132 useless extension candidates. Maximal degree in co-relation 259. Up to 89 conditions per place. [2020-10-16 04:46:45,203 INFO L132 encePairwiseOnDemand]: 168/172 looper letters, 9 selfloop transitions, 2 changer transitions 2/28 dead transitions. [2020-10-16 04:46:45,203 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 28 transitions, 91 flow [2020-10-16 04:46:45,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:46:45,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:46:45,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 436 transitions. [2020-10-16 04:46:45,221 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8449612403100775 [2020-10-16 04:46:45,222 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 436 transitions. [2020-10-16 04:46:45,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 436 transitions. [2020-10-16 04:46:45,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:46:45,228 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 436 transitions. [2020-10-16 04:46:45,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:46:45,240 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:46:45,240 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:46:45,242 INFO L185 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 436 transitions. [2020-10-16 04:46:45,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 28 transitions, 91 flow [2020-10-16 04:46:45,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 28 transitions, 88 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-16 04:46:45,249 INFO L241 Difference]: Finished difference. Result has 32 places, 22 transitions, 54 flow [2020-10-16 04:46:45,252 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2020-10-16 04:46:45,253 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2020-10-16 04:46:45,253 INFO L481 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 54 flow [2020-10-16 04:46:45,253 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:46:45,253 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:46:45,253 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:46:45,254 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 04:46:45,254 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:46:45,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:46:45,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1612855145, now seen corresponding path program 1 times [2020-10-16 04:46:45,255 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:46:45,255 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267274476] [2020-10-16 04:46:45,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:46:45,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:46:45,388 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:46:45,389 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267274476] [2020-10-16 04:46:45,389 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:46:45,389 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:46:45,389 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599095049] [2020-10-16 04:46:45,391 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:46:45,391 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:46:45,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:46:45,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:46:45,393 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 172 [2020-10-16 04:46:45,393 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 54 flow. Second operand 3 states. [2020-10-16 04:46:45,393 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:46:45,394 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 172 [2020-10-16 04:46:45,394 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:46:45,493 INFO L129 PetriNetUnfolder]: 156/300 cut-off events. [2020-10-16 04:46:45,493 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-16 04:46:45,495 INFO L80 FinitePrefix]: Finished finitePrefix Result has 582 conditions, 300 events. 156/300 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1454 event pairs, 89 based on Foata normal form. 2/299 useless extension candidates. Maximal degree in co-relation 573. Up to 246 conditions per place. [2020-10-16 04:46:45,498 INFO L132 encePairwiseOnDemand]: 168/172 looper letters, 11 selfloop transitions, 3 changer transitions 0/26 dead transitions. [2020-10-16 04:46:45,498 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 26 transitions, 92 flow [2020-10-16 04:46:45,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:46:45,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:46:45,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 414 transitions. [2020-10-16 04:46:45,502 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8023255813953488 [2020-10-16 04:46:45,502 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 414 transitions. [2020-10-16 04:46:45,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 414 transitions. [2020-10-16 04:46:45,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:46:45,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 414 transitions. [2020-10-16 04:46:45,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:46:45,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:46:45,505 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:46:45,505 INFO L185 Difference]: Start difference. First operand has 32 places, 22 transitions, 54 flow. Second operand 3 states and 414 transitions. [2020-10-16 04:46:45,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 26 transitions, 92 flow [2020-10-16 04:46:45,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 26 transitions, 86 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 04:46:45,507 INFO L241 Difference]: Finished difference. Result has 32 places, 24 transitions, 69 flow [2020-10-16 04:46:45,507 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2020-10-16 04:46:45,508 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2020-10-16 04:46:45,508 INFO L481 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 69 flow [2020-10-16 04:46:45,508 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:46:45,508 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:46:45,508 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:46:45,509 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 04:46:45,509 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:46:45,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:46:45,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1101153148, now seen corresponding path program 1 times [2020-10-16 04:46:45,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:46:45,510 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109684408] [2020-10-16 04:46:45,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:46:45,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:46:45,588 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:46:45,589 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109684408] [2020-10-16 04:46:45,589 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:46:45,589 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 04:46:45,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867467188] [2020-10-16 04:46:45,590 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:46:45,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:46:45,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:46:45,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:46:45,592 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 172 [2020-10-16 04:46:45,593 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 69 flow. Second operand 4 states. [2020-10-16 04:46:45,593 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:46:45,593 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 172 [2020-10-16 04:46:45,593 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:46:45,710 INFO L129 PetriNetUnfolder]: 151/288 cut-off events. [2020-10-16 04:46:45,711 INFO L130 PetriNetUnfolder]: For 46/49 co-relation queries the response was YES. [2020-10-16 04:46:45,712 INFO L80 FinitePrefix]: Finished finitePrefix Result has 620 conditions, 288 events. 151/288 cut-off events. For 46/49 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1311 event pairs, 63 based on Foata normal form. 4/290 useless extension candidates. Maximal degree in co-relation 610. Up to 231 conditions per place. [2020-10-16 04:46:45,714 INFO L132 encePairwiseOnDemand]: 167/172 looper letters, 13 selfloop transitions, 5 changer transitions 0/30 dead transitions. [2020-10-16 04:46:45,715 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 119 flow [2020-10-16 04:46:45,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 04:46:45,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 04:46:45,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 539 transitions. [2020-10-16 04:46:45,718 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7834302325581395 [2020-10-16 04:46:45,718 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 539 transitions. [2020-10-16 04:46:45,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 539 transitions. [2020-10-16 04:46:45,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:46:45,719 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 539 transitions. [2020-10-16 04:46:45,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 04:46:45,721 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 04:46:45,721 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 04:46:45,721 INFO L185 Difference]: Start difference. First operand has 32 places, 24 transitions, 69 flow. Second operand 4 states and 539 transitions. [2020-10-16 04:46:45,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 30 transitions, 119 flow [2020-10-16 04:46:45,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 30 transitions, 116 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 04:46:45,723 INFO L241 Difference]: Finished difference. Result has 35 places, 26 transitions, 91 flow [2020-10-16 04:46:45,723 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=91, PETRI_PLACES=35, PETRI_TRANSITIONS=26} [2020-10-16 04:46:45,723 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 1 predicate places. [2020-10-16 04:46:45,724 INFO L481 AbstractCegarLoop]: Abstraction has has 35 places, 26 transitions, 91 flow [2020-10-16 04:46:45,724 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:46:45,724 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:46:45,724 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:46:45,724 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 04:46:45,724 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:46:45,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:46:45,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1541067235, now seen corresponding path program 1 times [2020-10-16 04:46:45,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:46:45,725 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383301609] [2020-10-16 04:46:45,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:46:45,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:46:45,782 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:46:45,783 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383301609] [2020-10-16 04:46:45,783 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:46:45,783 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:46:45,784 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996794693] [2020-10-16 04:46:45,784 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:46:45,784 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:46:45,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:46:45,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:46:45,786 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 172 [2020-10-16 04:46:45,786 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 91 flow. Second operand 3 states. [2020-10-16 04:46:45,787 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:46:45,787 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 172 [2020-10-16 04:46:45,787 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:46:45,857 INFO L129 PetriNetUnfolder]: 118/246 cut-off events. [2020-10-16 04:46:45,858 INFO L130 PetriNetUnfolder]: For 104/121 co-relation queries the response was YES. [2020-10-16 04:46:45,859 INFO L80 FinitePrefix]: Finished finitePrefix Result has 561 conditions, 246 events. 118/246 cut-off events. For 104/121 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1145 event pairs, 49 based on Foata normal form. 3/234 useless extension candidates. Maximal degree in co-relation 549. Up to 176 conditions per place. [2020-10-16 04:46:45,861 INFO L132 encePairwiseOnDemand]: 168/172 looper letters, 9 selfloop transitions, 4 changer transitions 0/30 dead transitions. [2020-10-16 04:46:45,861 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 30 transitions, 127 flow [2020-10-16 04:46:45,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:46:45,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:46:45,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2020-10-16 04:46:45,863 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7984496124031008 [2020-10-16 04:46:45,863 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 412 transitions. [2020-10-16 04:46:45,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 412 transitions. [2020-10-16 04:46:45,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:46:45,864 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 412 transitions. [2020-10-16 04:46:45,865 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:46:45,866 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:46:45,866 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:46:45,866 INFO L185 Difference]: Start difference. First operand has 35 places, 26 transitions, 91 flow. Second operand 3 states and 412 transitions. [2020-10-16 04:46:45,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 30 transitions, 127 flow [2020-10-16 04:46:45,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 30 transitions, 118 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 04:46:45,868 INFO L241 Difference]: Finished difference. Result has 36 places, 28 transitions, 106 flow [2020-10-16 04:46:45,869 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2020-10-16 04:46:45,869 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2020-10-16 04:46:45,869 INFO L481 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 106 flow [2020-10-16 04:46:45,869 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:46:45,869 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:46:45,869 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:46:45,870 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 04:46:45,870 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:46:45,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:46:45,870 INFO L82 PathProgramCache]: Analyzing trace with hash 529395380, now seen corresponding path program 1 times [2020-10-16 04:46:45,870 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:46:45,871 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459054582] [2020-10-16 04:46:45,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:46:45,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:46:45,941 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:46:45,942 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459054582] [2020-10-16 04:46:45,942 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:46:45,942 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 04:46:45,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736115475] [2020-10-16 04:46:45,943 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:46:45,943 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:46:45,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:46:45,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:46:45,945 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 172 [2020-10-16 04:46:45,945 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 106 flow. Second operand 4 states. [2020-10-16 04:46:45,945 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:46:45,945 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 172 [2020-10-16 04:46:45,946 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:46:46,028 INFO L129 PetriNetUnfolder]: 93/212 cut-off events. [2020-10-16 04:46:46,028 INFO L130 PetriNetUnfolder]: For 192/193 co-relation queries the response was YES. [2020-10-16 04:46:46,030 INFO L80 FinitePrefix]: Finished finitePrefix Result has 516 conditions, 212 events. 93/212 cut-off events. For 192/193 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1019 event pairs, 17 based on Foata normal form. 9/213 useless extension candidates. Maximal degree in co-relation 503. Up to 121 conditions per place. [2020-10-16 04:46:46,033 INFO L132 encePairwiseOnDemand]: 169/172 looper letters, 11 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2020-10-16 04:46:46,033 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 31 transitions, 140 flow [2020-10-16 04:46:46,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:46:46,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:46:46,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 403 transitions. [2020-10-16 04:46:46,035 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7810077519379846 [2020-10-16 04:46:46,036 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 403 transitions. [2020-10-16 04:46:46,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 403 transitions. [2020-10-16 04:46:46,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:46:46,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 403 transitions. [2020-10-16 04:46:46,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:46:46,038 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:46:46,039 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:46:46,039 INFO L185 Difference]: Start difference. First operand has 36 places, 28 transitions, 106 flow. Second operand 3 states and 403 transitions. [2020-10-16 04:46:46,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 31 transitions, 140 flow [2020-10-16 04:46:46,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 31 transitions, 136 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 04:46:46,042 INFO L241 Difference]: Finished difference. Result has 38 places, 28 transitions, 113 flow [2020-10-16 04:46:46,042 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=38, PETRI_TRANSITIONS=28} [2020-10-16 04:46:46,042 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 4 predicate places. [2020-10-16 04:46:46,042 INFO L481 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 113 flow [2020-10-16 04:46:46,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:46:46,043 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:46:46,043 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:46:46,043 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 04:46:46,043 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:46:46,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:46:46,044 INFO L82 PathProgramCache]: Analyzing trace with hash 529394078, now seen corresponding path program 1 times [2020-10-16 04:46:46,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:46:46,044 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817692148] [2020-10-16 04:46:46,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:46:46,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:46:46,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:46:46,134 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817692148] [2020-10-16 04:46:46,135 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:46:46,135 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 04:46:46,135 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880222085] [2020-10-16 04:46:46,135 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:46:46,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:46:46,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:46:46,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:46:46,137 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 172 [2020-10-16 04:46:46,138 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 113 flow. Second operand 4 states. [2020-10-16 04:46:46,138 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:46:46,138 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 172 [2020-10-16 04:46:46,138 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:46:46,237 INFO L129 PetriNetUnfolder]: 123/269 cut-off events. [2020-10-16 04:46:46,237 INFO L130 PetriNetUnfolder]: For 344/364 co-relation queries the response was YES. [2020-10-16 04:46:46,239 INFO L80 FinitePrefix]: Finished finitePrefix Result has 704 conditions, 269 events. 123/269 cut-off events. For 344/364 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1331 event pairs, 61 based on Foata normal form. 4/254 useless extension candidates. Maximal degree in co-relation 689. Up to 176 conditions per place. [2020-10-16 04:46:46,241 INFO L132 encePairwiseOnDemand]: 168/172 looper letters, 11 selfloop transitions, 5 changer transitions 0/34 dead transitions. [2020-10-16 04:46:46,241 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 34 transitions, 171 flow [2020-10-16 04:46:46,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:46:46,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:46:46,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 400 transitions. [2020-10-16 04:46:46,244 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7751937984496124 [2020-10-16 04:46:46,244 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 400 transitions. [2020-10-16 04:46:46,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 400 transitions. [2020-10-16 04:46:46,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:46:46,245 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 400 transitions. [2020-10-16 04:46:46,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:46:46,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:46:46,247 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:46:46,247 INFO L185 Difference]: Start difference. First operand has 38 places, 28 transitions, 113 flow. Second operand 3 states and 400 transitions. [2020-10-16 04:46:46,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 34 transitions, 171 flow [2020-10-16 04:46:46,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 34 transitions, 165 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 04:46:46,250 INFO L241 Difference]: Finished difference. Result has 39 places, 32 transitions, 154 flow [2020-10-16 04:46:46,251 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=39, PETRI_TRANSITIONS=32} [2020-10-16 04:46:46,251 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2020-10-16 04:46:46,251 INFO L481 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 154 flow [2020-10-16 04:46:46,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:46:46,251 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:46:46,252 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:46:46,252 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 04:46:46,252 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:46:46,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:46:46,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1075163135, now seen corresponding path program 1 times [2020-10-16 04:46:46,253 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:46:46,253 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196530337] [2020-10-16 04:46:46,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:46:46,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:46:46,408 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:46:46,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196530337] [2020-10-16 04:46:46,409 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:46:46,409 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:46:46,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631362915] [2020-10-16 04:46:46,409 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:46:46,410 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:46:46,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:46:46,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:46:46,413 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 172 [2020-10-16 04:46:46,414 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 154 flow. Second operand 5 states. [2020-10-16 04:46:46,414 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:46:46,414 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 172 [2020-10-16 04:46:46,414 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:46:46,571 INFO L129 PetriNetUnfolder]: 112/264 cut-off events. [2020-10-16 04:46:46,572 INFO L130 PetriNetUnfolder]: For 498/512 co-relation queries the response was YES. [2020-10-16 04:46:46,574 INFO L80 FinitePrefix]: Finished finitePrefix Result has 732 conditions, 264 events. 112/264 cut-off events. For 498/512 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1339 event pairs, 37 based on Foata normal form. 13/264 useless extension candidates. Maximal degree in co-relation 716. Up to 151 conditions per place. [2020-10-16 04:46:46,576 INFO L132 encePairwiseOnDemand]: 166/172 looper letters, 12 selfloop transitions, 10 changer transitions 0/40 dead transitions. [2020-10-16 04:46:46,576 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 40 transitions, 226 flow [2020-10-16 04:46:46,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 04:46:46,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 04:46:46,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 518 transitions. [2020-10-16 04:46:46,579 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.752906976744186 [2020-10-16 04:46:46,579 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 518 transitions. [2020-10-16 04:46:46,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 518 transitions. [2020-10-16 04:46:46,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:46:46,580 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 518 transitions. [2020-10-16 04:46:46,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 04:46:46,585 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 04:46:46,585 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 04:46:46,586 INFO L185 Difference]: Start difference. First operand has 39 places, 32 transitions, 154 flow. Second operand 4 states and 518 transitions. [2020-10-16 04:46:46,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 40 transitions, 226 flow [2020-10-16 04:46:46,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 40 transitions, 219 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 04:46:46,593 INFO L241 Difference]: Finished difference. Result has 43 places, 38 transitions, 215 flow [2020-10-16 04:46:46,593 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=215, PETRI_PLACES=43, PETRI_TRANSITIONS=38} [2020-10-16 04:46:46,593 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 9 predicate places. [2020-10-16 04:46:46,594 INFO L481 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 215 flow [2020-10-16 04:46:46,594 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:46:46,594 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:46:46,594 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:46:46,594 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 04:46:46,594 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:46:46,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:46:46,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1922645312, now seen corresponding path program 1 times [2020-10-16 04:46:46,595 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:46:46,595 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743144606] [2020-10-16 04:46:46,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:46:46,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:46:46,641 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:46:46,641 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743144606] [2020-10-16 04:46:46,642 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:46:46,642 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 04:46:46,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748734976] [2020-10-16 04:46:46,642 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:46:46,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:46:46,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:46:46,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:46:46,644 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 172 [2020-10-16 04:46:46,645 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 215 flow. Second operand 4 states. [2020-10-16 04:46:46,645 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:46:46,645 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 172 [2020-10-16 04:46:46,645 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:46:46,742 INFO L129 PetriNetUnfolder]: 130/274 cut-off events. [2020-10-16 04:46:46,742 INFO L130 PetriNetUnfolder]: For 959/1033 co-relation queries the response was YES. [2020-10-16 04:46:46,744 INFO L80 FinitePrefix]: Finished finitePrefix Result has 943 conditions, 274 events. 130/274 cut-off events. For 959/1033 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1317 event pairs, 32 based on Foata normal form. 13/270 useless extension candidates. Maximal degree in co-relation 924. Up to 162 conditions per place. [2020-10-16 04:46:46,746 INFO L132 encePairwiseOnDemand]: 165/172 looper letters, 14 selfloop transitions, 16 changer transitions 0/48 dead transitions. [2020-10-16 04:46:46,746 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 48 transitions, 331 flow [2020-10-16 04:46:46,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 04:46:46,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 04:46:46,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 538 transitions. [2020-10-16 04:46:46,749 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7819767441860465 [2020-10-16 04:46:46,750 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 538 transitions. [2020-10-16 04:46:46,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 538 transitions. [2020-10-16 04:46:46,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:46:46,751 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 538 transitions. [2020-10-16 04:46:46,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 04:46:46,753 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 04:46:46,753 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 04:46:46,754 INFO L185 Difference]: Start difference. First operand has 43 places, 38 transitions, 215 flow. Second operand 4 states and 538 transitions. [2020-10-16 04:46:46,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 48 transitions, 331 flow [2020-10-16 04:46:46,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 48 transitions, 331 flow, removed 0 selfloop flow, removed 0 redundant places. [2020-10-16 04:46:46,757 INFO L241 Difference]: Finished difference. Result has 47 places, 44 transitions, 297 flow [2020-10-16 04:46:46,757 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=297, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2020-10-16 04:46:46,758 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 13 predicate places. [2020-10-16 04:46:46,758 INFO L481 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 297 flow [2020-10-16 04:46:46,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:46:46,758 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:46:46,759 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:46:46,759 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 04:46:46,759 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:46:46,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:46:46,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1855088386, now seen corresponding path program 1 times [2020-10-16 04:46:46,760 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:46:46,760 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171329616] [2020-10-16 04:46:46,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:46:46,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:46:46,821 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:46:46,821 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171329616] [2020-10-16 04:46:46,821 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:46:46,822 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:46:46,822 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719961655] [2020-10-16 04:46:46,823 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:46:46,823 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:46:46,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:46:46,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:46:46,824 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 172 [2020-10-16 04:46:46,826 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 297 flow. Second operand 5 states. [2020-10-16 04:46:46,826 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:46:46,826 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 172 [2020-10-16 04:46:46,826 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:46:46,995 INFO L129 PetriNetUnfolder]: 233/492 cut-off events. [2020-10-16 04:46:46,995 INFO L130 PetriNetUnfolder]: For 1249/1292 co-relation queries the response was YES. [2020-10-16 04:46:46,998 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1697 conditions, 492 events. 233/492 cut-off events. For 1249/1292 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2783 event pairs, 28 based on Foata normal form. 31/518 useless extension candidates. Maximal degree in co-relation 1675. Up to 201 conditions per place. [2020-10-16 04:46:47,002 INFO L132 encePairwiseOnDemand]: 167/172 looper letters, 26 selfloop transitions, 14 changer transitions 0/55 dead transitions. [2020-10-16 04:46:47,002 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 55 transitions, 440 flow [2020-10-16 04:46:47,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:46:47,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:46:47,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 673 transitions. [2020-10-16 04:46:47,006 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7825581395348837 [2020-10-16 04:46:47,006 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 673 transitions. [2020-10-16 04:46:47,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 673 transitions. [2020-10-16 04:46:47,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:46:47,007 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 673 transitions. [2020-10-16 04:46:47,008 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:46:47,010 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:46:47,010 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:46:47,010 INFO L185 Difference]: Start difference. First operand has 47 places, 44 transitions, 297 flow. Second operand 5 states and 673 transitions. [2020-10-16 04:46:47,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 55 transitions, 440 flow [2020-10-16 04:46:47,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 55 transitions, 421 flow, removed 4 selfloop flow, removed 1 redundant places. [2020-10-16 04:46:47,017 INFO L241 Difference]: Finished difference. Result has 51 places, 44 transitions, 311 flow [2020-10-16 04:46:47,017 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=311, PETRI_PLACES=51, PETRI_TRANSITIONS=44} [2020-10-16 04:46:47,018 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 17 predicate places. [2020-10-16 04:46:47,018 INFO L481 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 311 flow [2020-10-16 04:46:47,018 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:46:47,018 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:46:47,018 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:46:47,018 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 04:46:47,018 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:46:47,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:46:47,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1393100032, now seen corresponding path program 2 times [2020-10-16 04:46:47,019 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:46:47,020 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631705343] [2020-10-16 04:46:47,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:46:47,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:46:47,108 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:46:47,109 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631705343] [2020-10-16 04:46:47,109 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:46:47,109 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:46:47,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645506848] [2020-10-16 04:46:47,110 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:46:47,110 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:46:47,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:46:47,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:46:47,111 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 172 [2020-10-16 04:46:47,112 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 311 flow. Second operand 5 states. [2020-10-16 04:46:47,112 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:46:47,112 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 172 [2020-10-16 04:46:47,112 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:46:47,229 INFO L129 PetriNetUnfolder]: 138/316 cut-off events. [2020-10-16 04:46:47,229 INFO L130 PetriNetUnfolder]: For 1547/1707 co-relation queries the response was YES. [2020-10-16 04:46:47,231 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1194 conditions, 316 events. 138/316 cut-off events. For 1547/1707 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1643 event pairs, 43 based on Foata normal form. 25/320 useless extension candidates. Maximal degree in co-relation 1170. Up to 199 conditions per place. [2020-10-16 04:46:47,233 INFO L132 encePairwiseOnDemand]: 165/172 looper letters, 13 selfloop transitions, 16 changer transitions 0/47 dead transitions. [2020-10-16 04:46:47,234 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 47 transitions, 383 flow [2020-10-16 04:46:47,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 04:46:47,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 04:46:47,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 537 transitions. [2020-10-16 04:46:47,237 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7805232558139535 [2020-10-16 04:46:47,237 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 537 transitions. [2020-10-16 04:46:47,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 537 transitions. [2020-10-16 04:46:47,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:46:47,238 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 537 transitions. [2020-10-16 04:46:47,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 04:46:47,240 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 04:46:47,240 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 04:46:47,240 INFO L185 Difference]: Start difference. First operand has 51 places, 44 transitions, 311 flow. Second operand 4 states and 537 transitions. [2020-10-16 04:46:47,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 47 transitions, 383 flow [2020-10-16 04:46:47,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 47 transitions, 354 flow, removed 2 selfloop flow, removed 3 redundant places. [2020-10-16 04:46:47,245 INFO L241 Difference]: Finished difference. Result has 52 places, 44 transitions, 329 flow [2020-10-16 04:46:47,245 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=329, PETRI_PLACES=52, PETRI_TRANSITIONS=44} [2020-10-16 04:46:47,246 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 18 predicate places. [2020-10-16 04:46:47,246 INFO L481 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 329 flow [2020-10-16 04:46:47,246 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:46:47,246 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:46:47,246 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:46:47,246 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 04:46:47,247 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:46:47,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:46:47,247 INFO L82 PathProgramCache]: Analyzing trace with hash 687083353, now seen corresponding path program 1 times [2020-10-16 04:46:47,247 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:46:47,247 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900321291] [2020-10-16 04:46:47,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:46:47,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:46:47,302 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:46:47,302 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900321291] [2020-10-16 04:46:47,303 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:46:47,303 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:46:47,303 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160801484] [2020-10-16 04:46:47,303 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:46:47,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:46:47,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:46:47,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:46:47,305 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 172 [2020-10-16 04:46:47,306 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 329 flow. Second operand 5 states. [2020-10-16 04:46:47,306 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:46:47,306 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 172 [2020-10-16 04:46:47,306 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:46:47,469 INFO L129 PetriNetUnfolder]: 164/390 cut-off events. [2020-10-16 04:46:47,469 INFO L130 PetriNetUnfolder]: For 1762/1904 co-relation queries the response was YES. [2020-10-16 04:46:47,471 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1459 conditions, 390 events. 164/390 cut-off events. For 1762/1904 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2252 event pairs, 36 based on Foata normal form. 31/410 useless extension candidates. Maximal degree in co-relation 1434. Up to 231 conditions per place. [2020-10-16 04:46:47,474 INFO L132 encePairwiseOnDemand]: 164/172 looper letters, 16 selfloop transitions, 19 changer transitions 0/53 dead transitions. [2020-10-16 04:46:47,474 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 53 transitions, 455 flow [2020-10-16 04:46:47,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:46:47,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:46:47,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 669 transitions. [2020-10-16 04:46:47,478 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7779069767441861 [2020-10-16 04:46:47,478 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 669 transitions. [2020-10-16 04:46:47,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 669 transitions. [2020-10-16 04:46:47,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:46:47,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 669 transitions. [2020-10-16 04:46:47,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:46:47,482 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:46:47,483 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:46:47,483 INFO L185 Difference]: Start difference. First operand has 52 places, 44 transitions, 329 flow. Second operand 5 states and 669 transitions. [2020-10-16 04:46:47,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 53 transitions, 455 flow [2020-10-16 04:46:47,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 53 transitions, 411 flow, removed 6 selfloop flow, removed 3 redundant places. [2020-10-16 04:46:47,488 INFO L241 Difference]: Finished difference. Result has 55 places, 52 transitions, 408 flow [2020-10-16 04:46:47,489 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=408, PETRI_PLACES=55, PETRI_TRANSITIONS=52} [2020-10-16 04:46:47,489 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 21 predicate places. [2020-10-16 04:46:47,489 INFO L481 AbstractCegarLoop]: Abstraction has has 55 places, 52 transitions, 408 flow [2020-10-16 04:46:47,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:46:47,489 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:46:47,489 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:46:47,490 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 04:46:47,490 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:46:47,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:46:47,490 INFO L82 PathProgramCache]: Analyzing trace with hash 179657739, now seen corresponding path program 2 times [2020-10-16 04:46:47,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:46:47,490 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571152206] [2020-10-16 04:46:47,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:46:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:46:47,595 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:46:47,595 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571152206] [2020-10-16 04:46:47,595 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:46:47,595 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:46:47,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830237404] [2020-10-16 04:46:47,596 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:46:47,596 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:46:47,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:46:47,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:46:47,598 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 172 [2020-10-16 04:46:47,598 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 52 transitions, 408 flow. Second operand 5 states. [2020-10-16 04:46:47,598 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:46:47,598 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 172 [2020-10-16 04:46:47,599 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:46:47,752 INFO L129 PetriNetUnfolder]: 156/384 cut-off events. [2020-10-16 04:46:47,752 INFO L130 PetriNetUnfolder]: For 2164/2402 co-relation queries the response was YES. [2020-10-16 04:46:47,755 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1628 conditions, 384 events. 156/384 cut-off events. For 2164/2402 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2282 event pairs, 37 based on Foata normal form. 69/441 useless extension candidates. Maximal degree in co-relation 1601. Up to 214 conditions per place. [2020-10-16 04:46:47,758 INFO L132 encePairwiseOnDemand]: 166/172 looper letters, 24 selfloop transitions, 16 changer transitions 0/58 dead transitions. [2020-10-16 04:46:47,758 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 58 transitions, 523 flow [2020-10-16 04:46:47,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 04:46:47,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 04:46:47,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 534 transitions. [2020-10-16 04:46:47,762 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7761627906976745 [2020-10-16 04:46:47,762 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 534 transitions. [2020-10-16 04:46:47,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 534 transitions. [2020-10-16 04:46:47,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:46:47,763 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 534 transitions. [2020-10-16 04:46:47,764 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 04:46:47,765 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 04:46:47,766 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 04:46:47,766 INFO L185 Difference]: Start difference. First operand has 55 places, 52 transitions, 408 flow. Second operand 4 states and 534 transitions. [2020-10-16 04:46:47,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 58 transitions, 523 flow [2020-10-16 04:46:47,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 58 transitions, 514 flow, removed 4 selfloop flow, removed 1 redundant places. [2020-10-16 04:46:47,773 INFO L241 Difference]: Finished difference. Result has 58 places, 54 transitions, 453 flow [2020-10-16 04:46:47,773 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=453, PETRI_PLACES=58, PETRI_TRANSITIONS=54} [2020-10-16 04:46:47,773 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 24 predicate places. [2020-10-16 04:46:47,773 INFO L481 AbstractCegarLoop]: Abstraction has has 58 places, 54 transitions, 453 flow [2020-10-16 04:46:47,773 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:46:47,774 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:46:47,774 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:46:47,774 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 04:46:47,774 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:46:47,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:46:47,774 INFO L82 PathProgramCache]: Analyzing trace with hash 137016712, now seen corresponding path program 2 times [2020-10-16 04:46:47,775 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:46:47,775 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510558036] [2020-10-16 04:46:47,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:46:47,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:46:47,825 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:46:47,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510558036] [2020-10-16 04:46:47,825 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:46:47,825 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:46:47,826 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208128819] [2020-10-16 04:46:47,826 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:46:47,826 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:46:47,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:46:47,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:46:47,827 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 172 [2020-10-16 04:46:47,828 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 54 transitions, 453 flow. Second operand 4 states. [2020-10-16 04:46:47,828 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:46:47,828 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 172 [2020-10-16 04:46:47,828 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:46:47,957 INFO L129 PetriNetUnfolder]: 237/549 cut-off events. [2020-10-16 04:46:47,958 INFO L130 PetriNetUnfolder]: For 2655/2852 co-relation queries the response was YES. [2020-10-16 04:46:47,962 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2130 conditions, 549 events. 237/549 cut-off events. For 2655/2852 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3456 event pairs, 72 based on Foata normal form. 113/636 useless extension candidates. Maximal degree in co-relation 2101. Up to 235 conditions per place. [2020-10-16 04:46:47,966 INFO L132 encePairwiseOnDemand]: 166/172 looper letters, 10 selfloop transitions, 8 changer transitions 0/64 dead transitions. [2020-10-16 04:46:47,966 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 64 transitions, 509 flow [2020-10-16 04:46:47,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:46:47,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:46:47,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 708 transitions. [2020-10-16 04:46:47,969 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8232558139534883 [2020-10-16 04:46:47,969 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 708 transitions. [2020-10-16 04:46:47,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 708 transitions. [2020-10-16 04:46:47,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:46:47,970 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 708 transitions. [2020-10-16 04:46:47,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:46:47,973 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:46:47,973 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:46:47,973 INFO L185 Difference]: Start difference. First operand has 58 places, 54 transitions, 453 flow. Second operand 5 states and 708 transitions. [2020-10-16 04:46:47,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 64 transitions, 509 flow [2020-10-16 04:46:47,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 64 transitions, 480 flow, removed 3 selfloop flow, removed 3 redundant places. [2020-10-16 04:46:47,981 INFO L241 Difference]: Finished difference. Result has 62 places, 61 transitions, 492 flow [2020-10-16 04:46:47,982 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=492, PETRI_PLACES=62, PETRI_TRANSITIONS=61} [2020-10-16 04:46:47,982 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 28 predicate places. [2020-10-16 04:46:47,982 INFO L481 AbstractCegarLoop]: Abstraction has has 62 places, 61 transitions, 492 flow [2020-10-16 04:46:47,982 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:46:47,982 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:46:47,982 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:46:47,982 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 04:46:47,983 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:46:47,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:46:47,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1782310297, now seen corresponding path program 1 times [2020-10-16 04:46:47,983 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:46:47,983 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356332779] [2020-10-16 04:46:47,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:46:48,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:46:48,070 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:46:48,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356332779] [2020-10-16 04:46:48,071 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:46:48,071 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:46:48,071 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997852700] [2020-10-16 04:46:48,072 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:46:48,072 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:46:48,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:46:48,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:46:48,073 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 172 [2020-10-16 04:46:48,074 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 61 transitions, 492 flow. Second operand 5 states. [2020-10-16 04:46:48,074 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:46:48,074 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 172 [2020-10-16 04:46:48,074 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:46:48,204 INFO L129 PetriNetUnfolder]: 116/347 cut-off events. [2020-10-16 04:46:48,204 INFO L130 PetriNetUnfolder]: For 1514/2039 co-relation queries the response was YES. [2020-10-16 04:46:48,208 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1468 conditions, 347 events. 116/347 cut-off events. For 1514/2039 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2155 event pairs, 10 based on Foata normal form. 244/574 useless extension candidates. Maximal degree in co-relation 1437. Up to 171 conditions per place. [2020-10-16 04:46:48,210 INFO L132 encePairwiseOnDemand]: 166/172 looper letters, 6 selfloop transitions, 15 changer transitions 3/68 dead transitions. [2020-10-16 04:46:48,210 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 68 transitions, 571 flow [2020-10-16 04:46:48,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:46:48,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:46:48,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 991 transitions. [2020-10-16 04:46:48,214 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8230897009966778 [2020-10-16 04:46:48,214 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 991 transitions. [2020-10-16 04:46:48,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 991 transitions. [2020-10-16 04:46:48,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:46:48,216 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 991 transitions. [2020-10-16 04:46:48,218 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:46:48,220 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:46:48,220 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:46:48,220 INFO L185 Difference]: Start difference. First operand has 62 places, 61 transitions, 492 flow. Second operand 7 states and 991 transitions. [2020-10-16 04:46:48,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 68 transitions, 571 flow [2020-10-16 04:46:48,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 68 transitions, 563 flow, removed 2 selfloop flow, removed 1 redundant places. [2020-10-16 04:46:48,228 INFO L241 Difference]: Finished difference. Result has 70 places, 65 transitions, 560 flow [2020-10-16 04:46:48,229 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=560, PETRI_PLACES=70, PETRI_TRANSITIONS=65} [2020-10-16 04:46:48,229 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 36 predicate places. [2020-10-16 04:46:48,229 INFO L481 AbstractCegarLoop]: Abstraction has has 70 places, 65 transitions, 560 flow [2020-10-16 04:46:48,229 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:46:48,229 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:46:48,229 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:46:48,229 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 04:46:48,230 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:46:48,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:46:48,230 INFO L82 PathProgramCache]: Analyzing trace with hash 362763212, now seen corresponding path program 1 times [2020-10-16 04:46:48,230 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:46:48,231 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687162590] [2020-10-16 04:46:48,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:46:48,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:46:48,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:46:48,359 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687162590] [2020-10-16 04:46:48,359 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:46:48,359 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:46:48,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535260218] [2020-10-16 04:46:48,360 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 04:46:48,360 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:46:48,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 04:46:48,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 04:46:48,361 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 172 [2020-10-16 04:46:48,362 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 65 transitions, 560 flow. Second operand 6 states. [2020-10-16 04:46:48,362 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:46:48,362 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 172 [2020-10-16 04:46:48,362 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:46:48,495 INFO L129 PetriNetUnfolder]: 88/288 cut-off events. [2020-10-16 04:46:48,495 INFO L130 PetriNetUnfolder]: For 1847/2506 co-relation queries the response was YES. [2020-10-16 04:46:48,498 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1397 conditions, 288 events. 88/288 cut-off events. For 1847/2506 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1767 event pairs, 2 based on Foata normal form. 231/503 useless extension candidates. Maximal degree in co-relation 1362. Up to 151 conditions per place. [2020-10-16 04:46:48,499 INFO L132 encePairwiseOnDemand]: 166/172 looper letters, 2 selfloop transitions, 19 changer transitions 9/67 dead transitions. [2020-10-16 04:46:48,499 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 67 transitions, 615 flow [2020-10-16 04:46:48,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 04:46:48,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 04:46:48,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1268 transitions. [2020-10-16 04:46:48,504 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8191214470284238 [2020-10-16 04:46:48,505 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1268 transitions. [2020-10-16 04:46:48,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1268 transitions. [2020-10-16 04:46:48,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:46:48,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1268 transitions. [2020-10-16 04:46:48,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 04:46:48,512 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 04:46:48,512 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 04:46:48,512 INFO L185 Difference]: Start difference. First operand has 70 places, 65 transitions, 560 flow. Second operand 9 states and 1268 transitions. [2020-10-16 04:46:48,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 67 transitions, 615 flow [2020-10-16 04:46:48,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 67 transitions, 535 flow, removed 22 selfloop flow, removed 5 redundant places. [2020-10-16 04:46:48,520 INFO L241 Difference]: Finished difference. Result has 76 places, 58 transitions, 464 flow [2020-10-16 04:46:48,521 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=464, PETRI_PLACES=76, PETRI_TRANSITIONS=58} [2020-10-16 04:46:48,521 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 42 predicate places. [2020-10-16 04:46:48,521 INFO L481 AbstractCegarLoop]: Abstraction has has 76 places, 58 transitions, 464 flow [2020-10-16 04:46:48,521 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 04:46:48,521 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:46:48,521 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:46:48,521 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 04:46:48,522 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:46:48,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:46:48,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1342527438, now seen corresponding path program 1 times [2020-10-16 04:46:48,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:46:48,523 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813367782] [2020-10-16 04:46:48,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:46:48,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:46:48,611 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:46:48,611 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813367782] [2020-10-16 04:46:48,611 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:46:48,612 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:46:48,612 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895564629] [2020-10-16 04:46:48,612 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:46:48,612 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:46:48,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:46:48,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:46:48,614 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 172 [2020-10-16 04:46:48,615 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 58 transitions, 464 flow. Second operand 7 states. [2020-10-16 04:46:48,615 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:46:48,615 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 172 [2020-10-16 04:46:48,615 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:46:48,889 INFO L129 PetriNetUnfolder]: 187/579 cut-off events. [2020-10-16 04:46:48,889 INFO L130 PetriNetUnfolder]: For 3666/3978 co-relation queries the response was YES. [2020-10-16 04:46:48,893 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2556 conditions, 579 events. 187/579 cut-off events. For 3666/3978 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4243 event pairs, 4 based on Foata normal form. 86/634 useless extension candidates. Maximal degree in co-relation 2519. Up to 135 conditions per place. [2020-10-16 04:46:48,895 INFO L132 encePairwiseOnDemand]: 165/172 looper letters, 17 selfloop transitions, 3 changer transitions 43/90 dead transitions. [2020-10-16 04:46:48,895 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 90 transitions, 834 flow [2020-10-16 04:46:48,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 04:46:48,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 04:46:48,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1113 transitions. [2020-10-16 04:46:48,900 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7189922480620154 [2020-10-16 04:46:48,900 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1113 transitions. [2020-10-16 04:46:48,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1113 transitions. [2020-10-16 04:46:48,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:46:48,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1113 transitions. [2020-10-16 04:46:48,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 04:46:48,909 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 04:46:48,910 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 04:46:48,910 INFO L185 Difference]: Start difference. First operand has 76 places, 58 transitions, 464 flow. Second operand 9 states and 1113 transitions. [2020-10-16 04:46:48,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 90 transitions, 834 flow [2020-10-16 04:46:48,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 90 transitions, 706 flow, removed 27 selfloop flow, removed 11 redundant places. [2020-10-16 04:46:48,926 INFO L241 Difference]: Finished difference. Result has 77 places, 43 transitions, 282 flow [2020-10-16 04:46:48,928 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=282, PETRI_PLACES=77, PETRI_TRANSITIONS=43} [2020-10-16 04:46:48,928 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 43 predicate places. [2020-10-16 04:46:48,928 INFO L481 AbstractCegarLoop]: Abstraction has has 77 places, 43 transitions, 282 flow [2020-10-16 04:46:48,928 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:46:48,928 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:46:48,929 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:46:48,929 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 04:46:48,929 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:46:48,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:46:48,929 INFO L82 PathProgramCache]: Analyzing trace with hash 2130247804, now seen corresponding path program 2 times [2020-10-16 04:46:48,929 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:46:48,930 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057445247] [2020-10-16 04:46:48,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:46:49,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 04:46:49,017 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 04:46:49,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 04:46:49,096 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 04:46:49,178 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 04:46:49,178 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 04:46:49,180 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-16 04:46:49,212 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:46:49,213 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:49,221 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:46:49,222 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:49,222 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:46:49,222 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:49,223 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:46:49,223 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:49,224 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:46:49,224 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:49,224 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:46:49,225 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:49,225 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:46:49,225 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:49,226 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:46:49,226 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:49,226 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:46:49,226 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:49,227 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:46:49,227 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:49,228 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:46:49,228 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:49,228 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:46:49,228 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:49,229 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:46:49,229 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:49,230 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:46:49,230 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:49,230 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:46:49,230 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:49,231 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:46:49,231 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:49,231 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:46:49,231 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:49,232 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:46:49,233 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:49,233 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:46:49,233 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:49,238 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:46:49,238 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:49,238 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:46:49,238 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:49,239 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:46:49,239 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:49,239 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:46:49,239 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:49,239 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:46:49,240 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:49,240 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:46:49,240 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:49,240 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:46:49,240 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:49,240 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:46:49,240 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:49,241 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:46:49,241 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:49,241 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:46:49,241 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:49,241 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:46:49,241 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:49,242 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:46:49,242 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:49,242 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:46:49,242 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:49,243 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:46:49,243 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:49,243 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:46:49,243 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:49,243 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:46:49,244 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:49,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 04:46:49 BasicIcfg [2020-10-16 04:46:49,365 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 04:46:49,367 INFO L168 Benchmark]: Toolchain (without parser) took 17216.21 ms. Allocated memory was 253.8 MB in the beginning and 550.0 MB in the end (delta: 296.2 MB). Free memory was 209.1 MB in the beginning and 463.6 MB in the end (delta: -254.5 MB). Peak memory consumption was 41.7 MB. Max. memory is 14.2 GB. [2020-10-16 04:46:49,367 INFO L168 Benchmark]: CDTParser took 0.39 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:46:49,368 INFO L168 Benchmark]: CACSL2BoogieTranslator took 796.10 ms. Allocated memory was 253.8 MB in the beginning and 324.5 MB in the end (delta: 70.8 MB). Free memory was 209.1 MB in the beginning and 275.0 MB in the end (delta: -65.9 MB). Peak memory consumption was 29.6 MB. Max. memory is 14.2 GB. [2020-10-16 04:46:49,369 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.05 ms. Allocated memory is still 324.5 MB. Free memory was 275.0 MB in the beginning and 270.0 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. [2020-10-16 04:46:49,370 INFO L168 Benchmark]: Boogie Preprocessor took 39.08 ms. Allocated memory is still 324.5 MB. Free memory was 270.0 MB in the beginning and 267.4 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:46:49,371 INFO L168 Benchmark]: RCFGBuilder took 2248.98 ms. Allocated memory was 324.5 MB in the beginning and 360.7 MB in the end (delta: 36.2 MB). Free memory was 267.4 MB in the beginning and 189.7 MB in the end (delta: 77.8 MB). Peak memory consumption was 113.9 MB. Max. memory is 14.2 GB. [2020-10-16 04:46:49,371 INFO L168 Benchmark]: TraceAbstraction took 14055.17 ms. Allocated memory was 360.7 MB in the beginning and 550.0 MB in the end (delta: 189.3 MB). Free memory was 189.7 MB in the beginning and 463.6 MB in the end (delta: -273.9 MB). There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 04:46:49,374 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.39 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 796.10 ms. Allocated memory was 253.8 MB in the beginning and 324.5 MB in the end (delta: 70.8 MB). Free memory was 209.1 MB in the beginning and 275.0 MB in the end (delta: -65.9 MB). Peak memory consumption was 29.6 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 71.05 ms. Allocated memory is still 324.5 MB. Free memory was 275.0 MB in the beginning and 270.0 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 39.08 ms. Allocated memory is still 324.5 MB. Free memory was 270.0 MB in the beginning and 267.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2248.98 ms. Allocated memory was 324.5 MB in the beginning and 360.7 MB in the end (delta: 36.2 MB). Free memory was 267.4 MB in the beginning and 189.7 MB in the end (delta: 77.8 MB). Peak memory consumption was 113.9 MB. Max. memory is 14.2 GB. * TraceAbstraction took 14055.17 ms. Allocated memory was 360.7 MB in the beginning and 550.0 MB in the end (delta: 189.3 MB). Free memory was 189.7 MB in the beginning and 463.6 MB in the end (delta: -273.9 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 1149 VarBasedMoverChecksPositive, 74 VarBasedMoverChecksNegative, 18 SemBasedMoverChecksPositive, 56 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 145 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 9.2s, 99 PlacesBefore, 34 PlacesAfterwards, 91 TransitionsBefore, 25 TransitionsAfterwards, 1724 CoEnabledTransitionPairs, 6 FixpointIterations, 32 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 78 TotalNumberOfCompositions, 4822 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p2_EAX = 0; [L702] 0 int __unbuffered_p2_EBX = 0; [L703] 0 _Bool main$tmp_guard0; [L704] 0 _Bool main$tmp_guard1; [L706] 0 int x = 0; [L707] 0 _Bool x$flush_delayed; [L708] 0 int x$mem_tmp; [L709] 0 _Bool x$r_buff0_thd0; [L710] 0 _Bool x$r_buff0_thd1; [L711] 0 _Bool x$r_buff0_thd2; [L712] 0 _Bool x$r_buff0_thd3; [L713] 0 _Bool x$r_buff1_thd0; [L714] 0 _Bool x$r_buff1_thd1; [L715] 0 _Bool x$r_buff1_thd2; [L716] 0 _Bool x$r_buff1_thd3; [L717] 0 _Bool x$read_delayed; [L718] 0 int *x$read_delayed_var; [L719] 0 int x$w_buff0; [L720] 0 _Bool x$w_buff0_used; [L721] 0 int x$w_buff1; [L722] 0 _Bool x$w_buff1_used; [L724] 0 int y = 0; [L726] 0 int z = 0; [L727] 0 _Bool weak$$choice0; [L728] 0 _Bool weak$$choice2; [L812] 0 pthread_t t748; [L813] FCALL, FORK 0 pthread_create(&t748, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L814] 0 pthread_t t749; [L815] FCALL, FORK 0 pthread_create(&t749, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L752] 2 x$w_buff1 = x$w_buff0 [L753] 2 x$w_buff0 = 2 [L754] 2 x$w_buff1_used = x$w_buff0_used [L755] 2 x$w_buff0_used = (_Bool)1 [L7] COND TRUE 2 !expression [L7] 2 __VERIFIER_error() [L757] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L758] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L759] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L760] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L761] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L816] 0 pthread_t t750; [L817] FCALL, FORK 0 pthread_create(&t750, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L764] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L781] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L784] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L787] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L732] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L735] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L767] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L768] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L769] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L770] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L771] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L738] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L738] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L738] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L738] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L739] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L739] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L740] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L741] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L741] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L742] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L745] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L747] 1 return 0; [L774] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L776] 2 return 0; [L790] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L790] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L791] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L791] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L792] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L792] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L793] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L793] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L794] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L794] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L797] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 3 return 0; [L819] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L823] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L823] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L823] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L823] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L824] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L824] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L825] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L825] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L826] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L826] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L827] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L827] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L830] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L831] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L832] 0 x$flush_delayed = weak$$choice2 [L833] 0 x$mem_tmp = x [L834] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L834] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1 [L834] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L834] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L835] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L835] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L836] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L836] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L836] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L836] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L837] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L837] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L838] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L839] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L840] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L840] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L840] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L840] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L842] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L842] 0 x = x$flush_delayed ? x$mem_tmp : x [L843] 0 x$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 93 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: 13.7s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.3s, HoareTripleCheckerStatistics: 83 SDtfs, 66 SDslu, 31 SDs, 0 SdLazy, 339 SolverSat, 101 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=560occurred 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.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 227 NumberOfCodeBlocks, 227 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 189 ConstructedInterpolants, 0 QuantifiedInterpolants, 14830 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...