/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe-SemanticLooper.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix030_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 04:47:26,707 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 04:47:26,710 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 04:47:26,752 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 04:47:26,752 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 04:47:26,760 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 04:47:26,761 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 04:47:26,764 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 04:47:26,767 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 04:47:26,768 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 04:47:26,769 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 04:47:26,772 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 04:47:26,772 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 04:47:26,776 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 04:47:26,778 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 04:47:26,779 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 04:47:26,780 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 04:47:26,783 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 04:47:26,784 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 04:47:26,790 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 04:47:26,792 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 04:47:26,793 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 04:47:26,795 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 04:47:26,795 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 04:47:26,808 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 04:47:26,809 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 04:47:26,809 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 04:47:26,812 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 04:47:26,812 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 04:47:26,815 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 04:47:26,815 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 04:47:26,816 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 04:47:26,817 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 04:47:26,820 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 04:47:26,821 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 04:47:26,821 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 04:47:26,822 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 04:47:26,822 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 04:47:26,823 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 04:47:26,826 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 04:47:26,826 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 04:47:26,827 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe-SemanticLooper.epf [2020-10-16 04:47:26,870 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 04:47:26,870 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 04:47:26,875 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 04:47:26,875 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 04:47:26,875 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 04:47:26,875 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 04:47:26,875 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 04:47:26,876 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 04:47:26,876 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 04:47:26,876 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 04:47:26,876 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 04:47:26,876 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 04:47:26,876 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 04:47:26,877 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 04:47:26,877 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 04:47:26,877 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 04:47:26,877 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 04:47:26,877 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 04:47:26,877 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 04:47:26,878 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 04:47:26,878 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 04:47:26,879 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 04:47:26,879 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 04:47:26,880 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 04:47:26,880 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 04:47:26,880 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 04:47:26,880 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 04:47:26,880 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 04:47:26,880 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 04:47:27,182 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 04:47:27,202 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 04:47:27,205 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 04:47:27,207 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 04:47:27,207 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 04:47:27,208 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix030_tso.opt.i [2020-10-16 04:47:27,269 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d85a4f26c/7f32861158b04049933dc76972f0e12d/FLAGd09e6fd74 [2020-10-16 04:47:27,858 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 04:47:27,858 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix030_tso.opt.i [2020-10-16 04:47:27,874 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d85a4f26c/7f32861158b04049933dc76972f0e12d/FLAGd09e6fd74 [2020-10-16 04:47:28,168 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d85a4f26c/7f32861158b04049933dc76972f0e12d [2020-10-16 04:47:28,178 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 04:47:28,180 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 04:47:28,181 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 04:47:28,181 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 04:47:28,185 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 04:47:28,186 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:47:28" (1/1) ... [2020-10-16 04:47:28,190 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38db1d55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:47:28, skipping insertion in model container [2020-10-16 04:47:28,190 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:47:28" (1/1) ... [2020-10-16 04:47:28,198 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 04:47:28,243 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 04:47:28,797 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:47:28,812 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 04:47:28,901 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:47:28,981 INFO L208 MainTranslator]: Completed translation [2020-10-16 04:47:28,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:47:28 WrapperNode [2020-10-16 04:47:28,981 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 04:47:28,982 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 04:47:28,982 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 04:47:28,983 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 04:47:28,991 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:47:28" (1/1) ... [2020-10-16 04:47:29,015 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:47:28" (1/1) ... [2020-10-16 04:47:29,054 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 04:47:29,054 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 04:47:29,054 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 04:47:29,054 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 04:47:29,065 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:47:28" (1/1) ... [2020-10-16 04:47:29,065 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:47:28" (1/1) ... [2020-10-16 04:47:29,073 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:47:28" (1/1) ... [2020-10-16 04:47:29,073 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:47:28" (1/1) ... [2020-10-16 04:47:29,086 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:47:28" (1/1) ... [2020-10-16 04:47:29,091 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:47:28" (1/1) ... [2020-10-16 04:47:29,095 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:47:28" (1/1) ... [2020-10-16 04:47:29,101 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 04:47:29,102 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 04:47:29,102 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 04:47:29,102 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 04:47:29,103 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:47:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 04:47:29,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 04:47:29,204 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 04:47:29,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 04:47:29,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 04:47:29,205 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 04:47:29,206 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 04:47:29,207 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 04:47:29,207 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 04:47:29,208 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 04:47:29,208 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 04:47:29,211 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-16 04:47:29,211 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-16 04:47:29,212 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 04:47:29,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 04:47:29,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 04:47:29,214 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 04:47:31,877 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 04:47:31,877 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 04:47:31,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:47:31 BoogieIcfgContainer [2020-10-16 04:47:31,879 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 04:47:31,881 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 04:47:31,881 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 04:47:31,884 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 04:47:31,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 04:47:28" (1/3) ... [2020-10-16 04:47:31,885 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59602fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:47:31, skipping insertion in model container [2020-10-16 04:47:31,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:47:28" (2/3) ... [2020-10-16 04:47:31,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59602fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:47:31, skipping insertion in model container [2020-10-16 04:47:31,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:47:31" (3/3) ... [2020-10-16 04:47:31,888 INFO L111 eAbstractionObserver]: Analyzing ICFG mix030_tso.opt.i [2020-10-16 04:47:31,900 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 04:47:31,908 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 04:47:31,909 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 04:47:31,942 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,942 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,942 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,943 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,943 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,943 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,943 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,944 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,944 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,944 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,944 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,944 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,945 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,945 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,945 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,945 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,945 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,946 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,946 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,946 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,946 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,946 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,946 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,947 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,947 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,948 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,948 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,948 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,948 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,949 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,949 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,949 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,949 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,950 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,950 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,950 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,950 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,950 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,950 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,951 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,951 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,951 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,951 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,951 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,951 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,952 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,952 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,952 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,952 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,952 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,952 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,953 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,953 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,953 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,953 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,953 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,953 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,954 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,954 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,954 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,954 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,954 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,954 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,955 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,955 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,955 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,955 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,955 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,955 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,956 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,956 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,958 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,958 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,958 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,958 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,958 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,959 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,959 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,959 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,960 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,963 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,964 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,964 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,964 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,964 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,965 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,965 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,965 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,965 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,965 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,966 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,966 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,966 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,966 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,966 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,967 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,967 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,967 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,967 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,967 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,968 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,968 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,968 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,968 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,968 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,969 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,969 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,969 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,969 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,969 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,970 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,970 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,970 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,970 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,970 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,975 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,975 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,975 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,975 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,977 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,977 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,977 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,978 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,979 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,980 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,980 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,980 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,980 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,980 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,980 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,981 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,981 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:31,981 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:32,000 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-16 04:47:32,023 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 04:47:32,023 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 04:47:32,023 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 04:47:32,023 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 04:47:32,023 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 04:47:32,023 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 04:47:32,024 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 04:47:32,024 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 04:47:32,038 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 120 places, 109 transitions, 238 flow [2020-10-16 04:47:32,088 INFO L129 PetriNetUnfolder]: 2/105 cut-off events. [2020-10-16 04:47:32,088 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:47:32,093 INFO L80 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2020-10-16 04:47:32,094 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 109 transitions, 238 flow [2020-10-16 04:47:32,100 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 116 places, 105 transitions, 222 flow [2020-10-16 04:47:32,103 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 04:47:32,106 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 105 transitions, 222 flow [2020-10-16 04:47:32,109 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 105 transitions, 222 flow [2020-10-16 04:47:32,109 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 116 places, 105 transitions, 222 flow [2020-10-16 04:47:32,135 INFO L129 PetriNetUnfolder]: 2/105 cut-off events. [2020-10-16 04:47:32,135 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:47:32,136 INFO L80 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 82 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2020-10-16 04:47:32,140 INFO L117 LiptonReduction]: Number of co-enabled transitions 2446 [2020-10-16 04:47:32,534 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-10-16 04:47:32,904 WARN L193 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 04:47:33,053 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:47:33,054 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:33,057 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:47:33,057 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:33,091 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:47:33,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:33,094 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:47:33,095 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:34,200 WARN L193 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2020-10-16 04:47:34,218 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 2, 1] term [2020-10-16 04:47:34,219 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:34,220 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:47:34,220 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:35,149 WARN L193 SmtUtils]: Spent 915.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 128 [2020-10-16 04:47:35,268 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:35,269 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:35,275 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:47:35,278 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:47:35,280 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:47:35,282 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:47:35,286 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:47:35,287 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:47:35,290 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:47:35,291 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:35,295 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 04:47:35,295 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:35,303 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 04:47:35,306 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:35,369 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:47:35,370 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:47:35,373 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:47:35,373 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:35,461 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:35,462 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:35,462 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:35,463 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:35,465 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:35,465 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:35,467 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:35,468 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:35,490 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:35,491 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:35,491 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:35,492 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:35,494 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:35,494 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:35,497 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:35,497 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:35,524 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:35,525 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:35,525 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:35,526 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:35,527 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:35,528 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:35,530 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:35,530 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:35,550 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:35,551 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:35,551 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:35,552 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:35,553 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:35,554 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:35,556 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:35,556 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:35,655 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:35,655 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:35,656 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:35,657 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:35,658 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:35,659 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:35,661 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:35,661 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:35,677 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:35,678 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:35,678 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:35,679 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:35,681 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:35,681 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:35,683 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:35,683 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:35,767 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:47:35,767 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:36,027 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:47:36,027 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:47:36,029 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:47:36,030 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:36,059 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:36,059 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:36,063 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:47:36,064 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:47:36,065 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:47:36,066 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:47:36,067 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:47:36,067 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:47:36,069 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:47:36,069 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:36,073 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 04:47:36,074 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:36,075 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 04:47:36,075 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:36,459 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:36,460 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:36,463 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:47:36,464 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:47:36,465 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:47:36,466 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:47:36,467 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:47:36,467 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:47:36,469 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:47:36,469 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:36,470 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 04:47:36,471 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:36,472 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 04:47:36,472 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:36,506 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:47:36,507 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:47:36,509 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:47:36,510 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:36,701 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-16 04:47:36,822 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-16 04:47:37,124 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:47:37,125 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:47:37,127 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:47:37,127 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:37,155 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:37,156 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:37,157 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:47:37,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:47:37,159 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:47:37,159 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:47:37,160 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:47:37,161 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:47:37,162 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:47:37,163 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:37,164 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 04:47:37,165 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:37,166 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 04:47:37,167 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:37,938 WARN L193 SmtUtils]: Spent 659.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 110 [2020-10-16 04:47:38,249 WARN L193 SmtUtils]: Spent 309.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-10-16 04:47:38,273 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:38,274 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:38,274 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:38,275 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:38,276 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:38,277 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:38,279 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:38,280 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:38,292 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:38,293 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:38,293 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:38,294 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:38,296 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:38,296 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:38,298 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:38,298 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:38,317 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:38,318 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:38,318 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:38,320 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:38,322 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:38,323 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:38,325 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:38,325 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:38,344 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:38,344 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:38,345 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:38,346 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:38,347 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:38,348 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:38,350 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:38,350 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:38,376 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:38,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:38,377 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:38,377 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:38,379 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:38,380 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:38,382 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:38,382 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:38,394 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:38,395 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:38,396 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:38,396 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:38,398 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:38,398 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:38,400 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:38,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:38,450 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:38,450 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:38,455 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:47:38,455 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:47:38,457 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:47:38,458 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:47:38,459 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:47:38,459 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:47:38,461 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:47:38,461 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:38,462 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 04:47:38,463 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:38,505 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 04:47:38,505 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:38,534 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:47:38,535 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:47:38,537 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:47:38,537 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:38,566 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:38,566 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:38,567 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:38,567 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:38,569 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:38,569 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:38,570 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:38,570 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:38,584 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:38,585 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:38,585 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:38,586 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:38,587 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:38,587 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:38,589 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:38,589 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:39,570 WARN L193 SmtUtils]: Spent 774.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 132 [2020-10-16 04:47:39,926 WARN L193 SmtUtils]: Spent 353.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2020-10-16 04:47:41,190 WARN L193 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 137 DAG size of output: 136 [2020-10-16 04:47:41,599 WARN L193 SmtUtils]: Spent 405.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-10-16 04:47:41,864 WARN L193 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2020-10-16 04:47:41,984 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-16 04:47:42,075 INFO L132 LiptonReduction]: Checked pairs total: 6967 [2020-10-16 04:47:42,075 INFO L134 LiptonReduction]: Total number of compositions: 92 [2020-10-16 04:47:42,080 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9979 [2020-10-16 04:47:42,088 INFO L129 PetriNetUnfolder]: 0/17 cut-off events. [2020-10-16 04:47:42,088 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:47:42,088 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:47:42,089 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:47:42,089 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:47:42,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:47:42,095 INFO L82 PathProgramCache]: Analyzing trace with hash -137982902, now seen corresponding path program 1 times [2020-10-16 04:47:42,104 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:47:42,105 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285883771] [2020-10-16 04:47:42,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:47:42,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:47:42,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:47:42,350 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285883771] [2020-10-16 04:47:42,351 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:47:42,351 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:47:42,352 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275358102] [2020-10-16 04:47:42,362 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:47:42,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:47:42,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:47:42,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:47:42,383 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 201 [2020-10-16 04:47:42,388 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states. [2020-10-16 04:47:42,388 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:47:42,388 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 201 [2020-10-16 04:47:42,390 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:47:42,522 INFO L129 PetriNetUnfolder]: 33/99 cut-off events. [2020-10-16 04:47:42,522 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:47:42,523 INFO L80 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 99 events. 33/99 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 369 event pairs, 3 based on Foata normal form. 8/99 useless extension candidates. Maximal degree in co-relation 167. Up to 55 conditions per place. [2020-10-16 04:47:42,525 INFO L132 encePairwiseOnDemand]: 197/201 looper letters, 8 selfloop transitions, 2 changer transitions 2/31 dead transitions. [2020-10-16 04:47:42,526 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 31 transitions, 98 flow [2020-10-16 04:47:42,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:47:42,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:47:42,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 516 transitions. [2020-10-16 04:47:42,546 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8557213930348259 [2020-10-16 04:47:42,546 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 516 transitions. [2020-10-16 04:47:42,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 516 transitions. [2020-10-16 04:47:42,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:47:42,553 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 516 transitions. [2020-10-16 04:47:42,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:47:42,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:47:42,566 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:47:42,568 INFO L185 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states and 516 transitions. [2020-10-16 04:47:42,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 31 transitions, 98 flow [2020-10-16 04:47:42,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 31 transitions, 94 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-16 04:47:42,575 INFO L241 Difference]: Finished difference. Result has 38 places, 26 transitions, 64 flow [2020-10-16 04:47:42,578 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2020-10-16 04:47:42,579 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2020-10-16 04:47:42,579 INFO L481 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 64 flow [2020-10-16 04:47:42,579 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:47:42,579 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:47:42,579 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:47:42,580 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 04:47:42,580 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:47:42,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:47:42,580 INFO L82 PathProgramCache]: Analyzing trace with hash 542442462, now seen corresponding path program 1 times [2020-10-16 04:47:42,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:47:42,581 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007913611] [2020-10-16 04:47:42,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:47:42,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:47:42,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:47:42,717 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007913611] [2020-10-16 04:47:42,717 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:47:42,717 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:47:42,717 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166669501] [2020-10-16 04:47:42,720 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:47:42,720 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:47:42,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:47:42,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:47:42,722 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 201 [2020-10-16 04:47:42,723 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 64 flow. Second operand 3 states. [2020-10-16 04:47:42,723 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:47:42,723 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 201 [2020-10-16 04:47:42,723 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:47:42,818 INFO L129 PetriNetUnfolder]: 112/232 cut-off events. [2020-10-16 04:47:42,818 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2020-10-16 04:47:42,820 INFO L80 FinitePrefix]: Finished finitePrefix Result has 444 conditions, 232 events. 112/232 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1022 event pairs, 47 based on Foata normal form. 1/229 useless extension candidates. Maximal degree in co-relation 435. Up to 182 conditions per place. [2020-10-16 04:47:42,822 INFO L132 encePairwiseOnDemand]: 196/201 looper letters, 9 selfloop transitions, 4 changer transitions 0/30 dead transitions. [2020-10-16 04:47:42,822 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 30 transitions, 100 flow [2020-10-16 04:47:42,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:47:42,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:47:42,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 476 transitions. [2020-10-16 04:47:42,826 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7893864013266998 [2020-10-16 04:47:42,826 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 476 transitions. [2020-10-16 04:47:42,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 476 transitions. [2020-10-16 04:47:42,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:47:42,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 476 transitions. [2020-10-16 04:47:42,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:47:42,830 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:47:42,830 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:47:42,830 INFO L185 Difference]: Start difference. First operand has 38 places, 26 transitions, 64 flow. Second operand 3 states and 476 transitions. [2020-10-16 04:47:42,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 30 transitions, 100 flow [2020-10-16 04:47:42,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 30 transitions, 94 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 04:47:42,832 INFO L241 Difference]: Finished difference. Result has 38 places, 29 transitions, 86 flow [2020-10-16 04:47:42,832 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2020-10-16 04:47:42,833 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2020-10-16 04:47:42,833 INFO L481 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 86 flow [2020-10-16 04:47:42,833 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:47:42,833 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:47:42,833 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:47:42,833 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 04:47:42,834 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:47:42,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:47:42,834 INFO L82 PathProgramCache]: Analyzing trace with hash -364152957, now seen corresponding path program 1 times [2020-10-16 04:47:42,834 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:47:42,834 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300604944] [2020-10-16 04:47:42,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:47:42,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:47:42,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:47:42,899 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300604944] [2020-10-16 04:47:42,900 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:47:42,900 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:47:42,900 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527014385] [2020-10-16 04:47:42,900 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:47:42,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:47:42,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:47:42,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:47:42,902 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 201 [2020-10-16 04:47:42,903 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 86 flow. Second operand 3 states. [2020-10-16 04:47:42,903 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:47:42,903 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 201 [2020-10-16 04:47:42,903 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:47:43,062 INFO L129 PetriNetUnfolder]: 353/661 cut-off events. [2020-10-16 04:47:43,062 INFO L130 PetriNetUnfolder]: For 93/99 co-relation queries the response was YES. [2020-10-16 04:47:43,066 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1355 conditions, 661 events. 353/661 cut-off events. For 93/99 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3639 event pairs, 207 based on Foata normal form. 2/634 useless extension candidates. Maximal degree in co-relation 1345. Up to 475 conditions per place. [2020-10-16 04:47:43,071 INFO L132 encePairwiseOnDemand]: 196/201 looper letters, 11 selfloop transitions, 5 changer transitions 0/35 dead transitions. [2020-10-16 04:47:43,071 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 35 transitions, 135 flow [2020-10-16 04:47:43,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:47:43,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:47:43,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 477 transitions. [2020-10-16 04:47:43,075 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7910447761194029 [2020-10-16 04:47:43,075 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 477 transitions. [2020-10-16 04:47:43,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 477 transitions. [2020-10-16 04:47:43,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:47:43,076 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 477 transitions. [2020-10-16 04:47:43,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:47:43,078 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:47:43,078 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:47:43,078 INFO L185 Difference]: Start difference. First operand has 38 places, 29 transitions, 86 flow. Second operand 3 states and 477 transitions. [2020-10-16 04:47:43,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 35 transitions, 135 flow [2020-10-16 04:47:43,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 35 transitions, 130 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 04:47:43,081 INFO L241 Difference]: Finished difference. Result has 40 places, 33 transitions, 119 flow [2020-10-16 04:47:43,081 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=119, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2020-10-16 04:47:43,081 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2020-10-16 04:47:43,081 INFO L481 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 119 flow [2020-10-16 04:47:43,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:47:43,082 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:47:43,082 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:47:43,082 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 04:47:43,082 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:47:43,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:47:43,082 INFO L82 PathProgramCache]: Analyzing trace with hash -363745214, now seen corresponding path program 1 times [2020-10-16 04:47:43,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:47:43,083 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819309425] [2020-10-16 04:47:43,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:47:43,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:47:43,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:47:43,160 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819309425] [2020-10-16 04:47:43,160 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:47:43,161 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 04:47:43,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983389858] [2020-10-16 04:47:43,164 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:47:43,165 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:47:43,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:47:43,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:47:43,167 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 201 [2020-10-16 04:47:43,168 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 119 flow. Second operand 4 states. [2020-10-16 04:47:43,168 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:47:43,168 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 201 [2020-10-16 04:47:43,168 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:47:43,345 INFO L129 PetriNetUnfolder]: 197/436 cut-off events. [2020-10-16 04:47:43,346 INFO L130 PetriNetUnfolder]: For 295/317 co-relation queries the response was YES. [2020-10-16 04:47:43,349 INFO L80 FinitePrefix]: Finished finitePrefix Result has 970 conditions, 436 events. 197/436 cut-off events. For 295/317 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2498 event pairs, 31 based on Foata normal form. 23/428 useless extension candidates. Maximal degree in co-relation 958. Up to 184 conditions per place. [2020-10-16 04:47:43,352 INFO L132 encePairwiseOnDemand]: 197/201 looper letters, 8 selfloop transitions, 6 changer transitions 0/37 dead transitions. [2020-10-16 04:47:43,415 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 37 transitions, 155 flow [2020-10-16 04:47:43,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 04:47:43,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 04:47:43,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 641 transitions. [2020-10-16 04:47:43,419 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7972636815920398 [2020-10-16 04:47:43,420 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 641 transitions. [2020-10-16 04:47:43,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 641 transitions. [2020-10-16 04:47:43,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:47:43,420 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 641 transitions. [2020-10-16 04:47:43,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 04:47:43,424 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 04:47:43,424 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 04:47:43,424 INFO L185 Difference]: Start difference. First operand has 40 places, 33 transitions, 119 flow. Second operand 4 states and 641 transitions. [2020-10-16 04:47:43,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 37 transitions, 155 flow [2020-10-16 04:47:43,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 37 transitions, 150 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 04:47:43,428 INFO L241 Difference]: Finished difference. Result has 44 places, 33 transitions, 140 flow [2020-10-16 04:47:43,428 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2020-10-16 04:47:43,428 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 3 predicate places. [2020-10-16 04:47:43,429 INFO L481 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 140 flow [2020-10-16 04:47:43,429 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:47:43,429 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:47:43,429 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:47:43,429 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 04:47:43,429 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:47:43,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:47:43,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1608798640, now seen corresponding path program 1 times [2020-10-16 04:47:43,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:47:43,430 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972603808] [2020-10-16 04:47:43,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:47:43,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:47:43,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:47:43,546 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972603808] [2020-10-16 04:47:43,546 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:47:43,546 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:47:43,546 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530598217] [2020-10-16 04:47:43,547 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:47:43,547 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:47:43,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:47:43,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:47:43,549 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 201 [2020-10-16 04:47:43,550 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 140 flow. Second operand 3 states. [2020-10-16 04:47:43,550 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:47:43,550 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 201 [2020-10-16 04:47:43,550 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:47:43,583 INFO L129 PetriNetUnfolder]: 34/131 cut-off events. [2020-10-16 04:47:43,583 INFO L130 PetriNetUnfolder]: For 246/338 co-relation queries the response was YES. [2020-10-16 04:47:43,584 INFO L80 FinitePrefix]: Finished finitePrefix Result has 324 conditions, 131 events. 34/131 cut-off events. For 246/338 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 576 event pairs, 8 based on Foata normal form. 5/125 useless extension candidates. Maximal degree in co-relation 309. Up to 47 conditions per place. [2020-10-16 04:47:43,585 INFO L132 encePairwiseOnDemand]: 197/201 looper letters, 3 selfloop transitions, 5 changer transitions 0/35 dead transitions. [2020-10-16 04:47:43,585 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 35 transitions, 164 flow [2020-10-16 04:47:43,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:47:43,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:47:43,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 529 transitions. [2020-10-16 04:47:43,588 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8772802653399668 [2020-10-16 04:47:43,588 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 529 transitions. [2020-10-16 04:47:43,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 529 transitions. [2020-10-16 04:47:43,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:47:43,589 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 529 transitions. [2020-10-16 04:47:43,590 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:47:43,592 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:47:43,592 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:47:43,592 INFO L185 Difference]: Start difference. First operand has 44 places, 33 transitions, 140 flow. Second operand 3 states and 529 transitions. [2020-10-16 04:47:43,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 35 transitions, 164 flow [2020-10-16 04:47:43,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 35 transitions, 152 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-16 04:47:43,596 INFO L241 Difference]: Finished difference. Result has 44 places, 35 transitions, 157 flow [2020-10-16 04:47:43,597 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=157, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2020-10-16 04:47:43,597 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 3 predicate places. [2020-10-16 04:47:43,597 INFO L481 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 157 flow [2020-10-16 04:47:43,597 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:47:43,597 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:47:43,598 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:47:43,598 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 04:47:43,598 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:47:43,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:47:43,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1740595707, now seen corresponding path program 1 times [2020-10-16 04:47:43,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:47:43,599 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071967253] [2020-10-16 04:47:43,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:47:43,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:47:43,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:47:43,683 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071967253] [2020-10-16 04:47:43,683 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:47:43,684 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:47:43,684 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062130719] [2020-10-16 04:47:43,684 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:47:43,684 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:47:43,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:47:43,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:47:43,686 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 201 [2020-10-16 04:47:43,686 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 157 flow. Second operand 3 states. [2020-10-16 04:47:43,686 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:47:43,687 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 201 [2020-10-16 04:47:43,687 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:47:43,718 INFO L129 PetriNetUnfolder]: 28/122 cut-off events. [2020-10-16 04:47:43,718 INFO L130 PetriNetUnfolder]: For 309/455 co-relation queries the response was YES. [2020-10-16 04:47:43,719 INFO L80 FinitePrefix]: Finished finitePrefix Result has 306 conditions, 122 events. 28/122 cut-off events. For 309/455 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 533 event pairs, 7 based on Foata normal form. 7/119 useless extension candidates. Maximal degree in co-relation 290. Up to 40 conditions per place. [2020-10-16 04:47:43,719 INFO L132 encePairwiseOnDemand]: 197/201 looper letters, 3 selfloop transitions, 5 changer transitions 0/37 dead transitions. [2020-10-16 04:47:43,720 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 37 transitions, 181 flow [2020-10-16 04:47:43,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:47:43,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:47:43,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 529 transitions. [2020-10-16 04:47:43,723 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8772802653399668 [2020-10-16 04:47:43,723 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 529 transitions. [2020-10-16 04:47:43,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 529 transitions. [2020-10-16 04:47:43,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:47:43,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 529 transitions. [2020-10-16 04:47:43,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:47:43,726 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:47:43,726 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:47:43,726 INFO L185 Difference]: Start difference. First operand has 44 places, 35 transitions, 157 flow. Second operand 3 states and 529 transitions. [2020-10-16 04:47:43,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 37 transitions, 181 flow [2020-10-16 04:47:43,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 37 transitions, 176 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 04:47:43,729 INFO L241 Difference]: Finished difference. Result has 46 places, 37 transitions, 181 flow [2020-10-16 04:47:43,730 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=181, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2020-10-16 04:47:43,730 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 5 predicate places. [2020-10-16 04:47:43,730 INFO L481 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 181 flow [2020-10-16 04:47:43,730 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:47:43,730 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:47:43,730 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:47:43,731 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 04:47:43,731 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:47:43,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:47:43,731 INFO L82 PathProgramCache]: Analyzing trace with hash 355648553, now seen corresponding path program 1 times [2020-10-16 04:47:43,731 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:47:43,732 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811163684] [2020-10-16 04:47:43,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:47:43,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:47:43,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:47:43,780 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811163684] [2020-10-16 04:47:43,780 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:47:43,780 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 04:47:43,781 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007918633] [2020-10-16 04:47:43,781 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:47:43,781 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:47:43,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:47:43,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:47:43,783 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 201 [2020-10-16 04:47:43,783 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 181 flow. Second operand 3 states. [2020-10-16 04:47:43,784 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:47:43,784 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 201 [2020-10-16 04:47:43,784 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:47:43,813 INFO L129 PetriNetUnfolder]: 22/120 cut-off events. [2020-10-16 04:47:43,814 INFO L130 PetriNetUnfolder]: For 378/537 co-relation queries the response was YES. [2020-10-16 04:47:43,814 INFO L80 FinitePrefix]: Finished finitePrefix Result has 321 conditions, 120 events. 22/120 cut-off events. For 378/537 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 602 event pairs, 7 based on Foata normal form. 11/123 useless extension candidates. Maximal degree in co-relation 303. Up to 38 conditions per place. [2020-10-16 04:47:43,815 INFO L132 encePairwiseOnDemand]: 198/201 looper letters, 4 selfloop transitions, 4 changer transitions 0/37 dead transitions. [2020-10-16 04:47:43,815 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 37 transitions, 197 flow [2020-10-16 04:47:43,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:47:43,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:47:43,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 528 transitions. [2020-10-16 04:47:43,818 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8756218905472637 [2020-10-16 04:47:43,819 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 528 transitions. [2020-10-16 04:47:43,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 528 transitions. [2020-10-16 04:47:43,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:47:43,819 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 528 transitions. [2020-10-16 04:47:43,821 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:47:43,822 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:47:43,822 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:47:43,822 INFO L185 Difference]: Start difference. First operand has 46 places, 37 transitions, 181 flow. Second operand 3 states and 528 transitions. [2020-10-16 04:47:43,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 37 transitions, 197 flow [2020-10-16 04:47:43,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 37 transitions, 192 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 04:47:43,825 INFO L241 Difference]: Finished difference. Result has 48 places, 37 transitions, 190 flow [2020-10-16 04:47:43,826 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=190, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2020-10-16 04:47:43,826 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 7 predicate places. [2020-10-16 04:47:43,826 INFO L481 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 190 flow [2020-10-16 04:47:43,826 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:47:43,826 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:47:43,826 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:47:43,827 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 04:47:43,827 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:47:43,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:47:43,827 INFO L82 PathProgramCache]: Analyzing trace with hash 101189170, now seen corresponding path program 1 times [2020-10-16 04:47:43,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:47:43,828 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864200910] [2020-10-16 04:47:43,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:47:43,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:47:43,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 04:47:43,938 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864200910] [2020-10-16 04:47:43,938 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:47:43,938 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:47:43,938 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224502926] [2020-10-16 04:47:43,939 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:47:43,939 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:47:43,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:47:43,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:47:43,941 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 201 [2020-10-16 04:47:43,942 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 190 flow. Second operand 4 states. [2020-10-16 04:47:43,942 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:47:43,942 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 201 [2020-10-16 04:47:43,943 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:47:44,078 INFO L129 PetriNetUnfolder]: 350/713 cut-off events. [2020-10-16 04:47:44,078 INFO L130 PetriNetUnfolder]: For 1322/1727 co-relation queries the response was YES. [2020-10-16 04:47:44,082 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1733 conditions, 713 events. 350/713 cut-off events. For 1322/1727 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 4532 event pairs, 64 based on Foata normal form. 64/679 useless extension candidates. Maximal degree in co-relation 1714. Up to 334 conditions per place. [2020-10-16 04:47:44,087 INFO L132 encePairwiseOnDemand]: 194/201 looper letters, 10 selfloop transitions, 6 changer transitions 0/46 dead transitions. [2020-10-16 04:47:44,088 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 46 transitions, 240 flow [2020-10-16 04:47:44,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 04:47:44,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 04:47:44,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 666 transitions. [2020-10-16 04:47:44,091 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8283582089552238 [2020-10-16 04:47:44,091 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 666 transitions. [2020-10-16 04:47:44,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 666 transitions. [2020-10-16 04:47:44,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:47:44,092 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 666 transitions. [2020-10-16 04:47:44,094 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 04:47:44,096 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 04:47:44,096 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 04:47:44,096 INFO L185 Difference]: Start difference. First operand has 48 places, 37 transitions, 190 flow. Second operand 4 states and 666 transitions. [2020-10-16 04:47:44,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 46 transitions, 240 flow [2020-10-16 04:47:44,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 46 transitions, 234 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-16 04:47:44,102 INFO L241 Difference]: Finished difference. Result has 52 places, 42 transitions, 230 flow [2020-10-16 04:47:44,102 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=230, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2020-10-16 04:47:44,103 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 11 predicate places. [2020-10-16 04:47:44,103 INFO L481 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 230 flow [2020-10-16 04:47:44,103 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:47:44,103 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:47:44,103 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:47:44,103 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 04:47:44,103 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:47:44,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:47:44,104 INFO L82 PathProgramCache]: Analyzing trace with hash 579585481, now seen corresponding path program 1 times [2020-10-16 04:47:44,104 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:47:44,105 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632860092] [2020-10-16 04:47:44,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:47:44,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:47:44,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:47:44,156 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632860092] [2020-10-16 04:47:44,157 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:47:44,157 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 04:47:44,157 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143267921] [2020-10-16 04:47:44,158 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:47:44,158 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:47:44,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:47:44,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:47:44,160 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 201 [2020-10-16 04:47:44,161 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 230 flow. Second operand 3 states. [2020-10-16 04:47:44,161 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:47:44,162 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 201 [2020-10-16 04:47:44,162 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:47:44,304 INFO L129 PetriNetUnfolder]: 461/924 cut-off events. [2020-10-16 04:47:44,304 INFO L130 PetriNetUnfolder]: For 2672/3443 co-relation queries the response was YES. [2020-10-16 04:47:44,310 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2309 conditions, 924 events. 461/924 cut-off events. For 2672/3443 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 6186 event pairs, 216 based on Foata normal form. 39/818 useless extension candidates. Maximal degree in co-relation 2287. Up to 758 conditions per place. [2020-10-16 04:47:44,314 INFO L132 encePairwiseOnDemand]: 198/201 looper letters, 4 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2020-10-16 04:47:44,314 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 42 transitions, 246 flow [2020-10-16 04:47:44,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:47:44,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:47:44,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 528 transitions. [2020-10-16 04:47:44,317 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8756218905472637 [2020-10-16 04:47:44,317 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 528 transitions. [2020-10-16 04:47:44,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 528 transitions. [2020-10-16 04:47:44,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:47:44,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 528 transitions. [2020-10-16 04:47:44,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:47:44,320 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:47:44,320 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:47:44,321 INFO L185 Difference]: Start difference. First operand has 52 places, 42 transitions, 230 flow. Second operand 3 states and 528 transitions. [2020-10-16 04:47:44,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 42 transitions, 246 flow [2020-10-16 04:47:44,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 42 transitions, 244 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 04:47:44,325 INFO L241 Difference]: Finished difference. Result has 54 places, 42 transitions, 242 flow [2020-10-16 04:47:44,325 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=242, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2020-10-16 04:47:44,325 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 13 predicate places. [2020-10-16 04:47:44,326 INFO L481 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 242 flow [2020-10-16 04:47:44,326 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:47:44,326 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:47:44,326 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:47:44,326 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 04:47:44,326 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:47:44,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:47:44,327 INFO L82 PathProgramCache]: Analyzing trace with hash -431463189, now seen corresponding path program 1 times [2020-10-16 04:47:44,327 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:47:44,327 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128902364] [2020-10-16 04:47:44,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:47:44,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:47:44,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:47:44,437 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128902364] [2020-10-16 04:47:44,438 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:47:44,439 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:47:44,439 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401556255] [2020-10-16 04:47:44,440 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:47:44,440 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:47:44,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:47:44,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:47:44,444 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 201 [2020-10-16 04:47:44,445 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 242 flow. Second operand 5 states. [2020-10-16 04:47:44,445 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:47:44,445 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 201 [2020-10-16 04:47:44,445 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:47:44,644 INFO L129 PetriNetUnfolder]: 570/1124 cut-off events. [2020-10-16 04:47:44,645 INFO L130 PetriNetUnfolder]: For 1538/3565 co-relation queries the response was YES. [2020-10-16 04:47:44,651 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3604 conditions, 1124 events. 570/1124 cut-off events. For 1538/3565 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 7538 event pairs, 45 based on Foata normal form. 156/1135 useless extension candidates. Maximal degree in co-relation 3581. Up to 900 conditions per place. [2020-10-16 04:47:44,655 INFO L132 encePairwiseOnDemand]: 194/201 looper letters, 11 selfloop transitions, 10 changer transitions 0/51 dead transitions. [2020-10-16 04:47:44,656 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 51 transitions, 320 flow [2020-10-16 04:47:44,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:47:44,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:47:44,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 833 transitions. [2020-10-16 04:47:44,660 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8288557213930349 [2020-10-16 04:47:44,660 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 833 transitions. [2020-10-16 04:47:44,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 833 transitions. [2020-10-16 04:47:44,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:47:44,661 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 833 transitions. [2020-10-16 04:47:44,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:47:44,665 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:47:44,665 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:47:44,665 INFO L185 Difference]: Start difference. First operand has 54 places, 42 transitions, 242 flow. Second operand 5 states and 833 transitions. [2020-10-16 04:47:44,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 51 transitions, 320 flow [2020-10-16 04:47:44,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 51 transitions, 314 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-16 04:47:44,670 INFO L241 Difference]: Finished difference. Result has 59 places, 47 transitions, 303 flow [2020-10-16 04:47:44,670 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=303, PETRI_PLACES=59, PETRI_TRANSITIONS=47} [2020-10-16 04:47:44,670 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 18 predicate places. [2020-10-16 04:47:44,670 INFO L481 AbstractCegarLoop]: Abstraction has has 59 places, 47 transitions, 303 flow [2020-10-16 04:47:44,670 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:47:44,671 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:47:44,671 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] [2020-10-16 04:47:44,671 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 04:47:44,671 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:47:44,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:47:44,672 INFO L82 PathProgramCache]: Analyzing trace with hash -182069891, now seen corresponding path program 1 times [2020-10-16 04:47:44,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:47:44,672 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910434144] [2020-10-16 04:47:44,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:47:44,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:47:44,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:47:44,827 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910434144] [2020-10-16 04:47:44,827 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:47:44,827 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:47:44,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950013106] [2020-10-16 04:47:44,828 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 04:47:44,828 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:47:44,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 04:47:44,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 04:47:44,830 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 201 [2020-10-16 04:47:44,831 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 47 transitions, 303 flow. Second operand 6 states. [2020-10-16 04:47:44,831 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:47:44,831 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 201 [2020-10-16 04:47:44,831 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:47:45,073 INFO L129 PetriNetUnfolder]: 479/988 cut-off events. [2020-10-16 04:47:45,073 INFO L130 PetriNetUnfolder]: For 2473/6251 co-relation queries the response was YES. [2020-10-16 04:47:45,079 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4302 conditions, 988 events. 479/988 cut-off events. For 2473/6251 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 6553 event pairs, 29 based on Foata normal form. 179/1025 useless extension candidates. Maximal degree in co-relation 4276. Up to 785 conditions per place. [2020-10-16 04:47:45,084 INFO L132 encePairwiseOnDemand]: 194/201 looper letters, 12 selfloop transitions, 14 changer transitions 0/56 dead transitions. [2020-10-16 04:47:45,084 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 56 transitions, 410 flow [2020-10-16 04:47:45,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 04:47:45,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 04:47:45,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1000 transitions. [2020-10-16 04:47:45,088 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8291873963515755 [2020-10-16 04:47:45,088 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1000 transitions. [2020-10-16 04:47:45,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1000 transitions. [2020-10-16 04:47:45,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:47:45,089 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1000 transitions. [2020-10-16 04:47:45,092 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 04:47:45,094 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 04:47:45,094 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 04:47:45,094 INFO L185 Difference]: Start difference. First operand has 59 places, 47 transitions, 303 flow. Second operand 6 states and 1000 transitions. [2020-10-16 04:47:45,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 56 transitions, 410 flow [2020-10-16 04:47:45,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 56 transitions, 394 flow, removed 4 selfloop flow, removed 2 redundant places. [2020-10-16 04:47:45,100 INFO L241 Difference]: Finished difference. Result has 64 places, 52 transitions, 373 flow [2020-10-16 04:47:45,100 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=373, PETRI_PLACES=64, PETRI_TRANSITIONS=52} [2020-10-16 04:47:45,101 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 23 predicate places. [2020-10-16 04:47:45,101 INFO L481 AbstractCegarLoop]: Abstraction has has 64 places, 52 transitions, 373 flow [2020-10-16 04:47:45,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 04:47:45,101 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:47:45,101 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:47:45,102 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 04:47:45,102 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:47:45,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:47:45,102 INFO L82 PathProgramCache]: Analyzing trace with hash 244947229, now seen corresponding path program 1 times [2020-10-16 04:47:45,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:47:45,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478482472] [2020-10-16 04:47:45,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:47:45,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:47:45,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:47:45,236 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478482472] [2020-10-16 04:47:45,236 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:47:45,236 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 04:47:45,237 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40732411] [2020-10-16 04:47:45,237 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:47:45,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:47:45,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:47:45,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:47:45,239 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 201 [2020-10-16 04:47:45,240 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 52 transitions, 373 flow. Second operand 7 states. [2020-10-16 04:47:45,240 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:47:45,241 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 201 [2020-10-16 04:47:45,241 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:47:45,503 INFO L129 PetriNetUnfolder]: 453/932 cut-off events. [2020-10-16 04:47:45,503 INFO L130 PetriNetUnfolder]: For 4396/8232 co-relation queries the response was YES. [2020-10-16 04:47:45,511 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4824 conditions, 932 events. 453/932 cut-off events. For 4396/8232 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 6172 event pairs, 27 based on Foata normal form. 162/952 useless extension candidates. Maximal degree in co-relation 4796. Up to 685 conditions per place. [2020-10-16 04:47:45,516 INFO L132 encePairwiseOnDemand]: 194/201 looper letters, 5 selfloop transitions, 18 changer transitions 6/53 dead transitions. [2020-10-16 04:47:45,516 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 53 transitions, 428 flow [2020-10-16 04:47:45,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:47:45,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:47:45,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1159 transitions. [2020-10-16 04:47:45,523 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8237384506041222 [2020-10-16 04:47:45,523 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1159 transitions. [2020-10-16 04:47:45,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1159 transitions. [2020-10-16 04:47:45,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:47:45,525 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1159 transitions. [2020-10-16 04:47:45,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:47:45,530 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:47:45,531 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:47:45,531 INFO L185 Difference]: Start difference. First operand has 64 places, 52 transitions, 373 flow. Second operand 7 states and 1159 transitions. [2020-10-16 04:47:45,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 53 transitions, 428 flow [2020-10-16 04:47:45,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 53 transitions, 374 flow, removed 14 selfloop flow, removed 5 redundant places. [2020-10-16 04:47:45,552 INFO L241 Difference]: Finished difference. Result has 67 places, 47 transitions, 343 flow [2020-10-16 04:47:45,552 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=343, PETRI_PLACES=67, PETRI_TRANSITIONS=47} [2020-10-16 04:47:45,553 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 26 predicate places. [2020-10-16 04:47:45,553 INFO L481 AbstractCegarLoop]: Abstraction has has 67 places, 47 transitions, 343 flow [2020-10-16 04:47:45,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:47:45,553 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:47:45,553 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:47:45,553 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 04:47:45,553 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:47:45,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:47:45,554 INFO L82 PathProgramCache]: Analyzing trace with hash 907700171, now seen corresponding path program 1 times [2020-10-16 04:47:45,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:47:45,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010483969] [2020-10-16 04:47:45,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:47:45,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:47:45,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:47:45,672 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010483969] [2020-10-16 04:47:45,672 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:47:45,672 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:47:45,672 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85174469] [2020-10-16 04:47:45,673 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 04:47:45,673 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:47:45,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 04:47:45,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-16 04:47:45,675 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 201 [2020-10-16 04:47:45,676 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 47 transitions, 343 flow. Second operand 6 states. [2020-10-16 04:47:45,676 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:47:45,676 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 201 [2020-10-16 04:47:45,676 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:47:45,874 INFO L129 PetriNetUnfolder]: 231/545 cut-off events. [2020-10-16 04:47:45,875 INFO L130 PetriNetUnfolder]: For 3718/4978 co-relation queries the response was YES. [2020-10-16 04:47:45,878 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2303 conditions, 545 events. 231/545 cut-off events. For 3718/4978 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 3432 event pairs, 20 based on Foata normal form. 33/462 useless extension candidates. Maximal degree in co-relation 2275. Up to 193 conditions per place. [2020-10-16 04:47:45,880 INFO L132 encePairwiseOnDemand]: 196/201 looper letters, 7 selfloop transitions, 2 changer transitions 13/56 dead transitions. [2020-10-16 04:47:45,880 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 56 transitions, 421 flow [2020-10-16 04:47:45,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 04:47:45,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 04:47:45,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 919 transitions. [2020-10-16 04:47:45,884 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7620232172470979 [2020-10-16 04:47:45,884 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 919 transitions. [2020-10-16 04:47:45,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 919 transitions. [2020-10-16 04:47:45,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:47:45,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 919 transitions. [2020-10-16 04:47:45,887 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 04:47:45,890 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 04:47:45,890 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 04:47:45,890 INFO L185 Difference]: Start difference. First operand has 67 places, 47 transitions, 343 flow. Second operand 6 states and 919 transitions. [2020-10-16 04:47:45,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 56 transitions, 421 flow [2020-10-16 04:47:45,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 56 transitions, 354 flow, removed 14 selfloop flow, removed 9 redundant places. [2020-10-16 04:47:45,904 INFO L241 Difference]: Finished difference. Result has 66 places, 43 transitions, 265 flow [2020-10-16 04:47:45,905 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=265, PETRI_PLACES=66, PETRI_TRANSITIONS=43} [2020-10-16 04:47:45,905 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 25 predicate places. [2020-10-16 04:47:45,905 INFO L481 AbstractCegarLoop]: Abstraction has has 66 places, 43 transitions, 265 flow [2020-10-16 04:47:45,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 04:47:45,905 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:47:45,905 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:47:45,906 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 04:47:45,906 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:47:45,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:47:45,906 INFO L82 PathProgramCache]: Analyzing trace with hash 319852161, now seen corresponding path program 2 times [2020-10-16 04:47:45,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:47:45,907 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471167374] [2020-10-16 04:47:45,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:47:45,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:47:45,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:47:45,993 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471167374] [2020-10-16 04:47:45,994 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:47:45,994 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:47:45,995 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853172749] [2020-10-16 04:47:45,995 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:47:45,995 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:47:45,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:47:45,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:47:45,997 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 201 [2020-10-16 04:47:45,998 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 43 transitions, 265 flow. Second operand 4 states. [2020-10-16 04:47:45,998 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:47:45,998 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 201 [2020-10-16 04:47:45,998 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:47:46,055 INFO L129 PetriNetUnfolder]: 158/346 cut-off events. [2020-10-16 04:47:46,055 INFO L130 PetriNetUnfolder]: For 872/971 co-relation queries the response was YES. [2020-10-16 04:47:46,057 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1316 conditions, 346 events. 158/346 cut-off events. For 872/971 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 1926 event pairs, 0 based on Foata normal form. 1/299 useless extension candidates. Maximal degree in co-relation 1297. Up to 123 conditions per place. [2020-10-16 04:47:46,058 INFO L132 encePairwiseOnDemand]: 198/201 looper letters, 3 selfloop transitions, 1 changer transitions 5/44 dead transitions. [2020-10-16 04:47:46,058 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 44 transitions, 279 flow [2020-10-16 04:47:46,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 04:47:46,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 04:47:46,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 686 transitions. [2020-10-16 04:47:46,062 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8532338308457711 [2020-10-16 04:47:46,062 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 686 transitions. [2020-10-16 04:47:46,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 686 transitions. [2020-10-16 04:47:46,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:47:46,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 686 transitions. [2020-10-16 04:47:46,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 04:47:46,065 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 04:47:46,066 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 04:47:46,066 INFO L185 Difference]: Start difference. First operand has 66 places, 43 transitions, 265 flow. Second operand 4 states and 686 transitions. [2020-10-16 04:47:46,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 44 transitions, 279 flow [2020-10-16 04:47:46,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 44 transitions, 255 flow, removed 6 selfloop flow, removed 8 redundant places. [2020-10-16 04:47:46,072 INFO L241 Difference]: Finished difference. Result has 60 places, 39 transitions, 222 flow [2020-10-16 04:47:46,073 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=222, PETRI_PLACES=60, PETRI_TRANSITIONS=39} [2020-10-16 04:47:46,073 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 19 predicate places. [2020-10-16 04:47:46,073 INFO L481 AbstractCegarLoop]: Abstraction has has 60 places, 39 transitions, 222 flow [2020-10-16 04:47:46,073 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:47:46,073 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:47:46,073 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:47:46,073 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 04:47:46,074 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:47:46,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:47:46,074 INFO L82 PathProgramCache]: Analyzing trace with hash 273526035, now seen corresponding path program 3 times [2020-10-16 04:47:46,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:47:46,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233318151] [2020-10-16 04:47:46,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:47:46,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 04:47:46,129 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 04:47:46,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 04:47:46,185 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 04:47:46,231 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 04:47:46,231 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 04:47:46,232 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 04:47:46,233 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 04:47:46,264 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1295] [1295] L851-->L859: Formula: (let ((.cse7 (= (mod ~z$w_buff1_used~0_In-1212176511 256) 0)) (.cse6 (= (mod ~z$r_buff1_thd0~0_In-1212176511 256) 0)) (.cse8 (= (mod ~z$r_buff0_thd0~0_In-1212176511 256) 0)) (.cse9 (= (mod ~z$w_buff0_used~0_In-1212176511 256) 0))) (let ((.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse2 (or .cse8 .cse9)) (.cse3 (or .cse7 .cse6)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1212176511 |ULTIMATE.start_assume_abort_if_not_#in~cond_Out-1212176511|) (or (and (= ~z$w_buff0_used~0_Out-1212176511 0) .cse0 .cse1) (and (= ~z$w_buff0_used~0_Out-1212176511 ~z$w_buff0_used~0_In-1212176511) .cse2)) (= ~z$r_buff1_thd0~0_Out-1212176511 ~z$r_buff1_thd0~0_In-1212176511) (or (and (= ~z~0_Out-1212176511 ~z$w_buff0~0_In-1212176511) .cse0 .cse1) (and (or (and .cse3 (= ~z~0_In-1212176511 ~z~0_Out-1212176511)) (and (= ~z$w_buff1~0_In-1212176511 ~z~0_Out-1212176511) .cse4 .cse5)) .cse2)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_Out-1212176511| (mod ~main$tmp_guard0~0_In-1212176511 256)) (or (and .cse3 (= ~z$w_buff1_used~0_In-1212176511 ~z$w_buff1_used~0_Out-1212176511)) (and .cse4 (= ~z$w_buff1_used~0_Out-1212176511 0) .cse5)) (= ~z$r_buff0_thd0~0_Out-1212176511 ~z$r_buff0_thd0~0_In-1212176511) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1212176511 0))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1212176511, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1212176511, ~z$w_buff0~0=~z$w_buff0~0_In-1212176511, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1212176511, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1212176511, ~z$w_buff1~0=~z$w_buff1~0_In-1212176511, ~z~0=~z~0_In-1212176511, ~main$tmp_guard0~0=~main$tmp_guard0~0_In-1212176511} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out-1212176511, ~z$w_buff0~0=~z$w_buff0~0_In-1212176511, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-1212176511, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1212176511|, ~z$w_buff1~0=~z$w_buff1~0_In-1212176511, ~main$tmp_guard0~0=~main$tmp_guard0~0_In-1212176511, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1212176511|, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1212176511|, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1212176511|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1212176511|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_Out-1212176511|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out-1212176511, ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1212176511|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-1212176511, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-1212176511, ~z~0=~z~0_Out-1212176511} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_assume_abort_if_not_#in~cond, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_assume_abort_if_not_~cond, ~z$r_buff1_thd0~0, ~z~0] because there is no mapped edge [2020-10-16 04:47:46,272 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:46,272 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:46,273 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:46,273 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:46,273 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:46,273 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:46,274 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:46,274 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:46,274 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:46,274 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:46,275 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:46,275 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:46,275 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:46,275 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:46,275 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:46,275 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:46,276 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:46,276 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:46,276 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:46,276 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:46,276 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:46,276 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:46,277 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:46,277 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:46,278 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:46,279 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:46,279 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:46,279 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:46,279 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:46,279 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:46,279 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:46,280 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:46,280 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:46,280 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:46,281 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:46,281 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:46,281 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:46,281 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:46,281 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:46,281 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:46,282 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:46,282 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:46,282 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:46,282 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:46,283 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:46,283 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:46,283 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:46,283 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:46,284 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:46,284 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:46,284 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:46,284 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:46,284 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:46,285 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:46,285 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:46,285 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:46,285 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:46,285 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:46,285 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:46,285 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:46,286 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:46,286 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:46,286 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:46,286 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:46,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 04:47:46 BasicIcfg [2020-10-16 04:47:46,422 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 04:47:46,428 INFO L168 Benchmark]: Toolchain (without parser) took 18244.82 ms. Allocated memory was 251.1 MB in the beginning and 641.7 MB in the end (delta: 390.6 MB). Free memory was 203.7 MB in the beginning and 249.6 MB in the end (delta: -46.0 MB). Peak memory consumption was 344.6 MB. Max. memory is 14.2 GB. [2020-10-16 04:47:46,428 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 251.1 MB. Free memory is still 225.0 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 04:47:46,429 INFO L168 Benchmark]: CACSL2BoogieTranslator took 800.60 ms. Allocated memory was 251.1 MB in the beginning and 313.5 MB in the end (delta: 62.4 MB). Free memory was 203.7 MB in the beginning and 261.8 MB in the end (delta: -58.2 MB). Peak memory consumption was 29.4 MB. Max. memory is 14.2 GB. [2020-10-16 04:47:46,430 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.57 ms. Allocated memory is still 313.5 MB. Free memory was 261.8 MB in the beginning and 256.8 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. [2020-10-16 04:47:46,431 INFO L168 Benchmark]: Boogie Preprocessor took 47.56 ms. Allocated memory is still 313.5 MB. Free memory was 256.8 MB in the beginning and 254.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 04:47:46,432 INFO L168 Benchmark]: RCFGBuilder took 2777.48 ms. Allocated memory was 313.5 MB in the beginning and 372.2 MB in the end (delta: 58.7 MB). Free memory was 254.3 MB in the beginning and 284.4 MB in the end (delta: -30.2 MB). Peak memory consumption was 142.0 MB. Max. memory is 14.2 GB. [2020-10-16 04:47:46,436 INFO L168 Benchmark]: TraceAbstraction took 14541.61 ms. Allocated memory was 372.2 MB in the beginning and 641.7 MB in the end (delta: 269.5 MB). Free memory was 284.4 MB in the beginning and 249.6 MB in the end (delta: 34.8 MB). Peak memory consumption was 304.3 MB. Max. memory is 14.2 GB. [2020-10-16 04:47:46,447 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.19 ms. Allocated memory is still 251.1 MB. Free memory is still 225.0 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 800.60 ms. Allocated memory was 251.1 MB in the beginning and 313.5 MB in the end (delta: 62.4 MB). Free memory was 203.7 MB in the beginning and 261.8 MB in the end (delta: -58.2 MB). Peak memory consumption was 29.4 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 71.57 ms. Allocated memory is still 313.5 MB. Free memory was 261.8 MB in the beginning and 256.8 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 47.56 ms. Allocated memory is still 313.5 MB. Free memory was 256.8 MB in the beginning and 254.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2777.48 ms. Allocated memory was 313.5 MB in the beginning and 372.2 MB in the end (delta: 58.7 MB). Free memory was 254.3 MB in the beginning and 284.4 MB in the end (delta: -30.2 MB). Peak memory consumption was 142.0 MB. Max. memory is 14.2 GB. * TraceAbstraction took 14541.61 ms. Allocated memory was 372.2 MB in the beginning and 641.7 MB in the end (delta: 269.5 MB). Free memory was 284.4 MB in the beginning and 249.6 MB in the end (delta: 34.8 MB). Peak memory consumption was 304.3 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1643 VarBasedMoverChecksPositive, 100 VarBasedMoverChecksNegative, 34 SemBasedMoverChecksPositive, 66 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 233 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 9.9s, 116 PlacesBefore, 41 PlacesAfterwards, 105 TransitionsBefore, 29 TransitionsAfterwards, 2446 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 92 TotalNumberOfCompositions, 6967 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p3_EAX = 0; [L703] 0 int __unbuffered_p3_EBX = 0; [L705] 0 int a = 0; [L706] 0 _Bool main$tmp_guard0; [L707] 0 _Bool main$tmp_guard1; [L709] 0 int x = 0; [L711] 0 int y = 0; [L713] 0 int z = 0; [L714] 0 _Bool z$flush_delayed; [L715] 0 int z$mem_tmp; [L716] 0 _Bool z$r_buff0_thd0; [L717] 0 _Bool z$r_buff0_thd1; [L718] 0 _Bool z$r_buff0_thd2; [L719] 0 _Bool z$r_buff0_thd3; [L720] 0 _Bool z$r_buff0_thd4; [L721] 0 _Bool z$r_buff1_thd0; [L722] 0 _Bool z$r_buff1_thd1; [L723] 0 _Bool z$r_buff1_thd2; [L724] 0 _Bool z$r_buff1_thd3; [L725] 0 _Bool z$r_buff1_thd4; [L726] 0 _Bool z$read_delayed; [L727] 0 int *z$read_delayed_var; [L728] 0 int z$w_buff0; [L729] 0 _Bool z$w_buff0_used; [L730] 0 int z$w_buff1; [L731] 0 _Bool z$w_buff1_used; [L732] 0 _Bool weak$$choice0; [L733] 0 _Bool weak$$choice2; [L841] 0 pthread_t t829; [L842] FCALL, FORK 0 pthread_create(&t829, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 0 pthread_t t830; [L844] FCALL, FORK 0 pthread_create(&t830, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] 0 pthread_t t831; [L846] FCALL, FORK 0 pthread_create(&t831, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] 0 pthread_t t832; [L848] FCALL, FORK 0 pthread_create(&t832, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 4 z$w_buff1 = z$w_buff0 [L788] 4 z$w_buff0 = 2 [L789] 4 z$w_buff1_used = z$w_buff0_used [L790] 4 z$w_buff0_used = (_Bool)1 [L7] COND FALSE 4 !(!expression) [L792] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L793] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L794] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L795] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L796] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L797] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L800] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 4 z$flush_delayed = weak$$choice2 [L803] 4 z$mem_tmp = z [L804] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L804] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L805] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L805] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L806] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L806] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L807] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L807] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used) [L807] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L807] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used) [L807] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L807] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L808] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L808] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L809] EXPR 4 weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L809] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L810] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L810] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L810] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L810] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L811] 4 __unbuffered_p3_EAX = z [L812] EXPR 4 z$flush_delayed ? z$mem_tmp : z [L812] 4 z = z$flush_delayed ? z$mem_tmp : z [L813] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L816] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L737] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_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=10, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L740] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_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=10, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=255, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=255, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=255, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L773] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L774] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L774] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L775] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L775] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L776] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L776] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L777] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L777] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L745] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L747] 1 return 0; [L780] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L782] 3 return 0; [L819] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L819] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L820] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L820] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L821] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L821] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L822] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L822] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L823] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L823] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L826] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L828] 4 return 0; [L760] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 2 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L861] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L862] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L863] 0 z$flush_delayed = weak$$choice2 [L864] 0 z$mem_tmp = z [L865] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L865] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1 [L865] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L865] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L866] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L866] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L867] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L867] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L868] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L868] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L869] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L869] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L870] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L870] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L871] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L871] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L871] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L871] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L873] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L873] 0 z = z$flush_delayed ? z$mem_tmp : z [L874] 0 z$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 108 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: 14.2s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.0s, HoareTripleCheckerStatistics: 61 SDtfs, 26 SDslu, 26 SDs, 0 SdLazy, 195 SolverSat, 81 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=373occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 256 NumberOfCodeBlocks, 256 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 216 ConstructedInterpolants, 0 QuantifiedInterpolants, 14862 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...