/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/rfi003_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 04:57:58,589 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 04:57:58,592 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 04:57:58,615 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 04:57:58,616 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 04:57:58,617 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 04:57:58,618 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 04:57:58,620 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 04:57:58,621 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 04:57:58,622 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 04:57:58,623 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 04:57:58,624 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 04:57:58,625 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 04:57:58,626 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 04:57:58,627 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 04:57:58,628 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 04:57:58,629 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 04:57:58,630 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 04:57:58,631 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 04:57:58,633 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 04:57:58,635 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 04:57:58,636 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 04:57:58,637 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 04:57:58,638 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 04:57:58,642 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 04:57:58,642 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 04:57:58,643 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 04:57:58,644 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 04:57:58,644 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 04:57:58,645 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 04:57:58,645 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 04:57:58,646 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 04:57:58,647 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 04:57:58,647 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 04:57:58,648 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 04:57:58,648 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 04:57:58,649 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 04:57:58,649 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 04:57:58,650 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 04:57:58,650 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 04:57:58,651 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 04:57:58,652 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:57:58,674 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 04:57:58,674 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 04:57:58,675 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 04:57:58,675 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 04:57:58,676 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 04:57:58,676 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 04:57:58,676 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 04:57:58,676 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 04:57:58,676 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 04:57:58,677 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 04:57:58,677 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 04:57:58,677 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 04:57:58,677 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 04:57:58,677 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 04:57:58,678 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 04:57:58,678 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 04:57:58,678 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 04:57:58,678 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 04:57:58,678 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 04:57:58,678 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 04:57:58,679 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 04:57:58,679 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 04:57:58,679 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 04:57:58,679 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 04:57:58,679 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 04:57:58,680 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 04:57:58,680 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 04:57:58,680 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 04:57:58,680 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 04:57:58,957 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 04:57:58,969 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 04:57:58,972 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 04:57:58,974 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 04:57:58,974 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 04:57:58,975 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi003_tso.opt.i [2020-10-16 04:57:59,038 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/047fb3240/016e807cbe8f48f08bcb67c66a631fd0/FLAG58abc413f [2020-10-16 04:57:59,631 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 04:57:59,632 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi003_tso.opt.i [2020-10-16 04:57:59,663 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/047fb3240/016e807cbe8f48f08bcb67c66a631fd0/FLAG58abc413f [2020-10-16 04:57:59,891 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/047fb3240/016e807cbe8f48f08bcb67c66a631fd0 [2020-10-16 04:57:59,899 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 04:57:59,901 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 04:57:59,902 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 04:57:59,902 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 04:57:59,906 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 04:57:59,907 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:57:59" (1/1) ... [2020-10-16 04:57:59,910 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77674f1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:57:59, skipping insertion in model container [2020-10-16 04:57:59,910 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:57:59" (1/1) ... [2020-10-16 04:57:59,918 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 04:57:59,967 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 04:58:00,449 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:58:00,462 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 04:58:00,555 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:58:00,680 INFO L208 MainTranslator]: Completed translation [2020-10-16 04:58:00,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:58:00 WrapperNode [2020-10-16 04:58:00,681 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 04:58:00,683 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 04:58:00,683 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 04:58:00,684 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 04:58:00,694 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:58:00" (1/1) ... [2020-10-16 04:58:00,749 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:58:00" (1/1) ... [2020-10-16 04:58:00,822 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 04:58:00,822 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 04:58:00,822 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 04:58:00,822 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 04:58:00,835 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:58:00" (1/1) ... [2020-10-16 04:58:00,836 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:58:00" (1/1) ... [2020-10-16 04:58:00,853 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:58:00" (1/1) ... [2020-10-16 04:58:00,854 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:58:00" (1/1) ... [2020-10-16 04:58:00,869 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:58:00" (1/1) ... [2020-10-16 04:58:00,874 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:58:00" (1/1) ... [2020-10-16 04:58:00,879 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:58:00" (1/1) ... [2020-10-16 04:58:00,888 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 04:58:00,889 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 04:58:00,889 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 04:58:00,889 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 04:58:00,890 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:58:00" (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:58:00,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 04:58:00,972 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 04:58:00,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 04:58:00,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 04:58:00,973 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 04:58:00,973 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 04:58:00,973 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 04:58:00,973 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 04:58:00,974 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 04:58:00,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 04:58:00,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 04:58:00,979 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:58:04,230 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 04:58:04,231 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 04:58:04,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:58:04 BoogieIcfgContainer [2020-10-16 04:58:04,233 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 04:58:04,234 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 04:58:04,235 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 04:58:04,238 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 04:58:04,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 04:57:59" (1/3) ... [2020-10-16 04:58:04,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c0fdacd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:58:04, skipping insertion in model container [2020-10-16 04:58:04,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:58:00" (2/3) ... [2020-10-16 04:58:04,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c0fdacd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:58:04, skipping insertion in model container [2020-10-16 04:58:04,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:58:04" (3/3) ... [2020-10-16 04:58:04,242 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi003_tso.opt.i [2020-10-16 04:58:04,253 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 04:58:04,262 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 04:58:04,263 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 04:58:04,296 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,296 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,296 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,297 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,297 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,297 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,298 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,298 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,298 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,298 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,298 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,299 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,299 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,299 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,299 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,300 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,300 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,300 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,301 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,301 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,301 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,302 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,302 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,302 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,302 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,303 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,303 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,303 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,303 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,303 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,304 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,304 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,304 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,304 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,304 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,304 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,306 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,306 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,306 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,306 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,306 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,311 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,311 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,311 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,312 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,312 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,312 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,312 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,315 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,315 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,315 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,315 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,315 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,315 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,315 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,316 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,316 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,316 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,316 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,316 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,316 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,317 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,317 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,317 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,317 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,317 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,319 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,319 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,319 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,319 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,320 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,320 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,320 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,320 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,321 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,324 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,325 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,325 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,325 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,325 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,326 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,326 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,326 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,326 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,326 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,327 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,327 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,327 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,327 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,327 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,327 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,332 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,332 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,332 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,333 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,333 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,333 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,333 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,333 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,334 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,334 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,334 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,334 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,334 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,334 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,335 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,335 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,335 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,335 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,335 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,335 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,336 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,336 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,336 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,336 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,336 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,337 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,337 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,337 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,337 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,337 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,337 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,338 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,338 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,338 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,338 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,338 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,339 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,339 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,339 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,339 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,339 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,339 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,340 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,340 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,340 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,340 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,340 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,340 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,341 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,341 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,341 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,341 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,341 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,342 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,342 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,342 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,342 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,342 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:58:04,361 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-16 04:58:04,382 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 04:58:04,383 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 04:58:04,383 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 04:58:04,383 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 04:58:04,383 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 04:58:04,383 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 04:58:04,383 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 04:58:04,384 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 04:58:04,396 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 85 places, 80 transitions, 170 flow [2020-10-16 04:58:04,437 INFO L129 PetriNetUnfolder]: 2/78 cut-off events. [2020-10-16 04:58:04,437 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:58:04,442 INFO L80 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 78 events. 2/78 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 57 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2020-10-16 04:58:04,442 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 80 transitions, 170 flow [2020-10-16 04:58:04,449 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 78 transitions, 162 flow [2020-10-16 04:58:04,451 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 04:58:04,454 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 78 transitions, 162 flow [2020-10-16 04:58:04,457 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 78 transitions, 162 flow [2020-10-16 04:58:04,457 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 83 places, 78 transitions, 162 flow [2020-10-16 04:58:04,478 INFO L129 PetriNetUnfolder]: 2/78 cut-off events. [2020-10-16 04:58:04,478 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:58:04,479 INFO L80 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 78 events. 2/78 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 57 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2020-10-16 04:58:04,481 INFO L117 LiptonReduction]: Number of co-enabled transitions 1088 [2020-10-16 04:58:04,941 WARN L193 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 04:58:05,054 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-16 04:58:05,083 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:58:05,083 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:05,085 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:05,086 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:05,090 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:05,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:58:05,094 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:58:05,095 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:58:05,120 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:58:05,121 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:05,122 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:05,123 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:05,127 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:05,127 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:58:05,130 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:58:05,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:58:05,206 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:05,206 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:05,213 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:58:05,213 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:05,215 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:58:05,216 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:05,218 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:58:05,219 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:05,222 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:58:05,222 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:05,224 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:58:05,224 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:05,227 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:58:05,227 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:05,288 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:58:05,289 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:58:05,291 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:58:05,292 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:05,324 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:05,325 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:05,325 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:05,326 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:05,328 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:05,328 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:58:05,331 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:58:05,331 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:58:05,348 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:58:05,348 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:05,350 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:05,350 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:05,352 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:05,352 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:58:05,354 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:58:05,355 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:58:05,410 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:58:05,411 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:05,419 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:58:05,419 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:05,420 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:58:05,421 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:05,422 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:58:05,422 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:05,424 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:58:05,425 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:05,426 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:58:05,426 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:05,428 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:58:05,429 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:05,467 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:58:05,467 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:58:05,470 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:58:05,470 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:05,517 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:58:05,517 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:58:05,520 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:58:05,520 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:05,555 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:05,555 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:05,563 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:58:05,563 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:05,564 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:58:05,565 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:05,567 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:58:05,568 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:05,569 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:58:05,570 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:05,571 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:58:05,572 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:05,574 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:58:05,574 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:05,658 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:58:05,659 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:05,659 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:05,660 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:05,697 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:05,698 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:58:05,702 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:58:05,702 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:58:05,727 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:05,728 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:05,730 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:05,730 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:05,732 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:05,732 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:58:05,734 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:58:05,736 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:58:05,808 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:05,809 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:05,810 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:05,810 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:05,814 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:05,815 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:58:05,817 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:58:05,817 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:58:05,832 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:05,833 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:05,833 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:05,834 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:05,835 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:05,835 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:58:05,837 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:58:05,837 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:58:05,870 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:58:05,870 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:05,898 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:58:05,899 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:58:05,901 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:58:05,901 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:05,929 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:05,929 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:05,931 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:58:05,931 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:05,932 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:58:05,932 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:05,933 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:58:05,934 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:05,936 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:58:05,936 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:05,937 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:58:05,937 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:05,938 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:58:05,938 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:06,096 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:58:06,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:06,118 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:58:06,118 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:06,145 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:58:06,145 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:06,269 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:58:06,269 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:06,283 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:58:06,284 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:06,287 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:58:06,287 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:06,289 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:58:06,289 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:06,292 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:58:06,293 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:06,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:58:06,297 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:06,302 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:58:06,303 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:06,351 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:58:06,351 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:58:06,353 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:58:06,353 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:06,385 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:58:06,385 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:06,386 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:06,386 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:06,388 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:06,388 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:58:06,389 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:58:06,390 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:58:06,408 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:58:06,408 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:06,409 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:06,409 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:06,411 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:06,411 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:58:06,412 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:58:06,413 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:58:06,470 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:58:06,470 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:06,479 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:58:06,480 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:06,481 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:58:06,482 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:06,482 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:58:06,483 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:06,484 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:58:06,485 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:06,486 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:58:06,486 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:06,488 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:58:06,488 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:06,537 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:58:06,537 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:58:06,540 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:58:06,540 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:06,583 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:58:06,583 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:58:06,585 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:58:06,586 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:06,612 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:58:06,612 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:06,620 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:58:06,620 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:06,622 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:58:06,622 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:06,623 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:58:06,624 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:06,625 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:58:06,625 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:06,626 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:58:06,626 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:06,627 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:58:06,628 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:06,913 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 04:58:06,976 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:58:06,976 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:06,994 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:58:06,994 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:07,028 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:58:07,029 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:58:07,031 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:58:07,031 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:07,063 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:07,063 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:07,069 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:58:07,070 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:07,071 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:58:07,071 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:07,072 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:58:07,072 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:07,074 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:58:07,074 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:07,076 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:58:07,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:07,077 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:58:07,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:07,169 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:58:07,170 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:07,241 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 04:58:07,241 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:07,242 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 04:58:07,242 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:07,245 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:58:07,245 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:58:07,247 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 04:58:07,248 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:07,274 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:58:07,275 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:07,286 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:58:07,286 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:07,287 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:58:07,288 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:07,290 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:58:07,290 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:07,291 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:58:07,292 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:07,293 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:58:07,294 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:07,295 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 04:58:07,295 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:07,297 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-16 04:58:07,297 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:07,299 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-16 04:58:07,299 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:07,449 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:58:07,450 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:07,450 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:07,451 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:07,452 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:07,452 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:58:07,454 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:58:07,454 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:58:07,473 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:07,473 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:07,474 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:07,474 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:07,475 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:07,476 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:58:07,477 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:58:07,477 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:58:07,518 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:07,518 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:07,520 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:58:07,521 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:07,521 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:58:07,522 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:07,524 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:58:07,525 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:07,526 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:58:07,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:07,528 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:58:07,528 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:07,530 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 04:58:07,530 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:07,532 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-16 04:58:07,532 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:07,534 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-16 04:58:07,534 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:07,572 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 04:58:07,572 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:07,573 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 04:58:07,573 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:07,575 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:58:07,576 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:58:07,578 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 04:58:07,578 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:09,088 WARN L193 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-10-16 04:58:09,103 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-10-16 04:58:09,103 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:09,104 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 04:58:09,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:10,241 WARN L193 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 145 DAG size of output: 125 [2020-10-16 04:58:10,974 WARN L193 SmtUtils]: Spent 674.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 110 [2020-10-16 04:58:11,317 WARN L193 SmtUtils]: Spent 341.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-10-16 04:58:12,078 WARN L193 SmtUtils]: Spent 759.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 127 [2020-10-16 04:58:12,402 WARN L193 SmtUtils]: Spent 321.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2020-10-16 04:58:12,672 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-10-16 04:58:13,144 WARN L193 SmtUtils]: Spent 332.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-10-16 04:58:13,490 WARN L193 SmtUtils]: Spent 343.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2020-10-16 04:58:13,740 WARN L193 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2020-10-16 04:58:13,847 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-10-16 04:58:13,852 INFO L132 LiptonReduction]: Checked pairs total: 3121 [2020-10-16 04:58:13,852 INFO L134 LiptonReduction]: Total number of compositions: 64 [2020-10-16 04:58:13,855 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9406 [2020-10-16 04:58:13,861 INFO L129 PetriNetUnfolder]: 0/12 cut-off events. [2020-10-16 04:58:13,861 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:58:13,862 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:58:13,862 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2020-10-16 04:58:13,863 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:58:13,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:58:13,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1713594894, now seen corresponding path program 1 times [2020-10-16 04:58:13,876 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:58:13,877 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864778677] [2020-10-16 04:58:13,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:58:14,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:58:14,135 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:58:14,136 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864778677] [2020-10-16 04:58:14,137 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:58:14,137 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:58:14,137 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546021520] [2020-10-16 04:58:14,146 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:58:14,146 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:58:14,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:58:14,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:58:14,162 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 144 [2020-10-16 04:58:14,164 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 20 transitions, 46 flow. Second operand 3 states. [2020-10-16 04:58:14,164 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:58:14,164 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 144 [2020-10-16 04:58:14,166 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:58:14,305 INFO L129 PetriNetUnfolder]: 74/156 cut-off events. [2020-10-16 04:58:14,305 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:58:14,306 INFO L80 FinitePrefix]: Finished finitePrefix Result has 298 conditions, 156 events. 74/156 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 598 event pairs, 6 based on Foata normal form. 0/139 useless extension candidates. Maximal degree in co-relation 289. Up to 117 conditions per place. [2020-10-16 04:58:14,309 INFO L132 encePairwiseOnDemand]: 141/144 looper letters, 11 selfloop transitions, 2 changer transitions 2/24 dead transitions. [2020-10-16 04:58:14,309 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 24 transitions, 84 flow [2020-10-16 04:58:14,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:58:14,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:58:14,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2020-10-16 04:58:14,326 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8356481481481481 [2020-10-16 04:58:14,327 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 361 transitions. [2020-10-16 04:58:14,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 361 transitions. [2020-10-16 04:58:14,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:58:14,332 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 361 transitions. [2020-10-16 04:58:14,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:58:14,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:58:14,343 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:58:14,345 INFO L185 Difference]: Start difference. First operand has 27 places, 20 transitions, 46 flow. Second operand 3 states and 361 transitions. [2020-10-16 04:58:14,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 24 transitions, 84 flow [2020-10-16 04:58:14,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 24 transitions, 82 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 04:58:14,350 INFO L241 Difference]: Finished difference. Result has 26 places, 18 transitions, 44 flow [2020-10-16 04:58:14,353 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=44, PETRI_PLACES=26, PETRI_TRANSITIONS=18} [2020-10-16 04:58:14,354 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, -1 predicate places. [2020-10-16 04:58:14,354 INFO L481 AbstractCegarLoop]: Abstraction has has 26 places, 18 transitions, 44 flow [2020-10-16 04:58:14,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:58:14,354 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:58:14,355 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:58:14,355 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 04:58:14,355 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:58:14,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:58:14,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1581845299, now seen corresponding path program 1 times [2020-10-16 04:58:14,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:58:14,356 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341441253] [2020-10-16 04:58:14,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:58:14,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:58:14,491 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:58:14,491 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341441253] [2020-10-16 04:58:14,492 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:58:14,492 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:58:14,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030449793] [2020-10-16 04:58:14,493 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:58:14,494 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:58:14,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:58:14,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:58:14,497 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 144 [2020-10-16 04:58:14,498 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 18 transitions, 44 flow. Second operand 3 states. [2020-10-16 04:58:14,498 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:58:14,498 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 144 [2020-10-16 04:58:14,498 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:58:14,519 INFO L129 PetriNetUnfolder]: 0/18 cut-off events. [2020-10-16 04:58:14,519 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:58:14,519 INFO L80 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 18 events. 0/18 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 21 event pairs, 0 based on Foata normal form. 1/19 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2020-10-16 04:58:14,519 INFO L132 encePairwiseOnDemand]: 141/144 looper letters, 1 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2020-10-16 04:58:14,520 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 18 transitions, 50 flow [2020-10-16 04:58:14,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:58:14,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:58:14,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2020-10-16 04:58:14,523 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8842592592592593 [2020-10-16 04:58:14,524 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 382 transitions. [2020-10-16 04:58:14,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 382 transitions. [2020-10-16 04:58:14,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:58:14,524 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 382 transitions. [2020-10-16 04:58:14,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:58:14,527 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:58:14,527 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:58:14,527 INFO L185 Difference]: Start difference. First operand has 26 places, 18 transitions, 44 flow. Second operand 3 states and 382 transitions. [2020-10-16 04:58:14,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 18 transitions, 50 flow [2020-10-16 04:58:14,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 18 transitions, 46 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 04:58:14,529 INFO L241 Difference]: Finished difference. Result has 26 places, 18 transitions, 48 flow [2020-10-16 04:58:14,529 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=48, PETRI_PLACES=26, PETRI_TRANSITIONS=18} [2020-10-16 04:58:14,530 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, -1 predicate places. [2020-10-16 04:58:14,530 INFO L481 AbstractCegarLoop]: Abstraction has has 26 places, 18 transitions, 48 flow [2020-10-16 04:58:14,530 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:58:14,530 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:58:14,530 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:58:14,530 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 04:58:14,530 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:58:14,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:58:14,531 INFO L82 PathProgramCache]: Analyzing trace with hash 372689921, now seen corresponding path program 1 times [2020-10-16 04:58:14,531 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:58:14,531 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542487251] [2020-10-16 04:58:14,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:58:14,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:58:14,617 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:58:14,617 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542487251] [2020-10-16 04:58:14,618 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:58:14,618 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:58:14,618 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518831381] [2020-10-16 04:58:14,618 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:58:14,619 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:58:14,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:58:14,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:58:14,620 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 144 [2020-10-16 04:58:14,621 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 18 transitions, 48 flow. Second operand 3 states. [2020-10-16 04:58:14,621 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:58:14,621 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 144 [2020-10-16 04:58:14,621 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:58:14,638 INFO L129 PetriNetUnfolder]: 0/18 cut-off events. [2020-10-16 04:58:14,639 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2020-10-16 04:58:14,639 INFO L80 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 18 events. 0/18 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 0 based on Foata normal form. 1/19 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2020-10-16 04:58:14,639 INFO L132 encePairwiseOnDemand]: 141/144 looper letters, 1 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2020-10-16 04:58:14,639 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 18 transitions, 54 flow [2020-10-16 04:58:14,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:58:14,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:58:14,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2020-10-16 04:58:14,642 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8842592592592593 [2020-10-16 04:58:14,642 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 382 transitions. [2020-10-16 04:58:14,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 382 transitions. [2020-10-16 04:58:14,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:58:14,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 382 transitions. [2020-10-16 04:58:14,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:58:14,645 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:58:14,645 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:58:14,645 INFO L185 Difference]: Start difference. First operand has 26 places, 18 transitions, 48 flow. Second operand 3 states and 382 transitions. [2020-10-16 04:58:14,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 18 transitions, 54 flow [2020-10-16 04:58:14,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 18 transitions, 50 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 04:58:14,646 INFO L241 Difference]: Finished difference. Result has 27 places, 18 transitions, 52 flow [2020-10-16 04:58:14,647 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=27, PETRI_TRANSITIONS=18} [2020-10-16 04:58:14,647 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 0 predicate places. [2020-10-16 04:58:14,647 INFO L481 AbstractCegarLoop]: Abstraction has has 27 places, 18 transitions, 52 flow [2020-10-16 04:58:14,647 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:58:14,647 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:58:14,647 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:58:14,648 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 04:58:14,648 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:58:14,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:58:14,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1331514732, now seen corresponding path program 1 times [2020-10-16 04:58:14,648 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:58:14,649 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216799903] [2020-10-16 04:58:14,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:58:14,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:58:14,976 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:58:14,977 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216799903] [2020-10-16 04:58:14,977 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:58:14,978 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:58:14,978 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003138562] [2020-10-16 04:58:14,978 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:58:14,978 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:58:14,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:58:14,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:58:14,980 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 144 [2020-10-16 04:58:14,981 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 18 transitions, 52 flow. Second operand 7 states. [2020-10-16 04:58:14,981 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:58:14,981 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 144 [2020-10-16 04:58:14,981 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:58:15,167 INFO L129 PetriNetUnfolder]: 50/115 cut-off events. [2020-10-16 04:58:15,168 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-10-16 04:58:15,169 INFO L80 FinitePrefix]: Finished finitePrefix Result has 257 conditions, 115 events. 50/115 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 409 event pairs, 37 based on Foata normal form. 2/115 useless extension candidates. Maximal degree in co-relation 246. Up to 83 conditions per place. [2020-10-16 04:58:15,170 INFO L132 encePairwiseOnDemand]: 140/144 looper letters, 13 selfloop transitions, 4 changer transitions 0/25 dead transitions. [2020-10-16 04:58:15,170 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 25 transitions, 104 flow [2020-10-16 04:58:15,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 04:58:15,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 04:58:15,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 410 transitions. [2020-10-16 04:58:15,173 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7118055555555556 [2020-10-16 04:58:15,173 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 410 transitions. [2020-10-16 04:58:15,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 410 transitions. [2020-10-16 04:58:15,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:58:15,174 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 410 transitions. [2020-10-16 04:58:15,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 04:58:15,176 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 04:58:15,176 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 04:58:15,176 INFO L185 Difference]: Start difference. First operand has 27 places, 18 transitions, 52 flow. Second operand 4 states and 410 transitions. [2020-10-16 04:58:15,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 25 transitions, 104 flow [2020-10-16 04:58:15,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 25 transitions, 93 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-16 04:58:15,178 INFO L241 Difference]: Finished difference. Result has 29 places, 20 transitions, 65 flow [2020-10-16 04:58:15,178 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=65, PETRI_PLACES=29, PETRI_TRANSITIONS=20} [2020-10-16 04:58:15,179 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 2 predicate places. [2020-10-16 04:58:15,179 INFO L481 AbstractCegarLoop]: Abstraction has has 29 places, 20 transitions, 65 flow [2020-10-16 04:58:15,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:58:15,179 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:58:15,179 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:58:15,179 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 04:58:15,179 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:58:15,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:58:15,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1586483592, now seen corresponding path program 1 times [2020-10-16 04:58:15,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:58:15,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759685695] [2020-10-16 04:58:15,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:58:15,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:58:15,278 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:58:15,279 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759685695] [2020-10-16 04:58:15,279 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:58:15,279 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:58:15,279 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799819519] [2020-10-16 04:58:15,280 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:58:15,280 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:58:15,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:58:15,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:58:15,281 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 144 [2020-10-16 04:58:15,282 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 20 transitions, 65 flow. Second operand 4 states. [2020-10-16 04:58:15,282 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:58:15,282 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 144 [2020-10-16 04:58:15,282 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:58:15,326 INFO L129 PetriNetUnfolder]: 7/44 cut-off events. [2020-10-16 04:58:15,327 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-10-16 04:58:15,327 INFO L80 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 44 events. 7/44 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 122 event pairs, 2 based on Foata normal form. 5/48 useless extension candidates. Maximal degree in co-relation 82. Up to 18 conditions per place. [2020-10-16 04:58:15,328 INFO L132 encePairwiseOnDemand]: 139/144 looper letters, 4 selfloop transitions, 5 changer transitions 3/27 dead transitions. [2020-10-16 04:58:15,328 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 27 transitions, 103 flow [2020-10-16 04:58:15,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:58:15,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:58:15,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 599 transitions. [2020-10-16 04:58:15,331 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8319444444444445 [2020-10-16 04:58:15,331 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 599 transitions. [2020-10-16 04:58:15,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 599 transitions. [2020-10-16 04:58:15,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:58:15,332 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 599 transitions. [2020-10-16 04:58:15,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:58:15,335 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:58:15,335 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:58:15,336 INFO L185 Difference]: Start difference. First operand has 29 places, 20 transitions, 65 flow. Second operand 5 states and 599 transitions. [2020-10-16 04:58:15,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 27 transitions, 103 flow [2020-10-16 04:58:15,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 27 transitions, 100 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 04:58:15,338 INFO L241 Difference]: Finished difference. Result has 35 places, 24 transitions, 99 flow [2020-10-16 04:58:15,338 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=99, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2020-10-16 04:58:15,338 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 8 predicate places. [2020-10-16 04:58:15,338 INFO L481 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 99 flow [2020-10-16 04:58:15,339 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:58:15,339 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:58:15,339 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:58:15,339 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 04:58:15,339 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:58:15,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:58:15,340 INFO L82 PathProgramCache]: Analyzing trace with hash 213637660, now seen corresponding path program 1 times [2020-10-16 04:58:15,340 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:58:15,340 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140180174] [2020-10-16 04:58:15,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:58:15,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:58:15,716 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 25 [2020-10-16 04:58:16,015 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:58:16,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140180174] [2020-10-16 04:58:16,016 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:58:16,016 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 04:58:16,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056470054] [2020-10-16 04:58:16,017 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 04:58:16,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:58:16,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 04:58:16,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-10-16 04:58:16,019 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 144 [2020-10-16 04:58:16,019 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 99 flow. Second operand 10 states. [2020-10-16 04:58:16,020 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:58:16,020 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 144 [2020-10-16 04:58:16,020 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:58:16,380 INFO L129 PetriNetUnfolder]: 105/233 cut-off events. [2020-10-16 04:58:16,380 INFO L130 PetriNetUnfolder]: For 181/185 co-relation queries the response was YES. [2020-10-16 04:58:16,381 INFO L80 FinitePrefix]: Finished finitePrefix Result has 689 conditions, 233 events. 105/233 cut-off events. For 181/185 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 935 event pairs, 23 based on Foata normal form. 6/238 useless extension candidates. Maximal degree in co-relation 673. Up to 150 conditions per place. [2020-10-16 04:58:16,382 INFO L132 encePairwiseOnDemand]: 133/144 looper letters, 16 selfloop transitions, 14 changer transitions 24/59 dead transitions. [2020-10-16 04:58:16,383 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 59 transitions, 349 flow [2020-10-16 04:58:16,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 04:58:16,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 04:58:16,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 819 transitions. [2020-10-16 04:58:16,391 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6319444444444444 [2020-10-16 04:58:16,392 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 819 transitions. [2020-10-16 04:58:16,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 819 transitions. [2020-10-16 04:58:16,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:58:16,392 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 819 transitions. [2020-10-16 04:58:16,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 04:58:16,397 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 04:58:16,397 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 04:58:16,397 INFO L185 Difference]: Start difference. First operand has 35 places, 24 transitions, 99 flow. Second operand 9 states and 819 transitions. [2020-10-16 04:58:16,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 59 transitions, 349 flow [2020-10-16 04:58:16,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 59 transitions, 349 flow, removed 0 selfloop flow, removed 0 redundant places. [2020-10-16 04:58:16,401 INFO L241 Difference]: Finished difference. Result has 47 places, 33 transitions, 178 flow [2020-10-16 04:58:16,401 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=178, PETRI_PLACES=47, PETRI_TRANSITIONS=33} [2020-10-16 04:58:16,401 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 20 predicate places. [2020-10-16 04:58:16,401 INFO L481 AbstractCegarLoop]: Abstraction has has 47 places, 33 transitions, 178 flow [2020-10-16 04:58:16,402 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 04:58:16,402 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:58:16,402 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:58:16,402 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 04:58:16,402 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:58:16,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:58:16,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1201870470, now seen corresponding path program 2 times [2020-10-16 04:58:16,403 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:58:16,403 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196139047] [2020-10-16 04:58:16,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:58:16,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:58:16,792 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:58:16,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196139047] [2020-10-16 04:58:16,793 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:58:16,793 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 04:58:16,793 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057650522] [2020-10-16 04:58:16,794 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 04:58:16,794 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:58:16,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 04:58:16,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-16 04:58:16,795 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 144 [2020-10-16 04:58:16,796 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 33 transitions, 178 flow. Second operand 8 states. [2020-10-16 04:58:16,797 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:58:16,797 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 144 [2020-10-16 04:58:16,797 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:58:17,212 INFO L129 PetriNetUnfolder]: 55/179 cut-off events. [2020-10-16 04:58:17,212 INFO L130 PetriNetUnfolder]: For 298/309 co-relation queries the response was YES. [2020-10-16 04:58:17,215 INFO L80 FinitePrefix]: Finished finitePrefix Result has 624 conditions, 179 events. 55/179 cut-off events. For 298/309 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 856 event pairs, 19 based on Foata normal form. 7/184 useless extension candidates. Maximal degree in co-relation 602. Up to 58 conditions per place. [2020-10-16 04:58:17,220 INFO L132 encePairwiseOnDemand]: 134/144 looper letters, 24 selfloop transitions, 14 changer transitions 2/52 dead transitions. [2020-10-16 04:58:17,220 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 52 transitions, 358 flow [2020-10-16 04:58:17,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:58:17,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:58:17,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 705 transitions. [2020-10-16 04:58:17,224 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6994047619047619 [2020-10-16 04:58:17,224 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 705 transitions. [2020-10-16 04:58:17,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 705 transitions. [2020-10-16 04:58:17,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:58:17,225 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 705 transitions. [2020-10-16 04:58:17,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:58:17,229 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:58:17,230 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:58:17,230 INFO L185 Difference]: Start difference. First operand has 47 places, 33 transitions, 178 flow. Second operand 7 states and 705 transitions. [2020-10-16 04:58:17,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 52 transitions, 358 flow [2020-10-16 04:58:17,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 52 transitions, 330 flow, removed 14 selfloop flow, removed 4 redundant places. [2020-10-16 04:58:17,240 INFO L241 Difference]: Finished difference. Result has 48 places, 43 transitions, 277 flow [2020-10-16 04:58:17,241 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=277, PETRI_PLACES=48, PETRI_TRANSITIONS=43} [2020-10-16 04:58:17,241 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 21 predicate places. [2020-10-16 04:58:17,241 INFO L481 AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 277 flow [2020-10-16 04:58:17,241 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 04:58:17,241 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:58:17,241 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:58:17,242 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 04:58:17,242 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:58:17,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:58:17,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1379510288, now seen corresponding path program 3 times [2020-10-16 04:58:17,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:58:17,244 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412287604] [2020-10-16 04:58:17,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:58:17,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:58:17,381 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:58:17,381 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412287604] [2020-10-16 04:58:17,382 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:58:17,382 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:58:17,383 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541974910] [2020-10-16 04:58:17,383 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:58:17,383 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:58:17,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:58:17,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:58:17,385 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 144 [2020-10-16 04:58:17,386 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 277 flow. Second operand 5 states. [2020-10-16 04:58:17,386 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:58:17,386 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 144 [2020-10-16 04:58:17,386 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:58:17,451 INFO L129 PetriNetUnfolder]: 25/116 cut-off events. [2020-10-16 04:58:17,451 INFO L130 PetriNetUnfolder]: For 148/160 co-relation queries the response was YES. [2020-10-16 04:58:17,452 INFO L80 FinitePrefix]: Finished finitePrefix Result has 412 conditions, 116 events. 25/116 cut-off events. For 148/160 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 513 event pairs, 5 based on Foata normal form. 26/142 useless extension candidates. Maximal degree in co-relation 388. Up to 39 conditions per place. [2020-10-16 04:58:17,452 INFO L132 encePairwiseOnDemand]: 139/144 looper letters, 2 selfloop transitions, 8 changer transitions 2/45 dead transitions. [2020-10-16 04:58:17,452 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 45 transitions, 307 flow [2020-10-16 04:58:17,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 04:58:17,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 04:58:17,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 714 transitions. [2020-10-16 04:58:17,456 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8263888888888888 [2020-10-16 04:58:17,457 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 714 transitions. [2020-10-16 04:58:17,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 714 transitions. [2020-10-16 04:58:17,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:58:17,458 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 714 transitions. [2020-10-16 04:58:17,459 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 04:58:17,461 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 04:58:17,461 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 04:58:17,461 INFO L185 Difference]: Start difference. First operand has 48 places, 43 transitions, 277 flow. Second operand 6 states and 714 transitions. [2020-10-16 04:58:17,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 45 transitions, 307 flow [2020-10-16 04:58:17,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 45 transitions, 282 flow, removed 7 selfloop flow, removed 3 redundant places. [2020-10-16 04:58:17,466 INFO L241 Difference]: Finished difference. Result has 53 places, 43 transitions, 280 flow [2020-10-16 04:58:17,467 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=280, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2020-10-16 04:58:17,467 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 26 predicate places. [2020-10-16 04:58:17,467 INFO L481 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 280 flow [2020-10-16 04:58:17,467 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:58:17,467 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:58:17,467 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:58:17,468 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 04:58:17,468 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:58:17,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:58:17,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1691073771, now seen corresponding path program 1 times [2020-10-16 04:58:17,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:58:17,469 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457139288] [2020-10-16 04:58:17,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:58:17,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:58:17,562 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:58:17,563 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457139288] [2020-10-16 04:58:17,563 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:58:17,563 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:58:17,563 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691476115] [2020-10-16 04:58:17,564 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:58:17,564 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:58:17,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:58:17,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:58:17,565 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 144 [2020-10-16 04:58:17,566 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 280 flow. Second operand 4 states. [2020-10-16 04:58:17,566 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:58:17,566 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 144 [2020-10-16 04:58:17,566 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:58:17,617 INFO L129 PetriNetUnfolder]: 29/143 cut-off events. [2020-10-16 04:58:17,617 INFO L130 PetriNetUnfolder]: For 214/223 co-relation queries the response was YES. [2020-10-16 04:58:17,619 INFO L80 FinitePrefix]: Finished finitePrefix Result has 518 conditions, 143 events. 29/143 cut-off events. For 214/223 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 710 event pairs, 7 based on Foata normal form. 4/145 useless extension candidates. Maximal degree in co-relation 492. Up to 51 conditions per place. [2020-10-16 04:58:17,619 INFO L132 encePairwiseOnDemand]: 141/144 looper letters, 3 selfloop transitions, 1 changer transitions 18/44 dead transitions. [2020-10-16 04:58:17,619 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 44 transitions, 292 flow [2020-10-16 04:58:17,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 04:58:17,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 04:58:17,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 490 transitions. [2020-10-16 04:58:17,623 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8506944444444444 [2020-10-16 04:58:17,623 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 490 transitions. [2020-10-16 04:58:17,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 490 transitions. [2020-10-16 04:58:17,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:58:17,625 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 490 transitions. [2020-10-16 04:58:17,626 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 04:58:17,627 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 04:58:17,627 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 04:58:17,628 INFO L185 Difference]: Start difference. First operand has 53 places, 43 transitions, 280 flow. Second operand 4 states and 490 transitions. [2020-10-16 04:58:17,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 44 transitions, 292 flow [2020-10-16 04:58:17,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 44 transitions, 269 flow, removed 5 selfloop flow, removed 5 redundant places. [2020-10-16 04:58:17,633 INFO L241 Difference]: Finished difference. Result has 52 places, 26 transitions, 147 flow [2020-10-16 04:58:17,633 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=47, 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=147, PETRI_PLACES=52, PETRI_TRANSITIONS=26} [2020-10-16 04:58:17,633 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 25 predicate places. [2020-10-16 04:58:17,633 INFO L481 AbstractCegarLoop]: Abstraction has has 52 places, 26 transitions, 147 flow [2020-10-16 04:58:17,633 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:58:17,633 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:58:17,634 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:58:17,634 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 04:58:17,634 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:58:17,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:58:17,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1950887199, now seen corresponding path program 2 times [2020-10-16 04:58:17,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:58:17,635 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48267178] [2020-10-16 04:58:17,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:58:17,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:58:18,312 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 32 [2020-10-16 04:58:18,513 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 37 [2020-10-16 04:58:19,143 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:58:19,143 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48267178] [2020-10-16 04:58:19,143 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:58:19,144 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-16 04:58:19,144 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133595286] [2020-10-16 04:58:19,144 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-16 04:58:19,144 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:58:19,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-16 04:58:19,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2020-10-16 04:58:19,147 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 144 [2020-10-16 04:58:19,150 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 26 transitions, 147 flow. Second operand 14 states. [2020-10-16 04:58:19,150 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:58:19,150 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 144 [2020-10-16 04:58:19,150 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:58:19,735 INFO L129 PetriNetUnfolder]: 18/71 cut-off events. [2020-10-16 04:58:19,735 INFO L130 PetriNetUnfolder]: For 110/119 co-relation queries the response was YES. [2020-10-16 04:58:19,736 INFO L80 FinitePrefix]: Finished finitePrefix Result has 291 conditions, 71 events. 18/71 cut-off events. For 110/119 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 199 event pairs, 0 based on Foata normal form. 3/73 useless extension candidates. Maximal degree in co-relation 271. Up to 26 conditions per place. [2020-10-16 04:58:19,736 INFO L132 encePairwiseOnDemand]: 135/144 looper letters, 14 selfloop transitions, 13 changer transitions 12/44 dead transitions. [2020-10-16 04:58:19,737 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 44 transitions, 335 flow [2020-10-16 04:58:19,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-16 04:58:19,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-16 04:58:19,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 835 transitions. [2020-10-16 04:58:19,743 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5798611111111112 [2020-10-16 04:58:19,743 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 835 transitions. [2020-10-16 04:58:19,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 835 transitions. [2020-10-16 04:58:19,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:58:19,745 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 835 transitions. [2020-10-16 04:58:19,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-16 04:58:19,752 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-16 04:58:19,752 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-16 04:58:19,752 INFO L185 Difference]: Start difference. First operand has 52 places, 26 transitions, 147 flow. Second operand 10 states and 835 transitions. [2020-10-16 04:58:19,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 44 transitions, 335 flow [2020-10-16 04:58:19,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 44 transitions, 314 flow, removed 7 selfloop flow, removed 8 redundant places. [2020-10-16 04:58:19,756 INFO L241 Difference]: Finished difference. Result has 51 places, 32 transitions, 216 flow [2020-10-16 04:58:19,757 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=216, PETRI_PLACES=51, PETRI_TRANSITIONS=32} [2020-10-16 04:58:19,757 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 24 predicate places. [2020-10-16 04:58:19,757 INFO L481 AbstractCegarLoop]: Abstraction has has 51 places, 32 transitions, 216 flow [2020-10-16 04:58:19,757 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-16 04:58:19,757 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:58:19,757 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:58:19,757 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 04:58:19,758 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:58:19,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:58:19,758 INFO L82 PathProgramCache]: Analyzing trace with hash 2106326091, now seen corresponding path program 3 times [2020-10-16 04:58:19,758 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:58:19,759 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781729835] [2020-10-16 04:58:19,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:58:19,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:58:20,149 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 25 [2020-10-16 04:58:20,275 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:58:20,276 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781729835] [2020-10-16 04:58:20,276 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:58:20,276 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:58:20,277 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881252739] [2020-10-16 04:58:20,277 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:58:20,277 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:58:20,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:58:20,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:58:20,280 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 144 [2020-10-16 04:58:20,281 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 32 transitions, 216 flow. Second operand 7 states. [2020-10-16 04:58:20,281 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:58:20,281 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 144 [2020-10-16 04:58:20,282 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:58:20,505 INFO L129 PetriNetUnfolder]: 8/49 cut-off events. [2020-10-16 04:58:20,505 INFO L130 PetriNetUnfolder]: For 104/113 co-relation queries the response was YES. [2020-10-16 04:58:20,505 INFO L80 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 49 events. 8/49 cut-off events. For 104/113 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 107 event pairs, 0 based on Foata normal form. 1/49 useless extension candidates. Maximal degree in co-relation 199. Up to 18 conditions per place. [2020-10-16 04:58:20,506 INFO L132 encePairwiseOnDemand]: 137/144 looper letters, 9 selfloop transitions, 7 changer transitions 8/37 dead transitions. [2020-10-16 04:58:20,506 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 37 transitions, 290 flow [2020-10-16 04:58:20,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:58:20,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:58:20,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 676 transitions. [2020-10-16 04:58:20,510 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6706349206349206 [2020-10-16 04:58:20,510 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 676 transitions. [2020-10-16 04:58:20,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 676 transitions. [2020-10-16 04:58:20,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:58:20,511 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 676 transitions. [2020-10-16 04:58:20,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:58:20,514 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:58:20,514 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:58:20,515 INFO L185 Difference]: Start difference. First operand has 51 places, 32 transitions, 216 flow. Second operand 7 states and 676 transitions. [2020-10-16 04:58:20,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 37 transitions, 290 flow [2020-10-16 04:58:20,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 37 transitions, 256 flow, removed 17 selfloop flow, removed 4 redundant places. [2020-10-16 04:58:20,518 INFO L241 Difference]: Finished difference. Result has 53 places, 29 transitions, 195 flow [2020-10-16 04:58:20,518 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=195, PETRI_PLACES=53, PETRI_TRANSITIONS=29} [2020-10-16 04:58:20,518 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 26 predicate places. [2020-10-16 04:58:20,518 INFO L481 AbstractCegarLoop]: Abstraction has has 53 places, 29 transitions, 195 flow [2020-10-16 04:58:20,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:58:20,518 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:58:20,519 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:58:20,519 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 04:58:20,519 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:58:20,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:58:20,519 INFO L82 PathProgramCache]: Analyzing trace with hash 160263691, now seen corresponding path program 4 times [2020-10-16 04:58:20,519 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:58:20,520 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494636347] [2020-10-16 04:58:20,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:58:20,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:58:20,882 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 25 [2020-10-16 04:58:21,022 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 33 [2020-10-16 04:58:21,193 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-10-16 04:58:21,320 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 23 [2020-10-16 04:58:21,414 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:58:21,415 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494636347] [2020-10-16 04:58:21,415 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:58:21,415 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 04:58:21,415 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750955643] [2020-10-16 04:58:21,415 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 04:58:21,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:58:21,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 04:58:21,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-10-16 04:58:21,418 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 144 [2020-10-16 04:58:21,418 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 29 transitions, 195 flow. Second operand 9 states. [2020-10-16 04:58:21,418 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:58:21,419 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 144 [2020-10-16 04:58:21,419 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:58:21,757 INFO L129 PetriNetUnfolder]: 5/43 cut-off events. [2020-10-16 04:58:21,757 INFO L130 PetriNetUnfolder]: For 94/98 co-relation queries the response was YES. [2020-10-16 04:58:21,758 INFO L80 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 43 events. 5/43 cut-off events. For 94/98 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 85 event pairs, 0 based on Foata normal form. 2/45 useless extension candidates. Maximal degree in co-relation 170. Up to 10 conditions per place. [2020-10-16 04:58:21,758 INFO L132 encePairwiseOnDemand]: 136/144 looper letters, 4 selfloop transitions, 6 changer transitions 13/33 dead transitions. [2020-10-16 04:58:21,758 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 33 transitions, 263 flow [2020-10-16 04:58:21,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 04:58:21,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 04:58:21,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 863 transitions. [2020-10-16 04:58:21,764 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6658950617283951 [2020-10-16 04:58:21,764 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 863 transitions. [2020-10-16 04:58:21,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 863 transitions. [2020-10-16 04:58:21,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:58:21,765 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 863 transitions. [2020-10-16 04:58:21,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 04:58:21,770 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 04:58:21,770 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 04:58:21,771 INFO L185 Difference]: Start difference. First operand has 53 places, 29 transitions, 195 flow. Second operand 9 states and 863 transitions. [2020-10-16 04:58:21,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 33 transitions, 263 flow [2020-10-16 04:58:21,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 33 transitions, 212 flow, removed 14 selfloop flow, removed 10 redundant places. [2020-10-16 04:58:21,773 INFO L241 Difference]: Finished difference. Result has 53 places, 20 transitions, 114 flow [2020-10-16 04:58:21,774 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=114, PETRI_PLACES=53, PETRI_TRANSITIONS=20} [2020-10-16 04:58:21,774 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 26 predicate places. [2020-10-16 04:58:21,774 INFO L481 AbstractCegarLoop]: Abstraction has has 53 places, 20 transitions, 114 flow [2020-10-16 04:58:21,774 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 04:58:21,774 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:58:21,775 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:58:21,775 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 04:58:21,775 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:58:21,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:58:21,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1052438397, now seen corresponding path program 5 times [2020-10-16 04:58:21,776 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:58:21,776 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719762610] [2020-10-16 04:58:21,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:58:21,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:58:22,524 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:58:22,524 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719762610] [2020-10-16 04:58:22,525 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:58:22,525 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 04:58:22,525 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320993422] [2020-10-16 04:58:22,525 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 04:58:22,525 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:58:22,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 04:58:22,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-16 04:58:22,528 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 144 [2020-10-16 04:58:22,529 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 20 transitions, 114 flow. Second operand 9 states. [2020-10-16 04:58:22,530 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:58:22,530 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 144 [2020-10-16 04:58:22,530 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:58:22,931 INFO L129 PetriNetUnfolder]: 1/22 cut-off events. [2020-10-16 04:58:22,932 INFO L130 PetriNetUnfolder]: For 23/27 co-relation queries the response was YES. [2020-10-16 04:58:22,932 INFO L80 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 22 events. 1/22 cut-off events. For 23/27 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 13 event pairs, 0 based on Foata normal form. 2/24 useless extension candidates. Maximal degree in co-relation 79. Up to 4 conditions per place. [2020-10-16 04:58:22,933 INFO L132 encePairwiseOnDemand]: 137/144 looper letters, 0 selfloop transitions, 0 changer transitions 19/19 dead transitions. [2020-10-16 04:58:22,933 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 19 transitions, 128 flow [2020-10-16 04:58:22,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:58:22,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:58:22,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 640 transitions. [2020-10-16 04:58:22,939 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6349206349206349 [2020-10-16 04:58:22,939 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 640 transitions. [2020-10-16 04:58:22,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 640 transitions. [2020-10-16 04:58:22,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:58:22,941 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 640 transitions. [2020-10-16 04:58:22,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:58:22,946 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:58:22,946 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:58:22,946 INFO L185 Difference]: Start difference. First operand has 53 places, 20 transitions, 114 flow. Second operand 7 states and 640 transitions. [2020-10-16 04:58:22,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 19 transitions, 128 flow [2020-10-16 04:58:22,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 19 transitions, 90 flow, removed 6 selfloop flow, removed 15 redundant places. [2020-10-16 04:58:22,948 INFO L241 Difference]: Finished difference. Result has 38 places, 0 transitions, 0 flow [2020-10-16 04:58:22,948 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=38, PETRI_TRANSITIONS=0} [2020-10-16 04:58:22,949 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 11 predicate places. [2020-10-16 04:58:22,949 INFO L481 AbstractCegarLoop]: Abstraction has has 38 places, 0 transitions, 0 flow [2020-10-16 04:58:22,949 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 04:58:22,949 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 04:58:22,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 04:58:22 BasicIcfg [2020-10-16 04:58:22,956 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 04:58:22,966 INFO L168 Benchmark]: Toolchain (without parser) took 23057.47 ms. Allocated memory was 250.6 MB in the beginning and 675.8 MB in the end (delta: 425.2 MB). Free memory was 206.5 MB in the beginning and 492.4 MB in the end (delta: -285.9 MB). Peak memory consumption was 139.3 MB. Max. memory is 14.2 GB. [2020-10-16 04:58:22,966 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 250.6 MB. Free memory is still 227.0 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 04:58:22,967 INFO L168 Benchmark]: CACSL2BoogieTranslator took 779.85 ms. Allocated memory was 250.6 MB in the beginning and 312.5 MB in the end (delta: 61.9 MB). Free memory was 206.5 MB in the beginning and 255.7 MB in the end (delta: -49.2 MB). Peak memory consumption was 29.5 MB. Max. memory is 14.2 GB. [2020-10-16 04:58:22,973 INFO L168 Benchmark]: Boogie Procedure Inliner took 139.04 ms. Allocated memory is still 312.5 MB. Free memory was 255.7 MB in the beginning and 253.2 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:58:22,974 INFO L168 Benchmark]: Boogie Preprocessor took 66.29 ms. Allocated memory is still 312.5 MB. Free memory was 253.2 MB in the beginning and 250.7 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:58:22,975 INFO L168 Benchmark]: RCFGBuilder took 3344.51 ms. Allocated memory was 312.5 MB in the beginning and 429.9 MB in the end (delta: 117.4 MB). Free memory was 250.7 MB in the beginning and 391.1 MB in the end (delta: -140.5 MB). Peak memory consumption was 156.9 MB. Max. memory is 14.2 GB. [2020-10-16 04:58:22,976 INFO L168 Benchmark]: TraceAbstraction took 18721.90 ms. Allocated memory was 429.9 MB in the beginning and 675.8 MB in the end (delta: 245.9 MB). Free memory was 391.1 MB in the beginning and 492.4 MB in the end (delta: -101.3 MB). Peak memory consumption was 144.6 MB. Max. memory is 14.2 GB. [2020-10-16 04:58:22,990 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.26 ms. Allocated memory is still 250.6 MB. Free memory is still 227.0 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 779.85 ms. Allocated memory was 250.6 MB in the beginning and 312.5 MB in the end (delta: 61.9 MB). Free memory was 206.5 MB in the beginning and 255.7 MB in the end (delta: -49.2 MB). Peak memory consumption was 29.5 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 139.04 ms. Allocated memory is still 312.5 MB. Free memory was 255.7 MB in the beginning and 253.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 66.29 ms. Allocated memory is still 312.5 MB. Free memory was 253.2 MB in the beginning and 250.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 3344.51 ms. Allocated memory was 312.5 MB in the beginning and 429.9 MB in the end (delta: 117.4 MB). Free memory was 250.7 MB in the beginning and 391.1 MB in the end (delta: -140.5 MB). Peak memory consumption was 156.9 MB. Max. memory is 14.2 GB. * TraceAbstraction took 18721.90 ms. Allocated memory was 429.9 MB in the beginning and 675.8 MB in the end (delta: 245.9 MB). Free memory was 391.1 MB in the beginning and 492.4 MB in the end (delta: -101.3 MB). Peak memory consumption was 144.6 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 642 VarBasedMoverChecksPositive, 46 VarBasedMoverChecksNegative, 3 SemBasedMoverChecksPositive, 43 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 67 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 9.3s, 83 PlacesBefore, 27 PlacesAfterwards, 78 TransitionsBefore, 20 TransitionsAfterwards, 1088 CoEnabledTransitionPairs, 6 FixpointIterations, 30 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 2 ChoiceCompositions, 64 TotalNumberOfCompositions, 3121 MoverChecksTotal - PositiveResult [Line: 7]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 7]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 79 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: SAFE, OverallTime: 18.5s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.4s, HoareTripleCheckerStatistics: 56 SDtfs, 29 SDslu, 16 SDs, 0 SdLazy, 701 SolverSat, 119 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=280occurred in iteration=8, 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.6s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 178 NumberOfCodeBlocks, 178 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 165 ConstructedInterpolants, 0 QuantifiedInterpolants, 38607 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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 correct! Received shutdown request...