/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/mix054_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 04:54:47,746 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 04:54:47,749 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 04:54:47,777 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 04:54:47,777 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 04:54:47,785 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 04:54:47,787 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 04:54:47,790 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 04:54:47,792 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 04:54:47,793 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 04:54:47,795 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 04:54:47,796 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 04:54:47,796 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 04:54:47,799 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 04:54:47,801 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 04:54:47,802 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 04:54:47,804 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 04:54:47,807 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 04:54:47,808 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 04:54:47,814 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 04:54:47,818 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 04:54:47,818 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 04:54:47,820 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 04:54:47,821 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 04:54:47,831 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 04:54:47,831 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 04:54:47,832 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 04:54:47,836 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 04:54:47,836 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 04:54:47,838 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 04:54:47,839 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 04:54:47,840 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 04:54:47,840 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 04:54:47,841 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 04:54:47,842 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 04:54:47,842 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 04:54:47,843 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 04:54:47,843 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 04:54:47,843 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 04:54:47,844 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 04:54:47,845 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 04:54:47,846 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:54:47,888 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 04:54:47,888 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 04:54:47,890 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 04:54:47,890 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 04:54:47,890 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 04:54:47,891 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 04:54:47,891 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 04:54:47,891 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 04:54:47,891 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 04:54:47,891 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 04:54:47,892 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 04:54:47,893 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 04:54:47,893 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 04:54:47,894 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 04:54:47,894 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 04:54:47,894 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 04:54:47,894 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 04:54:47,894 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 04:54:47,895 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 04:54:47,895 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 04:54:47,895 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 04:54:47,895 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 04:54:47,895 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 04:54:47,896 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 04:54:47,896 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 04:54:47,896 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 04:54:47,896 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 04:54:47,896 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 04:54:47,896 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 04:54:48,185 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 04:54:48,197 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 04:54:48,201 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 04:54:48,202 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 04:54:48,202 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 04:54:48,203 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_pso.opt.i [2020-10-16 04:54:48,293 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07aa63119/73a194b96c9047268746b1de425947f4/FLAGcb9456ecc [2020-10-16 04:54:48,843 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 04:54:48,844 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_pso.opt.i [2020-10-16 04:54:48,860 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07aa63119/73a194b96c9047268746b1de425947f4/FLAGcb9456ecc [2020-10-16 04:54:49,118 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07aa63119/73a194b96c9047268746b1de425947f4 [2020-10-16 04:54:49,127 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 04:54:49,128 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 04:54:49,129 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 04:54:49,129 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 04:54:49,133 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 04:54:49,134 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:54:49" (1/1) ... [2020-10-16 04:54:49,137 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c8589d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:54:49, skipping insertion in model container [2020-10-16 04:54:49,137 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:54:49" (1/1) ... [2020-10-16 04:54:49,145 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 04:54:49,215 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 04:54:49,757 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:54:49,768 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 04:54:49,827 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:54:49,899 INFO L208 MainTranslator]: Completed translation [2020-10-16 04:54:49,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:54:49 WrapperNode [2020-10-16 04:54:49,900 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 04:54:49,901 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 04:54:49,901 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 04:54:49,901 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 04:54:49,910 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:54:49" (1/1) ... [2020-10-16 04:54:49,928 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:54:49" (1/1) ... [2020-10-16 04:54:49,979 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 04:54:49,979 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 04:54:49,979 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 04:54:49,979 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 04:54:49,988 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:54:49" (1/1) ... [2020-10-16 04:54:49,989 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:54:49" (1/1) ... [2020-10-16 04:54:49,993 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:54:49" (1/1) ... [2020-10-16 04:54:49,993 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:54:49" (1/1) ... [2020-10-16 04:54:50,002 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:54:49" (1/1) ... [2020-10-16 04:54:50,006 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:54:49" (1/1) ... [2020-10-16 04:54:50,009 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:54:49" (1/1) ... [2020-10-16 04:54:50,014 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 04:54:50,014 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 04:54:50,014 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 04:54:50,014 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 04:54:50,015 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:54:49" (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:54:50,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 04:54:50,077 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 04:54:50,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 04:54:50,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 04:54:50,077 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 04:54:50,078 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 04:54:50,078 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 04:54:50,078 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 04:54:50,078 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 04:54:50,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 04:54:50,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 04:54:50,080 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:54:51,880 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 04:54:51,881 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 04:54:51,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:54:51 BoogieIcfgContainer [2020-10-16 04:54:51,883 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 04:54:51,884 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 04:54:51,884 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 04:54:51,888 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 04:54:51,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 04:54:49" (1/3) ... [2020-10-16 04:54:51,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65aa6e7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:54:51, skipping insertion in model container [2020-10-16 04:54:51,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:54:49" (2/3) ... [2020-10-16 04:54:51,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65aa6e7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:54:51, skipping insertion in model container [2020-10-16 04:54:51,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:54:51" (3/3) ... [2020-10-16 04:54:51,892 INFO L111 eAbstractionObserver]: Analyzing ICFG mix054_pso.opt.i [2020-10-16 04:54:51,903 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 04:54:51,911 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 04:54:51,912 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 04:54:51,939 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:54:51,940 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:54:51,940 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:54:51,940 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:54:51,941 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:54:51,941 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:54:51,941 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:54:51,941 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:54:51,941 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:54:51,942 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:54:51,942 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:54:51,942 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:54:51,943 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:54:51,943 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:54:51,943 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:54:51,944 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:54:51,944 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:54:51,944 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:54:51,944 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:54:51,944 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:54:51,945 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:54:51,945 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:54:51,945 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:54:51,945 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:54:51,946 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:54:51,946 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:54:51,946 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:54:51,946 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:54:51,947 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:54:51,947 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:54:51,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:54:51,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:54:51,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:54:51,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:54:51,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:54:51,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:54:51,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:54:51,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:54:51,953 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:54:51,953 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:54:51,957 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:54:51,957 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:54:51,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:54:51,957 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:54:51,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:54:51,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:54:51,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:54:51,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:54:51,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:54:51,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:54:51,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:54:51,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:54:51,978 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-16 04:54:52,000 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 04:54:52,000 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 04:54:52,000 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 04:54:52,000 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 04:54:52,000 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 04:54:52,001 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 04:54:52,001 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 04:54:52,001 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 04:54:52,015 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 80 places, 75 transitions, 160 flow [2020-10-16 04:54:52,053 INFO L129 PetriNetUnfolder]: 2/73 cut-off events. [2020-10-16 04:54:52,054 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:54:52,058 INFO L80 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 73 events. 2/73 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 48 event pairs, 0 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2020-10-16 04:54:52,059 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 75 transitions, 160 flow [2020-10-16 04:54:52,065 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 73 transitions, 152 flow [2020-10-16 04:54:52,067 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 04:54:52,070 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 73 transitions, 152 flow [2020-10-16 04:54:52,072 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 73 transitions, 152 flow [2020-10-16 04:54:52,073 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 78 places, 73 transitions, 152 flow [2020-10-16 04:54:52,096 INFO L129 PetriNetUnfolder]: 2/73 cut-off events. [2020-10-16 04:54:52,096 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:54:52,097 INFO L80 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 73 events. 2/73 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 49 event pairs, 0 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2020-10-16 04:54:52,099 INFO L117 LiptonReduction]: Number of co-enabled transitions 888 [2020-10-16 04:54:52,157 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:54:52,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:54:52,160 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:54:52,161 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:54:52,165 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:54:52,166 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:54:52,170 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:54:52,170 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:54:52,201 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:54:52,201 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:54:52,203 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:54:52,204 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:54:52,207 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:54:52,208 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:54:52,211 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:54:52,212 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:54:52,481 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2020-10-16 04:54:52,651 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:54:52,652 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:54:52,653 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:54:52,654 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:54:52,657 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:54:52,658 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:54:52,661 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:54:52,661 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:54:52,683 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:54:52,684 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:54:52,685 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:54:52,685 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:54:52,688 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:54:52,689 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:54:52,691 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:54:52,692 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:54:52,762 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:54:52,762 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:54:52,763 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:54:52,764 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:54:52,767 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:54:52,767 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:54:52,770 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:54:52,771 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:54:52,789 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:54:52,789 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:54:52,791 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:54:52,791 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:54:52,794 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:54:52,794 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:54:52,796 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:54:52,797 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:54:52,860 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:54:52,861 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:54:52,862 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 04:54:52,863 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:54:52,877 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:54:52,877 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:54:52,879 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:54:52,879 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:54:52,880 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:54:52,881 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:54:52,908 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 2, 1] term [2020-10-16 04:54:52,909 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:54:52,910 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 04:54:52,911 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:54:54,129 WARN L193 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 224 DAG size of output: 184 [2020-10-16 04:54:54,149 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-16 04:54:54,150 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:54:54,153 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 04:54:54,154 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:54:54,867 WARN L193 SmtUtils]: Spent 700.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 119 [2020-10-16 04:54:54,909 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:54:54,910 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:54:54,910 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:54:54,911 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:54:54,914 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:54:54,914 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:54:54,916 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:54:54,917 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:54:54,932 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:54:54,933 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:54:54,934 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:54:54,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:54:54,936 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:54:54,937 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:54:54,939 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:54:54,940 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:54:55,000 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:54:55,001 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:54:55,005 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:54:55,005 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:54:55,024 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 04:54:55,025 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:54:55,026 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:54:55,026 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:54:55,027 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:54:55,027 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:54:55,028 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:54:55,029 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:54:55,031 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:54:55,031 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:54:55,032 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:54:55,033 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:54:55,035 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:54:55,035 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:54:55,037 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:54:55,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:54:55,039 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:54:55,040 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:54:55,278 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 04:54:55,279 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:54:55,280 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:54:55,280 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:54:55,281 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:54:55,281 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:54:55,282 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:54:55,283 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:54:55,285 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:54:55,285 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:54:55,287 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:54:55,287 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:54:55,290 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:54:55,290 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:54:55,292 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:54:55,292 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:54:55,294 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:54:55,295 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:54:55,315 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:54:55,315 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:54:55,317 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:54:55,318 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:54:55,747 WARN L193 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2020-10-16 04:54:55,862 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-16 04:54:56,689 WARN L193 SmtUtils]: Spent 675.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 118 [2020-10-16 04:54:57,029 WARN L193 SmtUtils]: Spent 336.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-10-16 04:54:57,127 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:54:57,127 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:54:57,128 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:54:57,128 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:54:57,130 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:54:57,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:54:57,134 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:54:57,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:54:57,146 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:54:57,147 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:54:57,147 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:54:57,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:54:57,149 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:54:57,149 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:54:57,151 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:54:57,151 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:54:57,212 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:54:57,212 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:54:57,213 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:54:57,213 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:54:57,215 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:54:57,217 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:54:57,219 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:54:57,219 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:54:57,239 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:54:57,240 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:54:57,240 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:54:57,241 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:54:57,245 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:54:57,245 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:54:57,247 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:54:57,247 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:54:57,418 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:54:57,418 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:54:57,419 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:54:57,419 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:54:57,421 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:54:57,423 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:54:57,425 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:54:57,426 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:54:57,453 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:54:57,454 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:54:57,455 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:54:57,455 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:54:57,456 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:54:57,457 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:54:57,462 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:54:57,463 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:54:57,519 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:54:57,520 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:54:57,520 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:54:57,521 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:54:57,522 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:54:57,523 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:54:57,525 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:54:57,526 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:54:57,553 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:54:57,554 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:54:57,555 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:54:57,555 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:54:57,557 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:54:57,558 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:54:57,560 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:54:57,561 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:54:57,953 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2020-10-16 04:54:58,045 INFO L132 LiptonReduction]: Checked pairs total: 2262 [2020-10-16 04:54:58,045 INFO L134 LiptonReduction]: Total number of compositions: 66 [2020-10-16 04:54:58,048 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5983 [2020-10-16 04:54:58,055 INFO L129 PetriNetUnfolder]: 0/10 cut-off events. [2020-10-16 04:54:58,055 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:54:58,055 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:54:58,056 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2020-10-16 04:54:58,056 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:54:58,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:54:58,065 INFO L82 PathProgramCache]: Analyzing trace with hash 862545524, now seen corresponding path program 1 times [2020-10-16 04:54:58,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:54:58,074 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497811529] [2020-10-16 04:54:58,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:54:58,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:54:58,307 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:54:58,308 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497811529] [2020-10-16 04:54:58,309 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:54:58,309 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:54:58,310 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677200958] [2020-10-16 04:54:58,320 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:54:58,320 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:54:58,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:54:58,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:54:58,339 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 141 [2020-10-16 04:54:58,342 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 19 transitions, 44 flow. Second operand 3 states. [2020-10-16 04:54:58,342 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:54:58,342 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 141 [2020-10-16 04:54:58,344 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:54:58,415 INFO L129 PetriNetUnfolder]: 16/58 cut-off events. [2020-10-16 04:54:58,416 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:54:58,416 INFO L80 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 58 events. 16/58 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 206 event pairs, 2 based on Foata normal form. 6/62 useless extension candidates. Maximal degree in co-relation 91. Up to 27 conditions per place. [2020-10-16 04:54:58,418 INFO L132 encePairwiseOnDemand]: 137/141 looper letters, 7 selfloop transitions, 2 changer transitions 0/20 dead transitions. [2020-10-16 04:54:58,418 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 20 transitions, 64 flow [2020-10-16 04:54:58,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:54:58,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:54:58,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 351 transitions. [2020-10-16 04:54:58,436 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8297872340425532 [2020-10-16 04:54:58,437 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 351 transitions. [2020-10-16 04:54:58,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 351 transitions. [2020-10-16 04:54:58,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:54:58,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 351 transitions. [2020-10-16 04:54:58,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:54:58,453 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:54:58,453 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:54:58,456 INFO L185 Difference]: Start difference. First operand has 25 places, 19 transitions, 44 flow. Second operand 3 states and 351 transitions. [2020-10-16 04:54:58,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 20 transitions, 64 flow [2020-10-16 04:54:58,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 20 transitions, 62 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 04:54:58,462 INFO L241 Difference]: Finished difference. Result has 24 places, 17 transitions, 42 flow [2020-10-16 04:54:58,465 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=24, PETRI_TRANSITIONS=17} [2020-10-16 04:54:58,466 INFO L342 CegarLoopForPetriNet]: 25 programPoint places, -1 predicate places. [2020-10-16 04:54:58,466 INFO L481 AbstractCegarLoop]: Abstraction has has 24 places, 17 transitions, 42 flow [2020-10-16 04:54:58,466 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:54:58,466 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:54:58,467 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:54:58,467 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 04:54:58,467 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:54:58,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:54:58,468 INFO L82 PathProgramCache]: Analyzing trace with hash -694030530, now seen corresponding path program 1 times [2020-10-16 04:54:58,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:54:58,468 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846766577] [2020-10-16 04:54:58,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:54:58,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:54:58,754 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:54:58,756 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846766577] [2020-10-16 04:54:58,756 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:54:58,757 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:54:58,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689587213] [2020-10-16 04:54:58,758 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:54:58,759 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:54:58,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:54:58,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:54:58,761 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 141 [2020-10-16 04:54:58,761 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 17 transitions, 42 flow. Second operand 5 states. [2020-10-16 04:54:58,762 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:54:58,762 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 141 [2020-10-16 04:54:58,762 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:54:58,963 INFO L129 PetriNetUnfolder]: 64/155 cut-off events. [2020-10-16 04:54:58,964 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2020-10-16 04:54:58,965 INFO L80 FinitePrefix]: Finished finitePrefix Result has 307 conditions, 155 events. 64/155 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 696 event pairs, 22 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 298. Up to 87 conditions per place. [2020-10-16 04:54:58,966 INFO L132 encePairwiseOnDemand]: 134/141 looper letters, 8 selfloop transitions, 6 changer transitions 14/36 dead transitions. [2020-10-16 04:54:58,966 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 36 transitions, 146 flow [2020-10-16 04:54:58,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:54:58,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:54:58,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 689 transitions. [2020-10-16 04:54:58,972 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6980749746707193 [2020-10-16 04:54:58,972 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 689 transitions. [2020-10-16 04:54:58,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 689 transitions. [2020-10-16 04:54:58,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:54:58,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 689 transitions. [2020-10-16 04:54:58,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:54:58,979 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:54:58,979 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:54:58,979 INFO L185 Difference]: Start difference. First operand has 24 places, 17 transitions, 42 flow. Second operand 7 states and 689 transitions. [2020-10-16 04:54:58,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 36 transitions, 146 flow [2020-10-16 04:54:58,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 132 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 04:54:58,981 INFO L241 Difference]: Finished difference. Result has 33 places, 21 transitions, 87 flow [2020-10-16 04:54:58,982 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=87, PETRI_PLACES=33, PETRI_TRANSITIONS=21} [2020-10-16 04:54:58,982 INFO L342 CegarLoopForPetriNet]: 25 programPoint places, 8 predicate places. [2020-10-16 04:54:58,983 INFO L481 AbstractCegarLoop]: Abstraction has has 33 places, 21 transitions, 87 flow [2020-10-16 04:54:58,983 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:54:58,983 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:54:58,983 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:54:58,983 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 04:54:58,983 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:54:58,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:54:58,984 INFO L82 PathProgramCache]: Analyzing trace with hash -40157678, now seen corresponding path program 1 times [2020-10-16 04:54:58,984 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:54:58,984 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503111643] [2020-10-16 04:54:58,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:54:59,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:54:59,196 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:54:59,196 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503111643] [2020-10-16 04:54:59,197 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:54:59,197 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:54:59,197 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092223313] [2020-10-16 04:54:59,198 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 04:54:59,198 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:54:59,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 04:54:59,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-16 04:54:59,201 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 141 [2020-10-16 04:54:59,201 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 21 transitions, 87 flow. Second operand 6 states. [2020-10-16 04:54:59,201 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:54:59,201 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 141 [2020-10-16 04:54:59,202 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:54:59,408 INFO L129 PetriNetUnfolder]: 35/95 cut-off events. [2020-10-16 04:54:59,408 INFO L130 PetriNetUnfolder]: For 100/103 co-relation queries the response was YES. [2020-10-16 04:54:59,409 INFO L80 FinitePrefix]: Finished finitePrefix Result has 294 conditions, 95 events. 35/95 cut-off events. For 100/103 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 357 event pairs, 10 based on Foata normal form. 9/104 useless extension candidates. Maximal degree in co-relation 280. Up to 62 conditions per place. [2020-10-16 04:54:59,410 INFO L132 encePairwiseOnDemand]: 135/141 looper letters, 12 selfloop transitions, 5 changer transitions 6/31 dead transitions. [2020-10-16 04:54:59,411 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 31 transitions, 177 flow [2020-10-16 04:54:59,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 04:54:59,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 04:54:59,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 538 transitions. [2020-10-16 04:54:59,414 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6359338061465721 [2020-10-16 04:54:59,414 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 538 transitions. [2020-10-16 04:54:59,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 538 transitions. [2020-10-16 04:54:59,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:54:59,415 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 538 transitions. [2020-10-16 04:54:59,417 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 04:54:59,419 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 04:54:59,420 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 04:54:59,420 INFO L185 Difference]: Start difference. First operand has 33 places, 21 transitions, 87 flow. Second operand 6 states and 538 transitions. [2020-10-16 04:54:59,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 31 transitions, 177 flow [2020-10-16 04:54:59,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 31 transitions, 175 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-16 04:54:59,423 INFO L241 Difference]: Finished difference. Result has 36 places, 23 transitions, 120 flow [2020-10-16 04:54:59,423 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=120, PETRI_PLACES=36, PETRI_TRANSITIONS=23} [2020-10-16 04:54:59,424 INFO L342 CegarLoopForPetriNet]: 25 programPoint places, 11 predicate places. [2020-10-16 04:54:59,424 INFO L481 AbstractCegarLoop]: Abstraction has has 36 places, 23 transitions, 120 flow [2020-10-16 04:54:59,424 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 04:54:59,424 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:54:59,424 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:54:59,424 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 04:54:59,425 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:54:59,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:54:59,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1663425847, now seen corresponding path program 1 times [2020-10-16 04:54:59,425 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:54:59,425 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629973666] [2020-10-16 04:54:59,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:54:59,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:54:59,635 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:54:59,636 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629973666] [2020-10-16 04:54:59,636 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:54:59,636 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:54:59,636 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352748095] [2020-10-16 04:54:59,637 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 04:54:59,637 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:54:59,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 04:54:59,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 04:54:59,639 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 141 [2020-10-16 04:54:59,639 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 23 transitions, 120 flow. Second operand 6 states. [2020-10-16 04:54:59,640 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:54:59,640 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 141 [2020-10-16 04:54:59,640 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:54:59,817 INFO L129 PetriNetUnfolder]: 31/92 cut-off events. [2020-10-16 04:54:59,818 INFO L130 PetriNetUnfolder]: For 193/195 co-relation queries the response was YES. [2020-10-16 04:54:59,818 INFO L80 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 92 events. 31/92 cut-off events. For 193/195 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 353 event pairs, 11 based on Foata normal form. 8/100 useless extension candidates. Maximal degree in co-relation 313. Up to 50 conditions per place. [2020-10-16 04:54:59,819 INFO L132 encePairwiseOnDemand]: 135/141 looper letters, 12 selfloop transitions, 8 changer transitions 6/34 dead transitions. [2020-10-16 04:54:59,820 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 34 transitions, 238 flow [2020-10-16 04:54:59,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:54:59,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:54:59,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 661 transitions. [2020-10-16 04:54:59,826 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6697061803444783 [2020-10-16 04:54:59,826 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 661 transitions. [2020-10-16 04:54:59,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 661 transitions. [2020-10-16 04:54:59,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:54:59,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 661 transitions. [2020-10-16 04:54:59,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:54:59,830 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:54:59,831 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:54:59,831 INFO L185 Difference]: Start difference. First operand has 36 places, 23 transitions, 120 flow. Second operand 7 states and 661 transitions. [2020-10-16 04:54:59,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 34 transitions, 238 flow [2020-10-16 04:54:59,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 34 transitions, 223 flow, removed 4 selfloop flow, removed 3 redundant places. [2020-10-16 04:54:59,834 INFO L241 Difference]: Finished difference. Result has 41 places, 25 transitions, 150 flow [2020-10-16 04:54:59,835 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=150, PETRI_PLACES=41, PETRI_TRANSITIONS=25} [2020-10-16 04:54:59,835 INFO L342 CegarLoopForPetriNet]: 25 programPoint places, 16 predicate places. [2020-10-16 04:54:59,835 INFO L481 AbstractCegarLoop]: Abstraction has has 41 places, 25 transitions, 150 flow [2020-10-16 04:54:59,835 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 04:54:59,835 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:54:59,835 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:54:59,836 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 04:54:59,836 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:54:59,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:54:59,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1045497079, now seen corresponding path program 1 times [2020-10-16 04:54:59,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:54:59,837 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359940917] [2020-10-16 04:54:59,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:54:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:55:00,004 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:55:00,004 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359940917] [2020-10-16 04:55:00,005 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:55:00,005 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:55:00,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945224643] [2020-10-16 04:55:00,005 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:55:00,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:55:00,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:55:00,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:55:00,008 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 141 [2020-10-16 04:55:00,009 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 25 transitions, 150 flow. Second operand 7 states. [2020-10-16 04:55:00,009 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:55:00,009 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 141 [2020-10-16 04:55:00,009 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:55:00,244 INFO L129 PetriNetUnfolder]: 38/103 cut-off events. [2020-10-16 04:55:00,244 INFO L130 PetriNetUnfolder]: For 381/383 co-relation queries the response was YES. [2020-10-16 04:55:00,248 INFO L80 FinitePrefix]: Finished finitePrefix Result has 452 conditions, 103 events. 38/103 cut-off events. For 381/383 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 390 event pairs, 8 based on Foata normal form. 6/109 useless extension candidates. Maximal degree in co-relation 431. Up to 63 conditions per place. [2020-10-16 04:55:00,249 INFO L132 encePairwiseOnDemand]: 133/141 looper letters, 12 selfloop transitions, 13 changer transitions 5/38 dead transitions. [2020-10-16 04:55:00,250 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 38 transitions, 316 flow [2020-10-16 04:55:00,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:55:00,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:55:00,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 689 transitions. [2020-10-16 04:55:00,255 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6980749746707193 [2020-10-16 04:55:00,255 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 689 transitions. [2020-10-16 04:55:00,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 689 transitions. [2020-10-16 04:55:00,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:55:00,256 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 689 transitions. [2020-10-16 04:55:00,258 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:55:00,260 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:55:00,260 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:55:00,261 INFO L185 Difference]: Start difference. First operand has 41 places, 25 transitions, 150 flow. Second operand 7 states and 689 transitions. [2020-10-16 04:55:00,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 38 transitions, 316 flow [2020-10-16 04:55:00,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 38 transitions, 281 flow, removed 15 selfloop flow, removed 5 redundant places. [2020-10-16 04:55:00,269 INFO L241 Difference]: Finished difference. Result has 43 places, 31 transitions, 226 flow [2020-10-16 04:55:00,270 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=226, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2020-10-16 04:55:00,270 INFO L342 CegarLoopForPetriNet]: 25 programPoint places, 18 predicate places. [2020-10-16 04:55:00,270 INFO L481 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 226 flow [2020-10-16 04:55:00,270 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:55:00,270 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:55:00,271 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:55:00,271 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 04:55:00,271 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:55:00,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:55:00,272 INFO L82 PathProgramCache]: Analyzing trace with hash 80491176, now seen corresponding path program 1 times [2020-10-16 04:55:00,272 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:55:00,272 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232120187] [2020-10-16 04:55:00,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:55:00,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:55:00,608 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:55:00,609 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232120187] [2020-10-16 04:55:00,610 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:55:00,610 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:55:00,610 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336926068] [2020-10-16 04:55:00,611 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:55:00,611 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:55:00,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:55:00,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:55:00,614 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 141 [2020-10-16 04:55:00,614 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 226 flow. Second operand 7 states. [2020-10-16 04:55:00,614 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:55:00,614 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 141 [2020-10-16 04:55:00,615 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:55:00,827 INFO L129 PetriNetUnfolder]: 31/101 cut-off events. [2020-10-16 04:55:00,828 INFO L130 PetriNetUnfolder]: For 365/369 co-relation queries the response was YES. [2020-10-16 04:55:00,828 INFO L80 FinitePrefix]: Finished finitePrefix Result has 478 conditions, 101 events. 31/101 cut-off events. For 365/369 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 405 event pairs, 4 based on Foata normal form. 11/112 useless extension candidates. Maximal degree in co-relation 456. Up to 45 conditions per place. [2020-10-16 04:55:00,830 INFO L132 encePairwiseOnDemand]: 136/141 looper letters, 18 selfloop transitions, 7 changer transitions 6/39 dead transitions. [2020-10-16 04:55:00,830 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 39 transitions, 361 flow [2020-10-16 04:55:00,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 04:55:00,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 04:55:00,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 590 transitions. [2020-10-16 04:55:00,833 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6973995271867612 [2020-10-16 04:55:00,834 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 590 transitions. [2020-10-16 04:55:00,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 590 transitions. [2020-10-16 04:55:00,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:55:00,835 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 590 transitions. [2020-10-16 04:55:00,836 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 04:55:00,837 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 04:55:00,837 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 04:55:00,838 INFO L185 Difference]: Start difference. First operand has 43 places, 31 transitions, 226 flow. Second operand 6 states and 590 transitions. [2020-10-16 04:55:00,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 39 transitions, 361 flow [2020-10-16 04:55:00,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 39 transitions, 332 flow, removed 14 selfloop flow, removed 3 redundant places. [2020-10-16 04:55:00,843 INFO L241 Difference]: Finished difference. Result has 46 places, 30 transitions, 220 flow [2020-10-16 04:55:00,843 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=220, PETRI_PLACES=46, PETRI_TRANSITIONS=30} [2020-10-16 04:55:00,844 INFO L342 CegarLoopForPetriNet]: 25 programPoint places, 21 predicate places. [2020-10-16 04:55:00,844 INFO L481 AbstractCegarLoop]: Abstraction has has 46 places, 30 transitions, 220 flow [2020-10-16 04:55:00,844 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:55:00,844 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:55:00,844 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:55:00,844 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 04:55:00,844 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:55:00,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:55:00,845 INFO L82 PathProgramCache]: Analyzing trace with hash 61343251, now seen corresponding path program 1 times [2020-10-16 04:55:00,845 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:55:00,845 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578343737] [2020-10-16 04:55:00,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:55:00,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:55:00,966 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:55:00,966 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578343737] [2020-10-16 04:55:00,967 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:55:00,967 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:55:00,967 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460053674] [2020-10-16 04:55:00,967 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:55:00,968 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:55:00,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:55:00,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:55:00,969 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 141 [2020-10-16 04:55:00,969 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 30 transitions, 220 flow. Second operand 4 states. [2020-10-16 04:55:00,969 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:55:00,969 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 141 [2020-10-16 04:55:00,969 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:55:01,049 INFO L129 PetriNetUnfolder]: 88/205 cut-off events. [2020-10-16 04:55:01,049 INFO L130 PetriNetUnfolder]: For 752/760 co-relation queries the response was YES. [2020-10-16 04:55:01,050 INFO L80 FinitePrefix]: Finished finitePrefix Result has 860 conditions, 205 events. 88/205 cut-off events. For 752/760 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 954 event pairs, 17 based on Foata normal form. 29/232 useless extension candidates. Maximal degree in co-relation 836. Up to 115 conditions per place. [2020-10-16 04:55:01,052 INFO L132 encePairwiseOnDemand]: 136/141 looper letters, 24 selfloop transitions, 6 changer transitions 1/40 dead transitions. [2020-10-16 04:55:01,052 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 40 transitions, 336 flow [2020-10-16 04:55:01,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 04:55:01,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 04:55:01,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 396 transitions. [2020-10-16 04:55:01,055 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7021276595744681 [2020-10-16 04:55:01,055 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 396 transitions. [2020-10-16 04:55:01,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 396 transitions. [2020-10-16 04:55:01,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:55:01,056 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 396 transitions. [2020-10-16 04:55:01,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 04:55:01,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 04:55:01,058 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 04:55:01,058 INFO L185 Difference]: Start difference. First operand has 46 places, 30 transitions, 220 flow. Second operand 4 states and 396 transitions. [2020-10-16 04:55:01,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 40 transitions, 336 flow [2020-10-16 04:55:01,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 40 transitions, 294 flow, removed 10 selfloop flow, removed 7 redundant places. [2020-10-16 04:55:01,062 INFO L241 Difference]: Finished difference. Result has 42 places, 29 transitions, 207 flow [2020-10-16 04:55:01,063 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=207, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2020-10-16 04:55:01,063 INFO L342 CegarLoopForPetriNet]: 25 programPoint places, 17 predicate places. [2020-10-16 04:55:01,063 INFO L481 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 207 flow [2020-10-16 04:55:01,063 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:55:01,063 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:55:01,063 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:55:01,064 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 04:55:01,064 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:55:01,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:55:01,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1345758819, now seen corresponding path program 2 times [2020-10-16 04:55:01,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:55:01,065 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138585504] [2020-10-16 04:55:01,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:55:01,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:55:01,125 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:55:01,126 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138585504] [2020-10-16 04:55:01,126 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:55:01,126 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:55:01,126 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467887463] [2020-10-16 04:55:01,127 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:55:01,127 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:55:01,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:55:01,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:55:01,128 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 141 [2020-10-16 04:55:01,129 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 207 flow. Second operand 5 states. [2020-10-16 04:55:01,129 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:55:01,129 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 141 [2020-10-16 04:55:01,129 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:55:01,204 INFO L129 PetriNetUnfolder]: 47/134 cut-off events. [2020-10-16 04:55:01,205 INFO L130 PetriNetUnfolder]: For 425/430 co-relation queries the response was YES. [2020-10-16 04:55:01,205 INFO L80 FinitePrefix]: Finished finitePrefix Result has 551 conditions, 134 events. 47/134 cut-off events. For 425/430 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 581 event pairs, 8 based on Foata normal form. 25/156 useless extension candidates. Maximal degree in co-relation 529. Up to 47 conditions per place. [2020-10-16 04:55:01,206 INFO L132 encePairwiseOnDemand]: 135/141 looper letters, 20 selfloop transitions, 8 changer transitions 3/40 dead transitions. [2020-10-16 04:55:01,207 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 40 transitions, 332 flow [2020-10-16 04:55:01,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:55:01,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:55:01,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 493 transitions. [2020-10-16 04:55:01,209 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.699290780141844 [2020-10-16 04:55:01,210 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 493 transitions. [2020-10-16 04:55:01,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 493 transitions. [2020-10-16 04:55:01,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:55:01,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 493 transitions. [2020-10-16 04:55:01,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:55:01,213 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:55:01,213 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:55:01,213 INFO L185 Difference]: Start difference. First operand has 42 places, 29 transitions, 207 flow. Second operand 5 states and 493 transitions. [2020-10-16 04:55:01,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 40 transitions, 332 flow [2020-10-16 04:55:01,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 40 transitions, 315 flow, removed 4 selfloop flow, removed 2 redundant places. [2020-10-16 04:55:01,217 INFO L241 Difference]: Finished difference. Result has 46 places, 30 transitions, 224 flow [2020-10-16 04:55:01,217 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=224, PETRI_PLACES=46, PETRI_TRANSITIONS=30} [2020-10-16 04:55:01,218 INFO L342 CegarLoopForPetriNet]: 25 programPoint places, 21 predicate places. [2020-10-16 04:55:01,218 INFO L481 AbstractCegarLoop]: Abstraction has has 46 places, 30 transitions, 224 flow [2020-10-16 04:55:01,218 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:55:01,218 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:55:01,218 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:55:01,218 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 04:55:01,219 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:55:01,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:55:01,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1248066376, now seen corresponding path program 1 times [2020-10-16 04:55:01,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:55:01,220 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295526908] [2020-10-16 04:55:01,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:55:01,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:55:01,276 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:55:01,277 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295526908] [2020-10-16 04:55:01,277 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:55:01,277 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:55:01,277 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734578057] [2020-10-16 04:55:01,278 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:55:01,278 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:55:01,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:55:01,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:55:01,279 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 141 [2020-10-16 04:55:01,279 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 30 transitions, 224 flow. Second operand 5 states. [2020-10-16 04:55:01,280 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:55:01,280 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 141 [2020-10-16 04:55:01,280 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:55:01,323 INFO L129 PetriNetUnfolder]: 9/52 cut-off events. [2020-10-16 04:55:01,324 INFO L130 PetriNetUnfolder]: For 190/201 co-relation queries the response was YES. [2020-10-16 04:55:01,324 INFO L80 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 52 events. 9/52 cut-off events. For 190/201 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 148 event pairs, 0 based on Foata normal form. 13/64 useless extension candidates. Maximal degree in co-relation 193. Up to 17 conditions per place. [2020-10-16 04:55:01,325 INFO L132 encePairwiseOnDemand]: 136/141 looper letters, 2 selfloop transitions, 8 changer transitions 2/32 dead transitions. [2020-10-16 04:55:01,325 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 32 transitions, 256 flow [2020-10-16 04:55:01,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:55:01,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:55:01,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 555 transitions. [2020-10-16 04:55:01,328 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7872340425531915 [2020-10-16 04:55:01,328 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 555 transitions. [2020-10-16 04:55:01,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 555 transitions. [2020-10-16 04:55:01,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:55:01,329 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 555 transitions. [2020-10-16 04:55:01,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:55:01,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:55:01,332 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:55:01,332 INFO L185 Difference]: Start difference. First operand has 46 places, 30 transitions, 224 flow. Second operand 5 states and 555 transitions. [2020-10-16 04:55:01,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 32 transitions, 256 flow [2020-10-16 04:55:01,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 32 transitions, 214 flow, removed 10 selfloop flow, removed 7 redundant places. [2020-10-16 04:55:01,335 INFO L241 Difference]: Finished difference. Result has 45 places, 30 transitions, 211 flow [2020-10-16 04:55:01,335 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=211, PETRI_PLACES=45, PETRI_TRANSITIONS=30} [2020-10-16 04:55:01,335 INFO L342 CegarLoopForPetriNet]: 25 programPoint places, 20 predicate places. [2020-10-16 04:55:01,336 INFO L481 AbstractCegarLoop]: Abstraction has has 45 places, 30 transitions, 211 flow [2020-10-16 04:55:01,336 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:55:01,336 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:55:01,336 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:55:01,336 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 04:55:01,336 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:55:01,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:55:01,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1492177566, now seen corresponding path program 1 times [2020-10-16 04:55:01,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:55:01,337 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145499816] [2020-10-16 04:55:01,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:55:01,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:55:01,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:55:01,611 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145499816] [2020-10-16 04:55:01,612 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:55:01,612 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 04:55:01,612 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161095351] [2020-10-16 04:55:01,612 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 04:55:01,613 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:55:01,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 04:55:01,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-10-16 04:55:01,618 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 141 [2020-10-16 04:55:01,619 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 30 transitions, 211 flow. Second operand 10 states. [2020-10-16 04:55:01,619 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:55:01,619 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 141 [2020-10-16 04:55:01,619 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:55:01,894 INFO L129 PetriNetUnfolder]: 15/79 cut-off events. [2020-10-16 04:55:01,894 INFO L130 PetriNetUnfolder]: For 221/225 co-relation queries the response was YES. [2020-10-16 04:55:01,894 INFO L80 FinitePrefix]: Finished finitePrefix Result has 322 conditions, 79 events. 15/79 cut-off events. For 221/225 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 288 event pairs, 1 based on Foata normal form. 6/85 useless extension candidates. Maximal degree in co-relation 299. Up to 25 conditions per place. [2020-10-16 04:55:01,895 INFO L132 encePairwiseOnDemand]: 133/141 looper letters, 9 selfloop transitions, 7 changer transitions 17/44 dead transitions. [2020-10-16 04:55:01,895 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 44 transitions, 368 flow [2020-10-16 04:55:01,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-16 04:55:01,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-16 04:55:01,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 894 transitions. [2020-10-16 04:55:01,900 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6340425531914894 [2020-10-16 04:55:01,900 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 894 transitions. [2020-10-16 04:55:01,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 894 transitions. [2020-10-16 04:55:01,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:55:01,901 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 894 transitions. [2020-10-16 04:55:01,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-16 04:55:01,906 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-16 04:55:01,906 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-16 04:55:01,906 INFO L185 Difference]: Start difference. First operand has 45 places, 30 transitions, 211 flow. Second operand 10 states and 894 transitions. [2020-10-16 04:55:01,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 44 transitions, 368 flow [2020-10-16 04:55:01,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 44 transitions, 330 flow, removed 6 selfloop flow, removed 5 redundant places. [2020-10-16 04:55:01,909 INFO L241 Difference]: Finished difference. Result has 56 places, 27 transitions, 203 flow [2020-10-16 04:55:01,909 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=203, PETRI_PLACES=56, PETRI_TRANSITIONS=27} [2020-10-16 04:55:01,910 INFO L342 CegarLoopForPetriNet]: 25 programPoint places, 31 predicate places. [2020-10-16 04:55:01,910 INFO L481 AbstractCegarLoop]: Abstraction has has 56 places, 27 transitions, 203 flow [2020-10-16 04:55:01,910 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 04:55:01,910 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:55:01,910 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:55:01,910 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 04:55:01,911 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:55:01,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:55:01,911 INFO L82 PathProgramCache]: Analyzing trace with hash -2100395598, now seen corresponding path program 2 times [2020-10-16 04:55:01,911 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:55:01,911 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125052370] [2020-10-16 04:55:01,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:55:01,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:55:02,257 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:55:02,258 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125052370] [2020-10-16 04:55:02,258 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:55:02,258 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 04:55:02,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848918960] [2020-10-16 04:55:02,259 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 04:55:02,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:55:02,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 04:55:02,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-10-16 04:55:02,261 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 141 [2020-10-16 04:55:02,261 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 27 transitions, 203 flow. Second operand 10 states. [2020-10-16 04:55:02,262 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:55:02,262 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 141 [2020-10-16 04:55:02,262 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:55:02,490 INFO L129 PetriNetUnfolder]: 8/53 cut-off events. [2020-10-16 04:55:02,491 INFO L130 PetriNetUnfolder]: For 179/181 co-relation queries the response was YES. [2020-10-16 04:55:02,491 INFO L80 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 53 events. 8/53 cut-off events. For 179/181 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 3/56 useless extension candidates. Maximal degree in co-relation 212. Up to 17 conditions per place. [2020-10-16 04:55:02,491 INFO L132 encePairwiseOnDemand]: 134/141 looper letters, 10 selfloop transitions, 2 changer transitions 10/32 dead transitions. [2020-10-16 04:55:02,492 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 32 transitions, 278 flow [2020-10-16 04:55:02,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 04:55:02,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 04:55:02,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 721 transitions. [2020-10-16 04:55:02,496 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6391843971631206 [2020-10-16 04:55:02,496 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 721 transitions. [2020-10-16 04:55:02,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 721 transitions. [2020-10-16 04:55:02,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:55:02,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 721 transitions. [2020-10-16 04:55:02,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 04:55:02,501 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 04:55:02,501 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 04:55:02,501 INFO L185 Difference]: Start difference. First operand has 56 places, 27 transitions, 203 flow. Second operand 8 states and 721 transitions. [2020-10-16 04:55:02,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 32 transitions, 278 flow [2020-10-16 04:55:02,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 32 transitions, 229 flow, removed 15 selfloop flow, removed 10 redundant places. [2020-10-16 04:55:02,505 INFO L241 Difference]: Finished difference. Result has 52 places, 21 transitions, 125 flow [2020-10-16 04:55:02,505 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=125, PETRI_PLACES=52, PETRI_TRANSITIONS=21} [2020-10-16 04:55:02,505 INFO L342 CegarLoopForPetriNet]: 25 programPoint places, 27 predicate places. [2020-10-16 04:55:02,505 INFO L481 AbstractCegarLoop]: Abstraction has has 52 places, 21 transitions, 125 flow [2020-10-16 04:55:02,505 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 04:55:02,505 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:55:02,506 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:55:02,506 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 04:55:02,506 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:55:02,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:55:02,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1169573278, now seen corresponding path program 3 times [2020-10-16 04:55:02,506 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:55:02,507 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105214823] [2020-10-16 04:55:02,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:55:02,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 04:55:02,563 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 04:55:02,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 04:55:02,608 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 04:55:02,651 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 04:55:02,651 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 04:55:02,652 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 04:55:02,668 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:55:02,668 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:55:02,674 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:55:02,674 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:55:02,674 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:55:02,674 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:55:02,675 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:55:02,675 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:55:02,675 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:55:02,675 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:55:02,675 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:55:02,675 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:55:02,676 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:55:02,676 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:55:02,678 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:55:02,678 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:55:02,678 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:55:02,678 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:55:02,678 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:55:02,679 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:55:02,679 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:55:02,679 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:55:02,679 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:55:02,679 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:55:02,680 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:55:02,680 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:55:02,681 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:55:02,681 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:55:02,681 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:55:02,682 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:55:02,682 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:55:02,682 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:55:02,682 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:55:02,682 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:55:02,683 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:55:02,683 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:55:02,683 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:55:02,683 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:55:02,687 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:55:02,688 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:55:02,688 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:55:02,688 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:55:02,688 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:55:02,688 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:55:02,688 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:55:02,688 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:55:02,689 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:55:02,689 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:55:02,689 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:55:02,689 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:55:02,689 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:55:02,689 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:55:02,689 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:55:02,690 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:55:02,690 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:55:02,690 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:55:02,690 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:55:02,690 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:55:02,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 04:55:02 BasicIcfg [2020-10-16 04:55:02,773 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 04:55:02,775 INFO L168 Benchmark]: Toolchain (without parser) took 13646.39 ms. Allocated memory was 250.6 MB in the beginning and 555.7 MB in the end (delta: 305.1 MB). Free memory was 205.9 MB in the beginning and 461.1 MB in the end (delta: -255.2 MB). Peak memory consumption was 49.9 MB. Max. memory is 14.2 GB. [2020-10-16 04:55:02,776 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 250.6 MB. Free memory was 228.7 MB in the beginning and 227.8 MB in the end (delta: 838.9 kB). Peak memory consumption was 838.9 kB. Max. memory is 14.2 GB. [2020-10-16 04:55:02,777 INFO L168 Benchmark]: CACSL2BoogieTranslator took 771.26 ms. Allocated memory was 250.6 MB in the beginning and 313.0 MB in the end (delta: 62.4 MB). Free memory was 205.0 MB in the beginning and 265.7 MB in the end (delta: -60.6 MB). Peak memory consumption was 33.5 MB. Max. memory is 14.2 GB. [2020-10-16 04:55:02,779 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.18 ms. Allocated memory is still 313.0 MB. Free memory was 265.7 MB in the beginning and 263.1 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:55:02,780 INFO L168 Benchmark]: Boogie Preprocessor took 34.67 ms. Allocated memory is still 313.0 MB. Free memory was 263.1 MB in the beginning and 260.6 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:55:02,783 INFO L168 Benchmark]: RCFGBuilder took 1868.92 ms. Allocated memory was 313.0 MB in the beginning and 357.6 MB in the end (delta: 44.6 MB). Free memory was 260.6 MB in the beginning and 221.2 MB in the end (delta: 39.4 MB). Peak memory consumption was 101.7 MB. Max. memory is 14.2 GB. [2020-10-16 04:55:02,784 INFO L168 Benchmark]: TraceAbstraction took 10888.55 ms. Allocated memory was 357.6 MB in the beginning and 555.7 MB in the end (delta: 198.2 MB). Free memory was 219.0 MB in the beginning and 461.1 MB in the end (delta: -242.1 MB). There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 04:55:02,790 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.23 ms. Allocated memory is still 250.6 MB. Free memory was 228.7 MB in the beginning and 227.8 MB in the end (delta: 838.9 kB). Peak memory consumption was 838.9 kB. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 771.26 ms. Allocated memory was 250.6 MB in the beginning and 313.0 MB in the end (delta: 62.4 MB). Free memory was 205.0 MB in the beginning and 265.7 MB in the end (delta: -60.6 MB). Peak memory consumption was 33.5 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 78.18 ms. Allocated memory is still 313.0 MB. Free memory was 265.7 MB in the beginning and 263.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 34.67 ms. Allocated memory is still 313.0 MB. Free memory was 263.1 MB in the beginning and 260.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 1868.92 ms. Allocated memory was 313.0 MB in the beginning and 357.6 MB in the end (delta: 44.6 MB). Free memory was 260.6 MB in the beginning and 221.2 MB in the end (delta: 39.4 MB). Peak memory consumption was 101.7 MB. Max. memory is 14.2 GB. * TraceAbstraction took 10888.55 ms. Allocated memory was 357.6 MB in the beginning and 555.7 MB in the end (delta: 198.2 MB). Free memory was 219.0 MB in the beginning and 461.1 MB in the end (delta: -242.1 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 532 VarBasedMoverChecksPositive, 52 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 33 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.1s, 56 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 5.9s, 78 PlacesBefore, 25 PlacesAfterwards, 73 TransitionsBefore, 19 TransitionsAfterwards, 888 CoEnabledTransitionPairs, 6 FixpointIterations, 28 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 66 TotalNumberOfCompositions, 2262 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L697] 0 int __unbuffered_cnt = 0; [L699] 0 int __unbuffered_p1_EAX = 0; [L700] 0 _Bool main$tmp_guard0; [L701] 0 _Bool main$tmp_guard1; [L703] 0 int x = 0; [L704] 0 _Bool x$flush_delayed; [L705] 0 int x$mem_tmp; [L706] 0 _Bool x$r_buff0_thd0; [L707] 0 _Bool x$r_buff0_thd1; [L708] 0 _Bool x$r_buff0_thd2; [L709] 0 _Bool x$r_buff1_thd0; [L710] 0 _Bool x$r_buff1_thd1; [L711] 0 _Bool x$r_buff1_thd2; [L712] 0 _Bool x$read_delayed; [L713] 0 int *x$read_delayed_var; [L714] 0 int x$w_buff0; [L715] 0 _Bool x$w_buff0_used; [L716] 0 int x$w_buff1; [L717] 0 _Bool x$w_buff1_used; [L719] 0 int y = 0; [L720] 0 _Bool weak$$choice0; [L721] 0 _Bool weak$$choice2; [L781] 0 pthread_t t1447; [L782] FCALL, FORK 0 pthread_create(&t1447, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L783] 0 pthread_t t1448; [L784] FCALL, FORK 0 pthread_create(&t1448, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L745] 2 x$w_buff1 = x$w_buff0 [L746] 2 x$w_buff0 = 2 [L747] 2 x$w_buff1_used = x$w_buff0_used [L748] 2 x$w_buff0_used = (_Bool)1 [L7] COND TRUE 2 !expression [L7] 2 __VERIFIER_error() [L750] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L751] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L752] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L753] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L756] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L725] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L728] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L731] 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) [L731] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L731] 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) [L731] 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) [L732] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L732] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L733] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L733] 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 [L734] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L734] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L735] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L735] 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 [L738] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L740] 1 return 0; [L759] 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) [L759] 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) [L760] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L760] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L761] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L761] 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 [L762] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L762] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L763] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L763] 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 [L766] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L768] 2 return 0; [L786] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=1] [L3] COND FALSE 0 !(!cond) [L790] 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) [L790] 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) [L791] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L791] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L792] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L792] 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 [L793] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L793] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L794] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L794] 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 [L797] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L798] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L799] 0 x$flush_delayed = weak$$choice2 [L800] 0 x$mem_tmp = x [L801] 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) [L801] 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) [L802] 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)) [L802] 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)) [L803] 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)) [L803] 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) [L803] 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)) [L803] 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)) [L804] 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)) [L804] 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)) [L805] 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)) [L805] 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)) [L806] 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)) [L806] EXPR 0 !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) [L806] 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)) [L806] 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)) [L807] 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)) [L807] 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) [L807] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L807] 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) [L807] 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)) [L807] 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)) [L808] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) [L809] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L809] 0 x = x$flush_delayed ? x$mem_tmp : x [L810] 0 x$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=0, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 74 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: 10.6s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.0s, HoareTripleCheckerStatistics: 50 SDtfs, 61 SDslu, 71 SDs, 0 SdLazy, 386 SolverSat, 108 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=226occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 136 NumberOfCodeBlocks, 136 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 109 ConstructedInterpolants, 0 QuantifiedInterpolants, 16834 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...