/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.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix038_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 01:25:04,761 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 01:25:04,764 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 01:25:04,801 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 01:25:04,801 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 01:25:04,809 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 01:25:04,812 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 01:25:04,815 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 01:25:04,818 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 01:25:04,821 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 01:25:04,821 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 01:25:04,822 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 01:25:04,822 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 01:25:04,825 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 01:25:04,827 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 01:25:04,829 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 01:25:04,830 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 01:25:04,831 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 01:25:04,833 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 01:25:04,841 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 01:25:04,842 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 01:25:04,843 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 01:25:04,846 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 01:25:04,846 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 01:25:04,858 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 01:25:04,859 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 01:25:04,859 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 01:25:04,860 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 01:25:04,860 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 01:25:04,861 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 01:25:04,862 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 01:25:04,862 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 01:25:04,863 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 01:25:04,865 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 01:25:04,865 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 01:25:04,866 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 01:25:04,867 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 01:25:04,868 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 01:25:04,868 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 01:25:04,869 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 01:25:04,870 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 01:25:04,871 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.epf [2020-10-16 01:25:04,908 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 01:25:04,908 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 01:25:04,909 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 01:25:04,909 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 01:25:04,910 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 01:25:04,910 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 01:25:04,910 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 01:25:04,910 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 01:25:04,910 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 01:25:04,911 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 01:25:04,911 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 01:25:04,911 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 01:25:04,911 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 01:25:04,911 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 01:25:04,911 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 01:25:04,912 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 01:25:04,912 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 01:25:04,912 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 01:25:04,912 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 01:25:04,912 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 01:25:04,913 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 01:25:04,913 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:25:04,913 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 01:25:04,913 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 01:25:04,913 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 01:25:04,914 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 01:25:04,914 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 01:25:04,914 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 01:25:04,914 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 01:25:05,233 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 01:25:05,249 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 01:25:05,253 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 01:25:05,255 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 01:25:05,255 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 01:25:05,256 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038_pso.opt.i [2020-10-16 01:25:05,332 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b1b3ec4e/065288c1f7444101b963b2566a5826d6/FLAG6fc94bd22 [2020-10-16 01:25:05,901 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 01:25:05,902 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_pso.opt.i [2020-10-16 01:25:05,920 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b1b3ec4e/065288c1f7444101b963b2566a5826d6/FLAG6fc94bd22 [2020-10-16 01:25:06,180 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b1b3ec4e/065288c1f7444101b963b2566a5826d6 [2020-10-16 01:25:06,188 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 01:25:06,190 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 01:25:06,191 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 01:25:06,191 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 01:25:06,195 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 01:25:06,196 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:25:06" (1/1) ... [2020-10-16 01:25:06,199 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39ed214e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:25:06, skipping insertion in model container [2020-10-16 01:25:06,199 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:25:06" (1/1) ... [2020-10-16 01:25:06,207 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 01:25:06,281 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 01:25:06,765 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:25:06,780 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 01:25:06,844 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:25:06,931 INFO L208 MainTranslator]: Completed translation [2020-10-16 01:25:06,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:25:06 WrapperNode [2020-10-16 01:25:06,933 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 01:25:06,935 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 01:25:06,935 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 01:25:06,935 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 01:25:06,944 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:25:06" (1/1) ... [2020-10-16 01:25:06,992 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:25:06" (1/1) ... [2020-10-16 01:25:07,038 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 01:25:07,038 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 01:25:07,038 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 01:25:07,039 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 01:25:07,051 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:25:06" (1/1) ... [2020-10-16 01:25:07,051 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:25:06" (1/1) ... [2020-10-16 01:25:07,055 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:25:06" (1/1) ... [2020-10-16 01:25:07,056 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:25:06" (1/1) ... [2020-10-16 01:25:07,065 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:25:06" (1/1) ... [2020-10-16 01:25:07,069 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:25:06" (1/1) ... [2020-10-16 01:25:07,072 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:25:06" (1/1) ... [2020-10-16 01:25:07,077 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 01:25:07,078 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 01:25:07,079 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 01:25:07,080 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 01:25:07,081 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:25:06" (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 01:25:07,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 01:25:07,143 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 01:25:07,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 01:25:07,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 01:25:07,143 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 01:25:07,143 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 01:25:07,143 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 01:25:07,143 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 01:25:07,144 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 01:25:07,144 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 01:25:07,144 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 01:25:07,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 01:25:07,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 01:25:07,146 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 01:25:08,924 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 01:25:08,924 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 01:25:08,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:25:08 BoogieIcfgContainer [2020-10-16 01:25:08,927 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 01:25:08,928 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 01:25:08,928 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 01:25:08,932 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 01:25:08,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:25:06" (1/3) ... [2020-10-16 01:25:08,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10923cc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:25:08, skipping insertion in model container [2020-10-16 01:25:08,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:25:06" (2/3) ... [2020-10-16 01:25:08,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10923cc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:25:08, skipping insertion in model container [2020-10-16 01:25:08,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:25:08" (3/3) ... [2020-10-16 01:25:08,936 INFO L111 eAbstractionObserver]: Analyzing ICFG mix038_pso.opt.i [2020-10-16 01:25:08,948 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 01:25:08,956 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 01:25:08,957 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 01:25:08,987 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:08,987 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:08,988 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:08,988 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:08,989 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:08,989 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:08,989 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:08,989 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:08,990 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:08,990 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:08,990 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:08,990 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:08,990 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:08,990 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:08,991 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:08,991 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:08,991 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:08,991 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:08,991 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:08,992 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:08,992 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:08,992 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:08,992 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:08,992 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:08,993 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:08,993 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:08,993 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:08,993 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:08,993 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:08,993 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:08,994 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:08,994 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:08,994 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:08,994 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:08,994 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:08,994 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:08,994 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:08,995 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:08,995 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:08,995 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:08,995 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:08,995 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:08,995 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:08,996 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:08,996 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:08,996 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:08,996 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:08,996 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:08,998 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:08,999 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:08,999 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:08,999 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:09,000 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:09,000 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:09,000 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:09,000 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:09,000 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:09,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:09,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:09,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:09,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:09,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:09,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:09,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:09,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:09,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:09,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:09,007 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:09,007 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:09,007 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:09,007 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:09,010 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:09,010 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:09,010 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:09,010 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:09,010 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:09,011 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:09,011 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:09,011 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:09,011 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:09,011 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:09,012 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:09,012 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:09,012 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:09,012 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:09,012 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:09,013 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:09,013 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:09,013 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:09,013 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:09,013 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:09,014 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:09,014 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:09,014 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:09,014 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:09,014 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:09,015 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:09,015 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:09,020 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:09,021 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:09,021 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:09,021 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:09,021 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:09,022 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:09,022 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:09,022 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:09,022 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:09,022 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:09,023 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:09,023 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:25:09,041 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 01:25:09,065 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 01:25:09,065 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 01:25:09,066 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 01:25:09,066 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 01:25:09,066 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 01:25:09,066 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 01:25:09,066 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 01:25:09,067 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 01:25:09,083 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 103 places, 95 transitions, 205 flow [2020-10-16 01:25:09,137 INFO L129 PetriNetUnfolder]: 2/92 cut-off events. [2020-10-16 01:25:09,137 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:25:09,143 INFO L80 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 92 events. 2/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-16 01:25:09,143 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 95 transitions, 205 flow [2020-10-16 01:25:09,151 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 92 transitions, 193 flow [2020-10-16 01:25:09,153 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 01:25:09,157 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 193 flow [2020-10-16 01:25:09,161 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 193 flow [2020-10-16 01:25:09,162 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 193 flow [2020-10-16 01:25:09,188 INFO L129 PetriNetUnfolder]: 2/92 cut-off events. [2020-10-16 01:25:09,188 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:25:09,189 INFO L80 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 92 events. 2/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 62 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-16 01:25:09,192 INFO L117 LiptonReduction]: Number of co-enabled transitions 1600 [2020-10-16 01:25:09,584 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2020-10-16 01:25:09,688 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:25:09,689 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:25:09,693 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:25:09,694 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:25:09,752 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:25:09,753 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:25:09,756 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:25:09,757 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:25:09,760 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:25:09,760 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:25:09,762 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:25:09,763 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:25:09,765 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:25:09,766 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:25:09,768 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:25:09,768 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:25:09,770 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:25:09,771 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:25:09,836 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:25:09,836 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:25:09,837 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:25:09,838 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:25:09,840 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:25:09,841 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:25:09,843 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:25:09,843 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:25:09,862 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:25:09,863 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:25:09,864 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:25:09,865 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:25:09,867 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:25:09,867 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:25:09,869 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:25:09,870 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:25:10,205 WARN L193 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 01:25:10,406 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:25:10,407 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:25:10,409 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:25:10,410 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:25:10,411 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:25:10,411 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:25:10,412 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:25:10,413 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:25:10,415 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:25:10,416 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:25:10,417 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:25:10,417 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:25:10,418 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:25:10,419 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:25:10,457 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:25:10,458 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:25:10,460 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:25:10,461 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:25:10,762 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:25:10,763 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:25:10,764 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:25:10,764 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:25:10,766 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:25:10,766 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:25:10,833 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:25:10,833 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:25:10,834 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:25:10,835 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:25:10,837 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:25:10,838 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:25:10,840 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:25:10,841 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:25:10,858 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:25:10,858 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:25:10,859 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:25:10,860 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:25:10,862 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:25:10,863 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:25:10,865 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:25:10,865 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:25:11,018 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:25:11,019 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:25:11,020 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:25:11,020 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:25:11,022 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:25:11,023 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:25:11,025 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:25:11,026 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:25:11,041 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:25:11,042 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:25:11,043 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:25:11,044 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:25:11,046 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:25:11,046 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:25:11,048 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:25:11,049 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:25:11,349 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-16 01:25:11,472 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-16 01:25:11,580 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:25:11,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:25:11,581 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:25:11,581 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:25:11,582 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:25:11,583 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:25:11,806 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:25:11,807 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:25:11,807 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:25:11,808 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:25:11,809 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:25:11,810 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:25:11,812 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:25:11,812 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:25:11,827 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:25:11,828 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:25:11,828 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:25:11,829 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:25:11,831 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:25:11,831 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:25:11,832 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:25:11,833 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:25:11,869 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:25:11,870 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:25:11,871 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:25:11,871 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:25:11,872 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:25:11,873 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:25:11,874 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:25:11,874 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:25:11,887 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:25:11,888 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:25:11,888 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:25:11,889 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:25:11,890 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:25:11,891 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:25:11,892 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:25:11,892 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:25:12,546 WARN L193 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2020-10-16 01:25:12,669 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-16 01:25:12,675 INFO L132 LiptonReduction]: Checked pairs total: 3721 [2020-10-16 01:25:12,676 INFO L134 LiptonReduction]: Total number of compositions: 78 [2020-10-16 01:25:12,679 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3528 [2020-10-16 01:25:12,686 INFO L129 PetriNetUnfolder]: 0/11 cut-off events. [2020-10-16 01:25:12,687 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:25:12,687 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:25:12,688 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:25:12,688 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:25:12,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:25:12,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1202222320, now seen corresponding path program 1 times [2020-10-16 01:25:12,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:25:12,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186047002] [2020-10-16 01:25:12,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:25:12,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:25:12,937 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 01:25:12,938 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186047002] [2020-10-16 01:25:12,938 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:25:12,939 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:25:12,939 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369483967] [2020-10-16 01:25:12,950 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:25:12,950 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:25:12,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:25:12,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:25:12,969 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 173 [2020-10-16 01:25:12,972 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 57 flow. Second operand 3 states. [2020-10-16 01:25:12,972 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:25:12,972 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 173 [2020-10-16 01:25:12,974 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:25:13,032 INFO L129 PetriNetUnfolder]: 9/48 cut-off events. [2020-10-16 01:25:13,032 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:25:13,033 INFO L80 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 48 events. 9/48 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 125 event pairs, 1 based on Foata normal form. 5/50 useless extension candidates. Maximal degree in co-relation 70. Up to 17 conditions per place. [2020-10-16 01:25:13,035 INFO L132 encePairwiseOnDemand]: 169/173 looper letters, 5 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2020-10-16 01:25:13,035 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 24 transitions, 71 flow [2020-10-16 01:25:13,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:25:13,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:25:13,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 460 transitions. [2020-10-16 01:25:13,053 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8863198458574181 [2020-10-16 01:25:13,054 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 460 transitions. [2020-10-16 01:25:13,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 460 transitions. [2020-10-16 01:25:13,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:25:13,060 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 460 transitions. [2020-10-16 01:25:13,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:25:13,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:25:13,073 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:25:13,075 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 57 flow. Second operand 3 states and 460 transitions. [2020-10-16 01:25:13,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 24 transitions, 71 flow [2020-10-16 01:25:13,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 24 transitions, 68 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-16 01:25:13,081 INFO L241 Difference]: Finished difference. Result has 31 places, 22 transitions, 54 flow [2020-10-16 01:25:13,083 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=31, PETRI_TRANSITIONS=22} [2020-10-16 01:25:13,084 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2020-10-16 01:25:13,085 INFO L481 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 54 flow [2020-10-16 01:25:13,085 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:25:13,085 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:25:13,085 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:25:13,085 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 01:25:13,086 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:25:13,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:25:13,086 INFO L82 PathProgramCache]: Analyzing trace with hash -325876112, now seen corresponding path program 1 times [2020-10-16 01:25:13,086 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:25:13,087 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313691595] [2020-10-16 01:25:13,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:25:13,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:25:13,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:25:13,213 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313691595] [2020-10-16 01:25:13,214 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:25:13,214 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:25:13,214 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404554663] [2020-10-16 01:25:13,219 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:25:13,220 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:25:13,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:25:13,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:25:13,222 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 173 [2020-10-16 01:25:13,223 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 54 flow. Second operand 4 states. [2020-10-16 01:25:13,223 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:25:13,223 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 173 [2020-10-16 01:25:13,223 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:25:13,301 INFO L129 PetriNetUnfolder]: 13/55 cut-off events. [2020-10-16 01:25:13,302 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:25:13,302 INFO L80 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 55 events. 13/55 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 158 event pairs, 2 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 88. Up to 15 conditions per place. [2020-10-16 01:25:13,303 INFO L132 encePairwiseOnDemand]: 167/173 looper letters, 4 selfloop transitions, 3 changer transitions 8/31 dead transitions. [2020-10-16 01:25:13,303 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 31 transitions, 102 flow [2020-10-16 01:25:13,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:25:13,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:25:13,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 737 transitions. [2020-10-16 01:25:13,311 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8520231213872832 [2020-10-16 01:25:13,312 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 737 transitions. [2020-10-16 01:25:13,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 737 transitions. [2020-10-16 01:25:13,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:25:13,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 737 transitions. [2020-10-16 01:25:13,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:25:13,320 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:25:13,321 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:25:13,321 INFO L185 Difference]: Start difference. First operand has 31 places, 22 transitions, 54 flow. Second operand 5 states and 737 transitions. [2020-10-16 01:25:13,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 31 transitions, 102 flow [2020-10-16 01:25:13,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 31 transitions, 98 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:25:13,323 INFO L241 Difference]: Finished difference. Result has 36 places, 23 transitions, 75 flow [2020-10-16 01:25:13,323 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=75, PETRI_PLACES=36, PETRI_TRANSITIONS=23} [2020-10-16 01:25:13,324 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 3 predicate places. [2020-10-16 01:25:13,324 INFO L481 AbstractCegarLoop]: Abstraction has has 36 places, 23 transitions, 75 flow [2020-10-16 01:25:13,324 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:25:13,324 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:25:13,325 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:25:13,325 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 01:25:13,325 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:25:13,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:25:13,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1395356632, now seen corresponding path program 1 times [2020-10-16 01:25:13,326 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:25:13,326 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129255561] [2020-10-16 01:25:13,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:25:13,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:25:13,400 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 01:25:13,400 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129255561] [2020-10-16 01:25:13,401 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:25:13,401 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:25:13,401 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379058687] [2020-10-16 01:25:13,401 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:25:13,402 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:25:13,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:25:13,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:25:13,403 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 173 [2020-10-16 01:25:13,404 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 23 transitions, 75 flow. Second operand 4 states. [2020-10-16 01:25:13,404 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:25:13,404 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 173 [2020-10-16 01:25:13,404 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:25:13,434 INFO L129 PetriNetUnfolder]: 7/50 cut-off events. [2020-10-16 01:25:13,435 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2020-10-16 01:25:13,435 INFO L80 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 50 events. 7/50 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 143 event pairs, 3 based on Foata normal form. 5/51 useless extension candidates. Maximal degree in co-relation 96. Up to 17 conditions per place. [2020-10-16 01:25:13,436 INFO L132 encePairwiseOnDemand]: 169/173 looper letters, 2 selfloop transitions, 2 changer transitions 2/25 dead transitions. [2020-10-16 01:25:13,436 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 25 transitions, 93 flow [2020-10-16 01:25:13,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:25:13,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:25:13,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 728 transitions. [2020-10-16 01:25:13,439 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8416184971098266 [2020-10-16 01:25:13,439 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 728 transitions. [2020-10-16 01:25:13,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 728 transitions. [2020-10-16 01:25:13,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:25:13,440 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 728 transitions. [2020-10-16 01:25:13,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:25:13,443 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:25:13,444 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:25:13,444 INFO L185 Difference]: Start difference. First operand has 36 places, 23 transitions, 75 flow. Second operand 5 states and 728 transitions. [2020-10-16 01:25:13,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 25 transitions, 93 flow [2020-10-16 01:25:13,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 25 transitions, 88 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 01:25:13,446 INFO L241 Difference]: Finished difference. Result has 38 places, 23 transitions, 82 flow [2020-10-16 01:25:13,446 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=82, PETRI_PLACES=38, PETRI_TRANSITIONS=23} [2020-10-16 01:25:13,446 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 5 predicate places. [2020-10-16 01:25:13,446 INFO L481 AbstractCegarLoop]: Abstraction has has 38 places, 23 transitions, 82 flow [2020-10-16 01:25:13,446 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:25:13,447 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:25:13,447 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:25:13,447 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 01:25:13,447 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:25:13,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:25:13,448 INFO L82 PathProgramCache]: Analyzing trace with hash -909408231, now seen corresponding path program 1 times [2020-10-16 01:25:13,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:25:13,448 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088941606] [2020-10-16 01:25:13,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:25:13,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:25:13,520 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 01:25:13,520 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088941606] [2020-10-16 01:25:13,520 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:25:13,520 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:25:13,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179728200] [2020-10-16 01:25:13,521 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:25:13,521 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:25:13,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:25:13,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:25:13,523 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 173 [2020-10-16 01:25:13,523 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 23 transitions, 82 flow. Second operand 4 states. [2020-10-16 01:25:13,523 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:25:13,523 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 173 [2020-10-16 01:25:13,524 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:25:13,574 INFO L129 PetriNetUnfolder]: 50/132 cut-off events. [2020-10-16 01:25:13,574 INFO L130 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2020-10-16 01:25:13,575 INFO L80 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 132 events. 50/132 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 562 event pairs, 12 based on Foata normal form. 10/126 useless extension candidates. Maximal degree in co-relation 305. Up to 44 conditions per place. [2020-10-16 01:25:13,576 INFO L132 encePairwiseOnDemand]: 167/173 looper letters, 8 selfloop transitions, 5 changer transitions 0/30 dead transitions. [2020-10-16 01:25:13,577 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 30 transitions, 122 flow [2020-10-16 01:25:13,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:25:13,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:25:13,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 559 transitions. [2020-10-16 01:25:13,579 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8078034682080925 [2020-10-16 01:25:13,579 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 559 transitions. [2020-10-16 01:25:13,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 559 transitions. [2020-10-16 01:25:13,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:25:13,580 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 559 transitions. [2020-10-16 01:25:13,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:25:13,583 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:25:13,583 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:25:13,583 INFO L185 Difference]: Start difference. First operand has 38 places, 23 transitions, 82 flow. Second operand 4 states and 559 transitions. [2020-10-16 01:25:13,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 30 transitions, 122 flow [2020-10-16 01:25:13,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 30 transitions, 114 flow, removed 2 selfloop flow, removed 4 redundant places. [2020-10-16 01:25:13,586 INFO L241 Difference]: Finished difference. Result has 37 places, 27 transitions, 112 flow [2020-10-16 01:25:13,586 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=37, PETRI_TRANSITIONS=27} [2020-10-16 01:25:13,587 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 4 predicate places. [2020-10-16 01:25:13,587 INFO L481 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 112 flow [2020-10-16 01:25:13,587 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:25:13,587 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:25:13,587 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:25:13,587 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 01:25:13,587 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:25:13,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:25:13,588 INFO L82 PathProgramCache]: Analyzing trace with hash -956854728, now seen corresponding path program 1 times [2020-10-16 01:25:13,588 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:25:13,588 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731288690] [2020-10-16 01:25:13,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:25:13,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:25:13,691 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 01:25:13,692 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731288690] [2020-10-16 01:25:13,692 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:25:13,692 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:25:13,692 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743975162] [2020-10-16 01:25:13,693 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:25:13,697 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:25:13,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:25:13,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:25:13,698 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 173 [2020-10-16 01:25:13,699 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 27 transitions, 112 flow. Second operand 4 states. [2020-10-16 01:25:13,699 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:25:13,699 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 173 [2020-10-16 01:25:13,699 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:25:13,747 INFO L129 PetriNetUnfolder]: 47/157 cut-off events. [2020-10-16 01:25:13,748 INFO L130 PetriNetUnfolder]: For 85/111 co-relation queries the response was YES. [2020-10-16 01:25:13,749 INFO L80 FinitePrefix]: Finished finitePrefix Result has 416 conditions, 157 events. 47/157 cut-off events. For 85/111 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 822 event pairs, 17 based on Foata normal form. 12/150 useless extension candidates. Maximal degree in co-relation 401. Up to 93 conditions per place. [2020-10-16 01:25:13,750 INFO L132 encePairwiseOnDemand]: 169/173 looper letters, 5 selfloop transitions, 5 changer transitions 1/30 dead transitions. [2020-10-16 01:25:13,750 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 30 transitions, 148 flow [2020-10-16 01:25:13,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:25:13,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:25:13,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 731 transitions. [2020-10-16 01:25:13,753 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8450867052023121 [2020-10-16 01:25:13,753 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 731 transitions. [2020-10-16 01:25:13,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 731 transitions. [2020-10-16 01:25:13,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:25:13,754 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 731 transitions. [2020-10-16 01:25:13,756 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:25:13,757 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:25:13,758 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:25:13,758 INFO L185 Difference]: Start difference. First operand has 37 places, 27 transitions, 112 flow. Second operand 5 states and 731 transitions. [2020-10-16 01:25:13,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 30 transitions, 148 flow [2020-10-16 01:25:13,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 30 transitions, 142 flow, removed 2 selfloop flow, removed 1 redundant places. [2020-10-16 01:25:13,760 INFO L241 Difference]: Finished difference. Result has 43 places, 28 transitions, 137 flow [2020-10-16 01:25:13,760 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=137, PETRI_PLACES=43, PETRI_TRANSITIONS=28} [2020-10-16 01:25:13,761 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 10 predicate places. [2020-10-16 01:25:13,761 INFO L481 AbstractCegarLoop]: Abstraction has has 43 places, 28 transitions, 137 flow [2020-10-16 01:25:13,761 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:25:13,761 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:25:13,761 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:25:13,761 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 01:25:13,762 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:25:13,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:25:13,762 INFO L82 PathProgramCache]: Analyzing trace with hash -2013846060, now seen corresponding path program 1 times [2020-10-16 01:25:13,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:25:13,762 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713429699] [2020-10-16 01:25:13,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:25:13,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:25:13,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:25:13,861 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713429699] [2020-10-16 01:25:13,861 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:25:13,861 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:25:13,861 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608357945] [2020-10-16 01:25:13,862 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:25:13,862 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:25:13,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:25:13,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:25:13,864 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 173 [2020-10-16 01:25:13,864 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 28 transitions, 137 flow. Second operand 5 states. [2020-10-16 01:25:13,864 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:25:13,864 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 173 [2020-10-16 01:25:13,865 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:25:13,925 INFO L129 PetriNetUnfolder]: 33/113 cut-off events. [2020-10-16 01:25:13,925 INFO L130 PetriNetUnfolder]: For 149/228 co-relation queries the response was YES. [2020-10-16 01:25:13,926 INFO L80 FinitePrefix]: Finished finitePrefix Result has 370 conditions, 113 events. 33/113 cut-off events. For 149/228 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 481 event pairs, 1 based on Foata normal form. 19/122 useless extension candidates. Maximal degree in co-relation 352. Up to 64 conditions per place. [2020-10-16 01:25:13,927 INFO L132 encePairwiseOnDemand]: 167/173 looper letters, 7 selfloop transitions, 8 changer transitions 3/35 dead transitions. [2020-10-16 01:25:13,927 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 35 transitions, 197 flow [2020-10-16 01:25:13,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:25:13,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:25:13,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 698 transitions. [2020-10-16 01:25:13,930 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8069364161849711 [2020-10-16 01:25:13,930 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 698 transitions. [2020-10-16 01:25:13,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 698 transitions. [2020-10-16 01:25:13,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:25:13,931 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 698 transitions. [2020-10-16 01:25:13,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:25:13,935 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:25:13,935 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:25:13,935 INFO L185 Difference]: Start difference. First operand has 43 places, 28 transitions, 137 flow. Second operand 5 states and 698 transitions. [2020-10-16 01:25:13,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 35 transitions, 197 flow [2020-10-16 01:25:13,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 35 transitions, 181 flow, removed 4 selfloop flow, removed 2 redundant places. [2020-10-16 01:25:13,938 INFO L241 Difference]: Finished difference. Result has 47 places, 29 transitions, 156 flow [2020-10-16 01:25:13,938 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=156, PETRI_PLACES=47, PETRI_TRANSITIONS=29} [2020-10-16 01:25:13,939 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 14 predicate places. [2020-10-16 01:25:13,939 INFO L481 AbstractCegarLoop]: Abstraction has has 47 places, 29 transitions, 156 flow [2020-10-16 01:25:13,939 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:25:13,939 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:25:13,939 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:25:13,939 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 01:25:13,940 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:25:13,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:25:13,940 INFO L82 PathProgramCache]: Analyzing trace with hash -302441699, now seen corresponding path program 1 times [2020-10-16 01:25:13,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:25:13,941 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406953867] [2020-10-16 01:25:13,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:25:13,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:25:14,033 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 01:25:14,033 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406953867] [2020-10-16 01:25:14,033 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:25:14,034 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:25:14,034 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168211723] [2020-10-16 01:25:14,035 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:25:14,035 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:25:14,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:25:14,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:25:14,038 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 173 [2020-10-16 01:25:14,039 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 29 transitions, 156 flow. Second operand 6 states. [2020-10-16 01:25:14,039 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:25:14,039 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 173 [2020-10-16 01:25:14,039 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:25:14,114 INFO L129 PetriNetUnfolder]: 14/58 cut-off events. [2020-10-16 01:25:14,114 INFO L130 PetriNetUnfolder]: For 130/232 co-relation queries the response was YES. [2020-10-16 01:25:14,114 INFO L80 FinitePrefix]: Finished finitePrefix Result has 230 conditions, 58 events. 14/58 cut-off events. For 130/232 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 145 event pairs, 0 based on Foata normal form. 18/70 useless extension candidates. Maximal degree in co-relation 214. Up to 32 conditions per place. [2020-10-16 01:25:14,115 INFO L132 encePairwiseOnDemand]: 167/173 looper letters, 1 selfloop transitions, 11 changer transitions 3/30 dead transitions. [2020-10-16 01:25:14,115 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 30 transitions, 188 flow [2020-10-16 01:25:14,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:25:14,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:25:14,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 831 transitions. [2020-10-16 01:25:14,119 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8005780346820809 [2020-10-16 01:25:14,119 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 831 transitions. [2020-10-16 01:25:14,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 831 transitions. [2020-10-16 01:25:14,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:25:14,120 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 831 transitions. [2020-10-16 01:25:14,122 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:25:14,124 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:25:14,124 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:25:14,125 INFO L185 Difference]: Start difference. First operand has 47 places, 29 transitions, 156 flow. Second operand 6 states and 831 transitions. [2020-10-16 01:25:14,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 30 transitions, 188 flow [2020-10-16 01:25:14,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 30 transitions, 149 flow, removed 10 selfloop flow, removed 8 redundant places. [2020-10-16 01:25:14,127 INFO L241 Difference]: Finished difference. Result has 44 places, 27 transitions, 146 flow [2020-10-16 01:25:14,127 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=146, PETRI_PLACES=44, PETRI_TRANSITIONS=27} [2020-10-16 01:25:14,128 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 11 predicate places. [2020-10-16 01:25:14,128 INFO L481 AbstractCegarLoop]: Abstraction has has 44 places, 27 transitions, 146 flow [2020-10-16 01:25:14,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:25:14,128 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:25:14,128 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:25:14,128 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 01:25:14,129 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:25:14,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:25:14,129 INFO L82 PathProgramCache]: Analyzing trace with hash -886618910, now seen corresponding path program 1 times [2020-10-16 01:25:14,129 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:25:14,129 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896788196] [2020-10-16 01:25:14,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:25:14,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:25:14,263 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 01:25:14,263 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896788196] [2020-10-16 01:25:14,264 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:25:14,264 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:25:14,264 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118504546] [2020-10-16 01:25:14,264 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 01:25:14,265 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:25:14,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 01:25:14,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-16 01:25:14,267 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 173 [2020-10-16 01:25:14,267 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 27 transitions, 146 flow. Second operand 7 states. [2020-10-16 01:25:14,268 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:25:14,268 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 173 [2020-10-16 01:25:14,268 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:25:14,417 INFO L129 PetriNetUnfolder]: 11/50 cut-off events. [2020-10-16 01:25:14,417 INFO L130 PetriNetUnfolder]: For 86/96 co-relation queries the response was YES. [2020-10-16 01:25:14,417 INFO L80 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 50 events. 11/50 cut-off events. For 86/96 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 92 event pairs, 0 based on Foata normal form. 1/49 useless extension candidates. Maximal degree in co-relation 156. Up to 21 conditions per place. [2020-10-16 01:25:14,418 INFO L132 encePairwiseOnDemand]: 166/173 looper letters, 4 selfloop transitions, 4 changer transitions 3/31 dead transitions. [2020-10-16 01:25:14,419 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 31 transitions, 186 flow [2020-10-16 01:25:14,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 01:25:14,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 01:25:14,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 948 transitions. [2020-10-16 01:25:14,423 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.684971098265896 [2020-10-16 01:25:14,423 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 948 transitions. [2020-10-16 01:25:14,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 948 transitions. [2020-10-16 01:25:14,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:25:14,424 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 948 transitions. [2020-10-16 01:25:14,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 01:25:14,429 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 01:25:14,429 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 01:25:14,429 INFO L185 Difference]: Start difference. First operand has 44 places, 27 transitions, 146 flow. Second operand 8 states and 948 transitions. [2020-10-16 01:25:14,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 31 transitions, 186 flow [2020-10-16 01:25:14,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 31 transitions, 110 flow, removed 16 selfloop flow, removed 12 redundant places. [2020-10-16 01:25:14,433 INFO L241 Difference]: Finished difference. Result has 42 places, 27 transitions, 96 flow [2020-10-16 01:25:14,433 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=96, PETRI_PLACES=42, PETRI_TRANSITIONS=27} [2020-10-16 01:25:14,433 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 9 predicate places. [2020-10-16 01:25:14,433 INFO L481 AbstractCegarLoop]: Abstraction has has 42 places, 27 transitions, 96 flow [2020-10-16 01:25:14,433 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 01:25:14,434 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:25:14,434 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:25:14,434 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 01:25:14,434 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:25:14,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:25:14,436 INFO L82 PathProgramCache]: Analyzing trace with hash 391437134, now seen corresponding path program 2 times [2020-10-16 01:25:14,436 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:25:14,437 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170156615] [2020-10-16 01:25:14,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:25:14,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:25:14,544 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 01:25:14,545 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170156615] [2020-10-16 01:25:14,545 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:25:14,545 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:25:14,545 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967046880] [2020-10-16 01:25:14,546 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:25:14,546 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:25:14,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:25:14,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:25:14,548 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 173 [2020-10-16 01:25:14,548 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 27 transitions, 96 flow. Second operand 5 states. [2020-10-16 01:25:14,548 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:25:14,549 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 173 [2020-10-16 01:25:14,549 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:25:14,586 INFO L129 PetriNetUnfolder]: 12/59 cut-off events. [2020-10-16 01:25:14,586 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2020-10-16 01:25:14,587 INFO L80 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 59 events. 12/59 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 1/57 useless extension candidates. Maximal degree in co-relation 117. Up to 16 conditions per place. [2020-10-16 01:25:14,587 INFO L132 encePairwiseOnDemand]: 169/173 looper letters, 4 selfloop transitions, 1 changer transitions 2/29 dead transitions. [2020-10-16 01:25:14,587 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 29 transitions, 116 flow [2020-10-16 01:25:14,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:25:14,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:25:14,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 723 transitions. [2020-10-16 01:25:14,590 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8358381502890173 [2020-10-16 01:25:14,591 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 723 transitions. [2020-10-16 01:25:14,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 723 transitions. [2020-10-16 01:25:14,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:25:14,592 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 723 transitions. [2020-10-16 01:25:14,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:25:14,595 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:25:14,595 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:25:14,595 INFO L185 Difference]: Start difference. First operand has 42 places, 27 transitions, 96 flow. Second operand 5 states and 723 transitions. [2020-10-16 01:25:14,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 29 transitions, 116 flow [2020-10-16 01:25:14,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 29 transitions, 102 flow, removed 3 selfloop flow, removed 6 redundant places. [2020-10-16 01:25:14,597 INFO L241 Difference]: Finished difference. Result has 40 places, 27 transitions, 93 flow [2020-10-16 01:25:14,597 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=93, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2020-10-16 01:25:14,598 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 7 predicate places. [2020-10-16 01:25:14,598 INFO L481 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 93 flow [2020-10-16 01:25:14,598 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:25:14,598 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:25:14,598 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:25:14,598 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 01:25:14,599 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:25:14,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:25:14,599 INFO L82 PathProgramCache]: Analyzing trace with hash -5323636, now seen corresponding path program 3 times [2020-10-16 01:25:14,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:25:14,600 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113584557] [2020-10-16 01:25:14,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:25:14,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:25:14,648 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:25:14,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:25:14,702 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:25:14,767 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 01:25:14,768 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 01:25:14,768 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 01:25:14,814 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 01:25:14,815 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:25:14,817 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 01:25:14,818 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:25:14,818 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 01:25:14,819 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:25:14,819 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 01:25:14,819 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:25:14,819 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 01:25:14,820 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:25:14,820 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 01:25:14,820 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:25:14,820 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 01:25:14,821 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:25:14,821 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 01:25:14,821 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:25:14,821 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 01:25:14,821 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:25:14,822 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 01:25:14,823 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:25:14,823 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 01:25:14,823 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:25:14,824 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 01:25:14,824 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:25:14,824 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 01:25:14,824 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:25:14,825 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 01:25:14,825 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:25:14,825 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 01:25:14,825 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:25:14,825 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 01:25:14,825 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:25:14,826 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 01:25:14,826 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:25:14,826 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 01:25:14,826 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:25:14,832 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 01:25:14,832 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:25:14,833 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 01:25:14,833 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:25:14,833 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 01:25:14,833 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:25:14,834 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 01:25:14,834 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:25:14,834 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 01:25:14,835 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:25:14,835 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 01:25:14,835 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:25:14,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:25:14 BasicIcfg [2020-10-16 01:25:14,952 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 01:25:14,954 INFO L168 Benchmark]: Toolchain (without parser) took 8764.33 ms. Allocated memory was 255.9 MB in the beginning and 486.0 MB in the end (delta: 230.2 MB). Free memory was 209.9 MB in the beginning and 248.6 MB in the end (delta: -38.7 MB). Peak memory consumption was 191.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:25:14,955 INFO L168 Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 255.9 MB. Free memory was 231.4 MB in the beginning and 230.5 MB in the end (delta: 838.9 kB). Peak memory consumption was 838.9 kB. Max. memory is 14.2 GB. [2020-10-16 01:25:14,957 INFO L168 Benchmark]: CACSL2BoogieTranslator took 742.54 ms. Allocated memory was 255.9 MB in the beginning and 324.5 MB in the end (delta: 68.7 MB). Free memory was 209.0 MB in the beginning and 276.4 MB in the end (delta: -67.4 MB). Peak memory consumption was 30.0 MB. Max. memory is 14.2 GB. [2020-10-16 01:25:14,957 INFO L168 Benchmark]: Boogie Procedure Inliner took 103.46 ms. Allocated memory is still 324.5 MB. Free memory was 276.4 MB in the beginning and 273.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:25:14,958 INFO L168 Benchmark]: Boogie Preprocessor took 39.18 ms. Allocated memory is still 324.5 MB. Free memory was 273.9 MB in the beginning and 272.2 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 14.2 GB. [2020-10-16 01:25:14,961 INFO L168 Benchmark]: RCFGBuilder took 1849.12 ms. Allocated memory was 324.5 MB in the beginning and 364.9 MB in the end (delta: 40.4 MB). Free memory was 271.4 MB in the beginning and 246.5 MB in the end (delta: 24.8 MB). Peak memory consumption was 100.8 MB. Max. memory is 14.2 GB. [2020-10-16 01:25:14,962 INFO L168 Benchmark]: TraceAbstraction took 6023.79 ms. Allocated memory was 364.9 MB in the beginning and 486.0 MB in the end (delta: 121.1 MB). Free memory was 246.5 MB in the beginning and 248.6 MB in the end (delta: -2.0 MB). Peak memory consumption was 119.1 MB. Max. memory is 14.2 GB. [2020-10-16 01:25:14,972 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.45 ms. Allocated memory is still 255.9 MB. Free memory was 231.4 MB in the beginning and 230.5 MB in the end (delta: 838.9 kB). Peak memory consumption was 838.9 kB. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 742.54 ms. Allocated memory was 255.9 MB in the beginning and 324.5 MB in the end (delta: 68.7 MB). Free memory was 209.0 MB in the beginning and 276.4 MB in the end (delta: -67.4 MB). Peak memory consumption was 30.0 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 103.46 ms. Allocated memory is still 324.5 MB. Free memory was 276.4 MB in the beginning and 273.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 39.18 ms. Allocated memory is still 324.5 MB. Free memory was 273.9 MB in the beginning and 272.2 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 14.2 GB. * RCFGBuilder took 1849.12 ms. Allocated memory was 324.5 MB in the beginning and 364.9 MB in the end (delta: 40.4 MB). Free memory was 271.4 MB in the beginning and 246.5 MB in the end (delta: 24.8 MB). Peak memory consumption was 100.8 MB. Max. memory is 14.2 GB. * TraceAbstraction took 6023.79 ms. Allocated memory was 364.9 MB in the beginning and 486.0 MB in the end (delta: 121.1 MB). Free memory was 246.5 MB in the beginning and 248.6 MB in the end (delta: -2.0 MB). Peak memory consumption was 119.1 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1102 VarBasedMoverChecksPositive, 54 VarBasedMoverChecksNegative, 16 SemBasedMoverChecksPositive, 38 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.8s, 131 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 3.5s, 100 PlacesBefore, 33 PlacesAfterwards, 92 TransitionsBefore, 24 TransitionsAfterwards, 1600 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 78 TotalNumberOfCompositions, 3721 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p1_EAX = 0; [L702] 0 int __unbuffered_p2_EAX = 0; [L704] 0 int __unbuffered_p2_EBX = 0; [L706] 0 int a = 0; [L707] 0 _Bool main$tmp_guard0; [L708] 0 _Bool main$tmp_guard1; [L710] 0 int x = 0; [L712] 0 int y = 0; [L713] 0 _Bool y$flush_delayed; [L714] 0 int y$mem_tmp; [L715] 0 _Bool y$r_buff0_thd0; [L716] 0 _Bool y$r_buff0_thd1; [L717] 0 _Bool y$r_buff0_thd2; [L718] 0 _Bool y$r_buff0_thd3; [L719] 0 _Bool y$r_buff1_thd0; [L720] 0 _Bool y$r_buff1_thd1; [L721] 0 _Bool y$r_buff1_thd2; [L722] 0 _Bool y$r_buff1_thd3; [L723] 0 _Bool y$read_delayed; [L724] 0 int *y$read_delayed_var; [L725] 0 int y$w_buff0; [L726] 0 _Bool y$w_buff0_used; [L727] 0 int y$w_buff1; [L728] 0 _Bool y$w_buff1_used; [L730] 0 int z = 0; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L822] 0 pthread_t t1010; [L823] FCALL, FORK 0 pthread_create(&t1010, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L824] 0 pthread_t t1011; [L825] FCALL, FORK 0 pthread_create(&t1011, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L826] 0 pthread_t t1012; [L827] FCALL, FORK 0 pthread_create(&t1012, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L779] 3 y$w_buff1 = y$w_buff0 [L780] 3 y$w_buff0 = 1 [L781] 3 y$w_buff1_used = y$w_buff0_used [L782] 3 y$w_buff0_used = (_Bool)1 [L7] COND FALSE 3 !(!expression) [L784] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L785] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L786] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L787] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L788] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L791] 3 z = 1 [L794] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L736] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L751] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 2 y$flush_delayed = weak$$choice2 [L757] 2 y$mem_tmp = y [L758] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L758] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L759] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L759] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L760] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L760] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1) [L760] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L760] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L761] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L761] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L762] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L762] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0 [L762] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L762] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L762] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L763] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L763] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L764] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L764] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L764] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L764] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L765] 2 __unbuffered_p1_EAX = y [L766] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L766] 2 y = y$flush_delayed ? y$mem_tmp : y [L767] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L800] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L801] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L802] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L803] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L804] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L744] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L746] 1 return 0; [L772] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L774] 2 return 0; [L807] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L809] 3 return 0; [L829] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L3] COND FALSE 0 !(!cond) [L833] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L833] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L833] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L833] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L834] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L834] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L835] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L835] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L836] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L837] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L837] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L840] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 94 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: 5.7s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.6s, HoareTripleCheckerStatistics: 38 SDtfs, 26 SDslu, 36 SDs, 0 SdLazy, 128 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156occurred in iteration=6, 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.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 152 NumberOfCodeBlocks, 152 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 122 ConstructedInterpolants, 0 QuantifiedInterpolants, 6267 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...