/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi001_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 10:16:57,850 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 10:16:57,852 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 10:16:57,886 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 10:16:57,886 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 10:16:57,889 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 10:16:57,891 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 10:16:57,896 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 10:16:57,898 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 10:16:57,902 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 10:16:57,904 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 10:16:57,906 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 10:16:57,906 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 10:16:57,908 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 10:16:57,910 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 10:16:57,911 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 10:16:57,914 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 10:16:57,915 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 10:16:57,918 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 10:16:57,927 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 10:16:57,928 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 10:16:57,929 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 10:16:57,930 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 10:16:57,930 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 10:16:57,932 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 10:16:57,932 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 10:16:57,933 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 10:16:57,933 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 10:16:57,934 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 10:16:57,934 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 10:16:57,934 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 10:16:57,935 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 10:16:57,936 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 10:16:57,936 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 10:16:57,937 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 10:16:57,937 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 10:16:57,938 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 10:16:57,938 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 10:16:57,938 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 10:16:57,939 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 10:16:57,939 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 10:16:57,940 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-03-26 10:16:57,960 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 10:16:57,960 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 10:16:57,961 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 10:16:57,961 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 10:16:57,961 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 10:16:57,962 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 10:16:57,962 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 10:16:57,962 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 10:16:57,962 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 10:16:57,962 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 10:16:57,962 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 10:16:57,962 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 10:16:57,963 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 10:16:57,963 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 10:16:57,963 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 10:16:57,963 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 10:16:57,963 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 10:16:57,963 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 10:16:57,963 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 10:16:57,964 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 10:16:57,964 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 10:16:57,964 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:16:57,964 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 10:16:57,964 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 10:16:57,964 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 10:16:57,964 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 10:16:57,965 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 10:16:57,965 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 10:16:57,965 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 10:16:57,965 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 10:16:57,965 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 10:16:58,257 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 10:16:58,277 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 10:16:58,279 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 10:16:58,280 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 10:16:58,282 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 10:16:58,283 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_power.opt.i [2021-03-26 10:16:58,343 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1813425ad/26d48067e26e40da84669da32394ca27/FLAGa145c104e [2021-03-26 10:16:59,024 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 10:16:59,025 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_power.opt.i [2021-03-26 10:16:59,042 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1813425ad/26d48067e26e40da84669da32394ca27/FLAGa145c104e [2021-03-26 10:16:59,340 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1813425ad/26d48067e26e40da84669da32394ca27 [2021-03-26 10:16:59,345 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 10:16:59,346 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 10:16:59,347 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 10:16:59,348 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 10:16:59,360 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 10:16:59,360 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:16:59" (1/1) ... [2021-03-26 10:16:59,361 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@337a145c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:16:59, skipping insertion in model container [2021-03-26 10:16:59,361 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:16:59" (1/1) ... [2021-03-26 10:16:59,367 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 10:16:59,412 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 10:16:59,542 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_power.opt.i[950,963] [2021-03-26 10:16:59,680 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:16:59,687 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 10:16:59,696 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_power.opt.i[950,963] [2021-03-26 10:16:59,731 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:16:59,790 INFO L208 MainTranslator]: Completed translation [2021-03-26 10:16:59,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:16:59 WrapperNode [2021-03-26 10:16:59,791 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 10:16:59,792 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 10:16:59,792 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 10:16:59,792 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 10:16:59,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:16:59" (1/1) ... [2021-03-26 10:16:59,828 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:16:59" (1/1) ... [2021-03-26 10:16:59,866 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 10:16:59,867 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 10:16:59,867 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 10:16:59,867 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 10:16:59,875 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:16:59" (1/1) ... [2021-03-26 10:16:59,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:16:59" (1/1) ... [2021-03-26 10:16:59,881 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:16:59" (1/1) ... [2021-03-26 10:16:59,881 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:16:59" (1/1) ... [2021-03-26 10:16:59,888 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:16:59" (1/1) ... [2021-03-26 10:16:59,898 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:16:59" (1/1) ... [2021-03-26 10:16:59,901 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:16:59" (1/1) ... [2021-03-26 10:16:59,904 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 10:16:59,905 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 10:16:59,905 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 10:16:59,905 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 10:16:59,906 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:16:59" (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 [2021-03-26 10:16:59,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 10:16:59,986 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 10:16:59,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 10:16:59,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 10:16:59,987 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 10:16:59,987 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 10:16:59,987 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 10:16:59,987 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 10:16:59,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 10:16:59,987 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 10:16:59,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 10:16:59,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 10:16:59,989 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 10:17:01,455 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 10:17:01,456 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 10:17:01,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:17:01 BoogieIcfgContainer [2021-03-26 10:17:01,458 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 10:17:01,460 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 10:17:01,460 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 10:17:01,463 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 10:17:01,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 10:16:59" (1/3) ... [2021-03-26 10:17:01,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f84c757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:17:01, skipping insertion in model container [2021-03-26 10:17:01,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:16:59" (2/3) ... [2021-03-26 10:17:01,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f84c757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:17:01, skipping insertion in model container [2021-03-26 10:17:01,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:17:01" (3/3) ... [2021-03-26 10:17:01,465 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi001_power.opt.i [2021-03-26 10:17:01,471 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 10:17:01,474 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 10:17:01,475 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 10:17:01,507 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,507 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,507 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,507 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,508 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,508 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,508 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,508 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,508 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,508 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,508 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,508 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,508 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,510 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,510 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,510 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,510 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,510 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,511 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,512 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,512 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,512 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,512 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,512 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,512 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,512 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,513 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,513 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,513 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,514 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,514 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,514 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,514 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,515 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,515 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,515 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,515 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,515 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,516 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,516 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,516 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,516 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,516 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,516 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,516 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,517 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,517 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,517 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,517 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,518 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,518 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,518 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,518 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,520 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,520 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,520 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,520 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,520 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,520 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,520 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,523 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,523 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,523 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,523 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,524 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,524 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,525 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,525 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:17:01,526 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 10:17:01,542 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-03-26 10:17:01,570 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 10:17:01,570 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 10:17:01,570 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 10:17:01,570 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 10:17:01,571 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 10:17:01,571 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 10:17:01,571 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 10:17:01,571 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 10:17:01,583 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 89 places, 84 transitions, 178 flow [2021-03-26 10:17:01,621 INFO L129 PetriNetUnfolder]: 2/82 cut-off events. [2021-03-26 10:17:01,621 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:17:01,638 INFO L84 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 82 events. 2/82 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 54 event pairs, 0 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2021-03-26 10:17:01,638 INFO L82 GeneralOperation]: Start removeDead. Operand has 89 places, 84 transitions, 178 flow [2021-03-26 10:17:01,641 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 82 transitions, 170 flow [2021-03-26 10:17:01,643 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:17:01,657 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 82 transitions, 170 flow [2021-03-26 10:17:01,660 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 82 transitions, 170 flow [2021-03-26 10:17:01,664 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 87 places, 82 transitions, 170 flow [2021-03-26 10:17:01,687 INFO L129 PetriNetUnfolder]: 2/82 cut-off events. [2021-03-26 10:17:01,687 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:17:01,688 INFO L84 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 82 events. 2/82 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 52 event pairs, 0 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2021-03-26 10:17:01,695 INFO L142 LiptonReduction]: Number of co-enabled transitions 1046 [2021-03-26 10:17:02,969 WARN L205 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 10:17:03,369 WARN L205 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 10:17:03,489 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-26 10:17:04,868 WARN L205 SmtUtils]: Spent 694.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2021-03-26 10:17:05,466 WARN L205 SmtUtils]: Spent 588.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 183 [2021-03-26 10:17:06,763 WARN L205 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 310 DAG size of output: 265 [2021-03-26 10:17:07,347 WARN L205 SmtUtils]: Spent 582.00 ms on a formula simplification that was a NOOP. DAG size: 262 [2021-03-26 10:17:07,714 INFO L154 LiptonReduction]: Checked pairs total: 1715 [2021-03-26 10:17:07,715 INFO L156 LiptonReduction]: Total number of compositions: 56 [2021-03-26 10:17:07,716 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6074 [2021-03-26 10:17:07,742 INFO L129 PetriNetUnfolder]: 0/16 cut-off events. [2021-03-26 10:17:07,743 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:17:07,743 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:17:07,743 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:17:07,744 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:17:07,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:17:07,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1574192890, now seen corresponding path program 1 times [2021-03-26 10:17:07,755 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:17:07,755 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314382356] [2021-03-26 10:17:07,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:17:07,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:17:07,978 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:17:07,979 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:17:07,980 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:17:07,980 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:17:07,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:17:07,986 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314382356] [2021-03-26 10:17:07,986 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:17:07,986 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:17:07,987 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588324519] [2021-03-26 10:17:07,993 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:17:07,993 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:17:08,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:17:08,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:17:08,005 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 140 [2021-03-26 10:17:08,007 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:17:08,007 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:17:08,007 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 140 [2021-03-26 10:17:08,008 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:17:08,072 INFO L129 PetriNetUnfolder]: 16/87 cut-off events. [2021-03-26 10:17:08,072 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:17:08,073 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 87 events. 16/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 288 event pairs, 6 based on Foata normal form. 6/86 useless extension candidates. Maximal degree in co-relation 112. Up to 27 conditions per place. [2021-03-26 10:17:08,075 INFO L132 encePairwiseOnDemand]: 136/140 looper letters, 7 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2021-03-26 10:17:08,075 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 33 transitions, 90 flow [2021-03-26 10:17:08,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:17:08,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:17:08,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2021-03-26 10:17:08,093 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8785714285714286 [2021-03-26 10:17:08,093 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 369 transitions. [2021-03-26 10:17:08,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 369 transitions. [2021-03-26 10:17:08,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:17:08,098 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 369 transitions. [2021-03-26 10:17:08,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:17:08,111 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:17:08,112 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:17:08,113 INFO L185 Difference]: Start difference. First operand has 39 places, 33 transitions, 72 flow. Second operand 3 states and 369 transitions. [2021-03-26 10:17:08,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 33 transitions, 90 flow [2021-03-26 10:17:08,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 33 transitions, 88 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:17:08,117 INFO L241 Difference]: Finished difference. Result has 37 places, 30 transitions, 68 flow [2021-03-26 10:17:08,119 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2021-03-26 10:17:08,120 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, -2 predicate places. [2021-03-26 10:17:08,120 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:17:08,120 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 30 transitions, 68 flow [2021-03-26 10:17:08,122 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 30 transitions, 68 flow [2021-03-26 10:17:08,122 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 30 transitions, 68 flow [2021-03-26 10:17:08,128 INFO L129 PetriNetUnfolder]: 0/30 cut-off events. [2021-03-26 10:17:08,128 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:17:08,129 INFO L84 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 30 events. 0/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 25 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 10:17:08,129 INFO L142 LiptonReduction]: Number of co-enabled transitions 218 [2021-03-26 10:17:08,629 WARN L205 SmtUtils]: Spent 319.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-26 10:17:08,896 WARN L205 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-26 10:17:09,465 WARN L205 SmtUtils]: Spent 566.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-26 10:17:10,063 WARN L205 SmtUtils]: Spent 597.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-26 10:17:10,606 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-26 10:17:10,712 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-26 10:17:11,213 WARN L205 SmtUtils]: Spent 340.00 ms on a formula simplification that was a NOOP. DAG size: 194 [2021-03-26 10:17:11,510 WARN L205 SmtUtils]: Spent 296.00 ms on a formula simplification that was a NOOP. DAG size: 194 [2021-03-26 10:17:12,145 WARN L205 SmtUtils]: Spent 632.00 ms on a formula simplification that was a NOOP. DAG size: 276 [2021-03-26 10:17:12,800 WARN L205 SmtUtils]: Spent 653.00 ms on a formula simplification that was a NOOP. DAG size: 276 [2021-03-26 10:17:13,405 INFO L154 LiptonReduction]: Checked pairs total: 651 [2021-03-26 10:17:13,405 INFO L156 LiptonReduction]: Total number of compositions: 13 [2021-03-26 10:17:13,405 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5285 [2021-03-26 10:17:13,406 INFO L480 AbstractCegarLoop]: Abstraction has has 25 places, 18 transitions, 44 flow [2021-03-26 10:17:13,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:17:13,407 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:17:13,407 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:17:13,407 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 10:17:13,407 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:17:13,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:17:13,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1071371314, now seen corresponding path program 1 times [2021-03-26 10:17:13,408 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:17:13,408 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581233287] [2021-03-26 10:17:13,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:17:13,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:17:13,552 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:17:13,553 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:17:13,553 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:17:13,554 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:17:13,825 WARN L205 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 4 [2021-03-26 10:17:13,826 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 10:17:13,826 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:17:13,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:17:13,830 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581233287] [2021-03-26 10:17:13,830 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:17:13,830 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:17:13,830 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584584897] [2021-03-26 10:17:13,831 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:17:13,831 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:17:13,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:17:13,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:17:13,833 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 153 [2021-03-26 10:17:13,834 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 18 transitions, 44 flow. Second operand has 4 states, 4 states have (on average 127.75) internal successors, (511), 4 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:17:13,834 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:17:13,834 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 153 [2021-03-26 10:17:13,834 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:17:14,079 INFO L129 PetriNetUnfolder]: 1/21 cut-off events. [2021-03-26 10:17:14,079 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:17:14,080 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 21 events. 1/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 34 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 26. Up to 3 conditions per place. [2021-03-26 10:17:14,080 INFO L132 encePairwiseOnDemand]: 149/153 looper letters, 1 selfloop transitions, 2 changer transitions 4/20 dead transitions. [2021-03-26 10:17:14,080 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 20 transitions, 60 flow [2021-03-26 10:17:14,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:17:14,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:17:14,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 642 transitions. [2021-03-26 10:17:14,088 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8392156862745098 [2021-03-26 10:17:14,088 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 642 transitions. [2021-03-26 10:17:14,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 642 transitions. [2021-03-26 10:17:14,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:17:14,090 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 642 transitions. [2021-03-26 10:17:14,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.4) internal successors, (642), 5 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:17:14,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 153.0) internal successors, (918), 6 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:17:14,097 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 153.0) internal successors, (918), 6 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:17:14,097 INFO L185 Difference]: Start difference. First operand has 25 places, 18 transitions, 44 flow. Second operand 5 states and 642 transitions. [2021-03-26 10:17:14,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 20 transitions, 60 flow [2021-03-26 10:17:14,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 20 transitions, 56 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:17:14,099 INFO L241 Difference]: Finished difference. Result has 28 places, 16 transitions, 44 flow [2021-03-26 10:17:14,099 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, 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=5, PETRI_FLOW=44, PETRI_PLACES=28, PETRI_TRANSITIONS=16} [2021-03-26 10:17:14,099 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, -11 predicate places. [2021-03-26 10:17:14,099 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:17:14,099 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 16 transitions, 44 flow [2021-03-26 10:17:14,100 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 16 transitions, 44 flow [2021-03-26 10:17:14,100 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 24 places, 16 transitions, 44 flow [2021-03-26 10:17:14,102 INFO L129 PetriNetUnfolder]: 0/16 cut-off events. [2021-03-26 10:17:14,103 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:17:14,103 INFO L84 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 16 events. 0/16 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 10:17:14,103 INFO L142 LiptonReduction]: Number of co-enabled transitions 92 [2021-03-26 10:17:14,510 WARN L205 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2021-03-26 10:17:14,617 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-03-26 10:17:14,874 WARN L205 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2021-03-26 10:17:14,979 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-03-26 10:17:14,981 INFO L154 LiptonReduction]: Checked pairs total: 222 [2021-03-26 10:17:14,981 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:17:14,981 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 882 [2021-03-26 10:17:14,982 INFO L480 AbstractCegarLoop]: Abstraction has has 23 places, 15 transitions, 42 flow [2021-03-26 10:17:14,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 127.75) internal successors, (511), 4 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:17:14,982 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:17:14,982 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:17:14,983 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 10:17:14,983 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:17:14,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:17:14,983 INFO L82 PathProgramCache]: Analyzing trace with hash -211704109, now seen corresponding path program 1 times [2021-03-26 10:17:14,983 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:17:14,983 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94806267] [2021-03-26 10:17:14,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:17:15,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:17:15,079 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:17:15,079 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:17:15,085 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:17:15,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:17:15,090 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:17:15,090 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:17:15,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:17:15,091 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94806267] [2021-03-26 10:17:15,091 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:17:15,091 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:17:15,091 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926097175] [2021-03-26 10:17:15,091 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:17:15,091 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:17:15,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:17:15,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:17:15,093 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 154 [2021-03-26 10:17:15,093 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 15 transitions, 42 flow. Second operand has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:17:15,093 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:17:15,093 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 154 [2021-03-26 10:17:15,093 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:17:15,124 INFO L129 PetriNetUnfolder]: 21/59 cut-off events. [2021-03-26 10:17:15,124 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-03-26 10:17:15,124 INFO L84 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 59 events. 21/59 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 171 event pairs, 11 based on Foata normal form. 1/60 useless extension candidates. Maximal degree in co-relation 111. Up to 40 conditions per place. [2021-03-26 10:17:15,125 INFO L132 encePairwiseOnDemand]: 150/154 looper letters, 8 selfloop transitions, 3 changer transitions 0/19 dead transitions. [2021-03-26 10:17:15,125 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 19 transitions, 72 flow [2021-03-26 10:17:15,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:17:15,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:17:15,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2021-03-26 10:17:15,132 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8116883116883117 [2021-03-26 10:17:15,132 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 375 transitions. [2021-03-26 10:17:15,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 375 transitions. [2021-03-26 10:17:15,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:17:15,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 375 transitions. [2021-03-26 10:17:15,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:17:15,134 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:17:15,135 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:17:15,135 INFO L185 Difference]: Start difference. First operand has 23 places, 15 transitions, 42 flow. Second operand 3 states and 375 transitions. [2021-03-26 10:17:15,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 19 transitions, 72 flow [2021-03-26 10:17:15,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 19 transitions, 68 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:17:15,136 INFO L241 Difference]: Finished difference. Result has 24 places, 17 transitions, 57 flow [2021-03-26 10:17:15,136 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=57, PETRI_PLACES=24, PETRI_TRANSITIONS=17} [2021-03-26 10:17:15,136 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, -15 predicate places. [2021-03-26 10:17:15,137 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:17:15,137 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 17 transitions, 57 flow [2021-03-26 10:17:15,137 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 17 transitions, 57 flow [2021-03-26 10:17:15,137 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 24 places, 17 transitions, 57 flow [2021-03-26 10:17:15,140 INFO L129 PetriNetUnfolder]: 3/23 cut-off events. [2021-03-26 10:17:15,140 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-03-26 10:17:15,141 INFO L84 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 23 events. 3/23 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 35 event pairs, 1 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 38. Up to 10 conditions per place. [2021-03-26 10:17:15,141 INFO L142 LiptonReduction]: Number of co-enabled transitions 94 [2021-03-26 10:17:15,170 INFO L154 LiptonReduction]: Checked pairs total: 92 [2021-03-26 10:17:15,170 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:17:15,170 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 33 [2021-03-26 10:17:15,171 INFO L480 AbstractCegarLoop]: Abstraction has has 24 places, 17 transitions, 57 flow [2021-03-26 10:17:15,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:17:15,172 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:17:15,172 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:17:15,172 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 10:17:15,172 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:17:15,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:17:15,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1079174078, now seen corresponding path program 1 times [2021-03-26 10:17:15,173 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:17:15,173 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702434116] [2021-03-26 10:17:15,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:17:15,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:17:15,296 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:17:15,297 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:17:15,300 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:17:15,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:17:15,306 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:17:15,306 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:17:15,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:17:15,307 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702434116] [2021-03-26 10:17:15,308 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:17:15,308 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:17:15,308 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015432227] [2021-03-26 10:17:15,308 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:17:15,308 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:17:15,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:17:15,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:17:15,309 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 154 [2021-03-26 10:17:15,310 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 17 transitions, 57 flow. Second operand has 4 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:17:15,310 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:17:15,310 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 154 [2021-03-26 10:17:15,310 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:17:15,334 INFO L129 PetriNetUnfolder]: 10/43 cut-off events. [2021-03-26 10:17:15,334 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2021-03-26 10:17:15,335 INFO L84 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 43 events. 10/43 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 117 event pairs, 4 based on Foata normal form. 5/47 useless extension candidates. Maximal degree in co-relation 86. Up to 19 conditions per place. [2021-03-26 10:17:15,335 INFO L132 encePairwiseOnDemand]: 149/154 looper letters, 4 selfloop transitions, 5 changer transitions 3/24 dead transitions. [2021-03-26 10:17:15,335 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 24 transitions, 95 flow [2021-03-26 10:17:15,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:17:15,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:17:15,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 654 transitions. [2021-03-26 10:17:15,337 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8493506493506493 [2021-03-26 10:17:15,337 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 654 transitions. [2021-03-26 10:17:15,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 654 transitions. [2021-03-26 10:17:15,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:17:15,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 654 transitions. [2021-03-26 10:17:15,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.8) internal successors, (654), 5 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:17:15,341 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 154.0) internal successors, (924), 6 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:17:15,342 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 154.0) internal successors, (924), 6 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:17:15,342 INFO L185 Difference]: Start difference. First operand has 24 places, 17 transitions, 57 flow. Second operand 5 states and 654 transitions. [2021-03-26 10:17:15,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 24 transitions, 95 flow [2021-03-26 10:17:15,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 24 transitions, 92 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 10:17:15,343 INFO L241 Difference]: Finished difference. Result has 30 places, 21 transitions, 91 flow [2021-03-26 10:17:15,343 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=91, PETRI_PLACES=30, PETRI_TRANSITIONS=21} [2021-03-26 10:17:15,343 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, -9 predicate places. [2021-03-26 10:17:15,343 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:17:15,343 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 21 transitions, 91 flow [2021-03-26 10:17:15,344 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 21 transitions, 91 flow [2021-03-26 10:17:15,344 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 30 places, 21 transitions, 91 flow [2021-03-26 10:17:15,350 INFO L129 PetriNetUnfolder]: 6/38 cut-off events. [2021-03-26 10:17:15,350 INFO L130 PetriNetUnfolder]: For 16/17 co-relation queries the response was YES. [2021-03-26 10:17:15,350 INFO L84 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 38 events. 6/38 cut-off events. For 16/17 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 94 event pairs, 2 based on Foata normal form. 1/38 useless extension candidates. Maximal degree in co-relation 88. Up to 12 conditions per place. [2021-03-26 10:17:15,350 INFO L142 LiptonReduction]: Number of co-enabled transitions 102 [2021-03-26 10:17:15,352 INFO L154 LiptonReduction]: Checked pairs total: 87 [2021-03-26 10:17:15,352 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:17:15,352 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9 [2021-03-26 10:17:15,353 INFO L480 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 91 flow [2021-03-26 10:17:15,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:17:15,353 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:17:15,353 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:17:15,354 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 10:17:15,354 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:17:15,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:17:15,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1386146829, now seen corresponding path program 1 times [2021-03-26 10:17:15,354 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:17:15,354 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423493309] [2021-03-26 10:17:15,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:17:15,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:17:15,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:17:15,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:17:15,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:17:15,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:17:15,449 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:17:15,449 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:17:15,454 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:17:15,455 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:17:15,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:17:15,455 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423493309] [2021-03-26 10:17:15,455 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:17:15,455 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:17:15,456 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245402794] [2021-03-26 10:17:15,456 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:17:15,456 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:17:15,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:17:15,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:17:15,461 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 154 [2021-03-26 10:17:15,462 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 91 flow. Second operand has 5 states, 5 states have (on average 128.8) internal successors, (644), 5 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:17:15,462 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:17:15,462 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 154 [2021-03-26 10:17:15,463 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:17:15,495 INFO L129 PetriNetUnfolder]: 3/29 cut-off events. [2021-03-26 10:17:15,496 INFO L130 PetriNetUnfolder]: For 30/41 co-relation queries the response was YES. [2021-03-26 10:17:15,496 INFO L84 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 29 events. 3/29 cut-off events. For 30/41 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 52 event pairs, 0 based on Foata normal form. 15/44 useless extension candidates. Maximal degree in co-relation 78. Up to 12 conditions per place. [2021-03-26 10:17:15,496 INFO L132 encePairwiseOnDemand]: 149/154 looper letters, 2 selfloop transitions, 8 changer transitions 2/24 dead transitions. [2021-03-26 10:17:15,496 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 24 transitions, 129 flow [2021-03-26 10:17:15,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:17:15,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:17:15,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 910 transitions. [2021-03-26 10:17:15,500 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8441558441558441 [2021-03-26 10:17:15,500 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 910 transitions. [2021-03-26 10:17:15,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 910 transitions. [2021-03-26 10:17:15,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:17:15,501 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 910 transitions. [2021-03-26 10:17:15,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 130.0) internal successors, (910), 7 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:17:15,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 154.0) internal successors, (1232), 8 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:17:15,506 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 154.0) internal successors, (1232), 8 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:17:15,506 INFO L185 Difference]: Start difference. First operand has 30 places, 21 transitions, 91 flow. Second operand 7 states and 910 transitions. [2021-03-26 10:17:15,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 24 transitions, 129 flow [2021-03-26 10:17:15,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 24 transitions, 123 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-26 10:17:15,508 INFO L241 Difference]: Finished difference. Result has 38 places, 22 transitions, 118 flow [2021-03-26 10:17:15,508 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=118, PETRI_PLACES=38, PETRI_TRANSITIONS=22} [2021-03-26 10:17:15,508 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, -1 predicate places. [2021-03-26 10:17:15,508 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:17:15,508 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 22 transitions, 118 flow [2021-03-26 10:17:15,508 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 22 transitions, 118 flow [2021-03-26 10:17:15,509 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 22 transitions, 118 flow [2021-03-26 10:17:15,513 INFO L129 PetriNetUnfolder]: 2/26 cut-off events. [2021-03-26 10:17:15,513 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-03-26 10:17:15,513 INFO L84 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 26 events. 2/26 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 38 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 71. Up to 10 conditions per place. [2021-03-26 10:17:15,514 INFO L142 LiptonReduction]: Number of co-enabled transitions 78 [2021-03-26 10:17:15,774 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 10:17:15,888 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 10:17:16,531 WARN L205 SmtUtils]: Spent 640.00 ms on a formula simplification. DAG size of input: 244 DAG size of output: 191 [2021-03-26 10:17:16,745 WARN L205 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2021-03-26 10:17:17,940 WARN L205 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 345 DAG size of output: 267 [2021-03-26 10:17:18,407 WARN L205 SmtUtils]: Spent 464.00 ms on a formula simplification that was a NOOP. DAG size: 249 [2021-03-26 10:17:18,411 INFO L154 LiptonReduction]: Checked pairs total: 194 [2021-03-26 10:17:18,412 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-26 10:17:18,412 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2904 [2021-03-26 10:17:18,413 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 18 transitions, 98 flow [2021-03-26 10:17:18,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 128.8) internal successors, (644), 5 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:17:18,413 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:17:18,414 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:17:18,414 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 10:17:18,414 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:17:18,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:17:18,414 INFO L82 PathProgramCache]: Analyzing trace with hash -380854954, now seen corresponding path program 1 times [2021-03-26 10:17:18,415 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:17:18,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620166395] [2021-03-26 10:17:18,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:17:18,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:17:18,493 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:17:18,494 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:17:18,494 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:17:18,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:17:18,497 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:17:18,497 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:17:18,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:17:18,501 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620166395] [2021-03-26 10:17:18,501 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:17:18,501 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:17:18,501 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613596088] [2021-03-26 10:17:18,501 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:17:18,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:17:18,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:17:18,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:17:18,503 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 156 [2021-03-26 10:17:18,503 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 18 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:17:18,504 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:17:18,504 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 156 [2021-03-26 10:17:18,504 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:17:18,527 INFO L129 PetriNetUnfolder]: 4/30 cut-off events. [2021-03-26 10:17:18,528 INFO L130 PetriNetUnfolder]: For 71/72 co-relation queries the response was YES. [2021-03-26 10:17:18,528 INFO L84 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 30 events. 4/30 cut-off events. For 71/72 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 61 event pairs, 0 based on Foata normal form. 2/32 useless extension candidates. Maximal degree in co-relation 81. Up to 10 conditions per place. [2021-03-26 10:17:18,528 INFO L132 encePairwiseOnDemand]: 153/156 looper letters, 3 selfloop transitions, 1 changer transitions 1/18 dead transitions. [2021-03-26 10:17:18,528 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 18 transitions, 101 flow [2021-03-26 10:17:18,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:17:18,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:17:18,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 514 transitions. [2021-03-26 10:17:18,530 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8237179487179487 [2021-03-26 10:17:18,530 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 514 transitions. [2021-03-26 10:17:18,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 514 transitions. [2021-03-26 10:17:18,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:17:18,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 514 transitions. [2021-03-26 10:17:18,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.5) internal successors, (514), 4 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:17:18,533 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 156.0) internal successors, (780), 5 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:17:18,533 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 156.0) internal successors, (780), 5 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:17:18,533 INFO L185 Difference]: Start difference. First operand has 35 places, 18 transitions, 98 flow. Second operand 4 states and 514 transitions. [2021-03-26 10:17:18,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 18 transitions, 101 flow [2021-03-26 10:17:18,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 18 transitions, 78 flow, removed 7 selfloop flow, removed 7 redundant places. [2021-03-26 10:17:18,535 INFO L241 Difference]: Finished difference. Result has 29 places, 17 transitions, 73 flow [2021-03-26 10:17:18,535 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=156, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=73, PETRI_PLACES=29, PETRI_TRANSITIONS=17} [2021-03-26 10:17:18,535 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, -10 predicate places. [2021-03-26 10:17:18,536 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:17:18,536 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 17 transitions, 73 flow [2021-03-26 10:17:18,536 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 17 transitions, 73 flow [2021-03-26 10:17:18,536 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 28 places, 17 transitions, 73 flow [2021-03-26 10:17:18,540 INFO L129 PetriNetUnfolder]: 2/22 cut-off events. [2021-03-26 10:17:18,540 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2021-03-26 10:17:18,540 INFO L84 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 22 events. 2/22 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 23 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 45. Up to 6 conditions per place. [2021-03-26 10:17:18,540 INFO L142 LiptonReduction]: Number of co-enabled transitions 36 [2021-03-26 10:17:18,741 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2021-03-26 10:17:19,116 WARN L205 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 89 [2021-03-26 10:17:19,240 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-03-26 10:17:19,242 INFO L154 LiptonReduction]: Checked pairs total: 34 [2021-03-26 10:17:19,243 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 10:17:19,243 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 707 [2021-03-26 10:17:19,244 INFO L480 AbstractCegarLoop]: Abstraction has has 27 places, 16 transitions, 76 flow [2021-03-26 10:17:19,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:17:19,244 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:17:19,244 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:17:19,244 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 10:17:19,244 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:17:19,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:17:19,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1823325194, now seen corresponding path program 1 times [2021-03-26 10:17:19,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:17:19,245 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644215863] [2021-03-26 10:17:19,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:17:19,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:17:19,267 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:17:19,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:17:19,291 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:17:19,471 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 10:17:19,471 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 10:17:19,472 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 10:17:19,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 10:17:19 BasicIcfg [2021-03-26 10:17:19,978 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 10:17:19,979 INFO L168 Benchmark]: Toolchain (without parser) took 20632.47 ms. Allocated memory was 255.9 MB in the beginning and 658.5 MB in the end (delta: 402.7 MB). Free memory was 234.9 MB in the beginning and 377.1 MB in the end (delta: -142.2 MB). Peak memory consumption was 258.9 MB. Max. memory is 16.0 GB. [2021-03-26 10:17:19,979 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 255.9 MB. Free memory is still 238.0 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 10:17:19,980 INFO L168 Benchmark]: CACSL2BoogieTranslator took 443.72 ms. Allocated memory was 255.9 MB in the beginning and 348.1 MB in the end (delta: 92.3 MB). Free memory was 234.9 MB in the beginning and 308.0 MB in the end (delta: -73.0 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-26 10:17:19,980 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.68 ms. Allocated memory is still 348.1 MB. Free memory was 308.0 MB in the beginning and 305.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:17:19,980 INFO L168 Benchmark]: Boogie Preprocessor took 37.33 ms. Allocated memory is still 348.1 MB. Free memory was 305.2 MB in the beginning and 303.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:17:19,981 INFO L168 Benchmark]: RCFGBuilder took 1553.59 ms. Allocated memory is still 348.1 MB. Free memory was 303.1 MB in the beginning and 238.7 MB in the end (delta: 64.4 MB). Peak memory consumption was 67.8 MB. Max. memory is 16.0 GB. [2021-03-26 10:17:19,981 INFO L168 Benchmark]: TraceAbstraction took 18517.84 ms. Allocated memory was 348.1 MB in the beginning and 658.5 MB in the end (delta: 310.4 MB). Free memory was 238.7 MB in the beginning and 377.1 MB in the end (delta: -138.4 MB). Peak memory consumption was 172.0 MB. Max. memory is 16.0 GB. [2021-03-26 10:17:19,983 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.50 ms. Allocated memory is still 255.9 MB. Free memory is still 238.0 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 443.72 ms. Allocated memory was 255.9 MB in the beginning and 348.1 MB in the end (delta: 92.3 MB). Free memory was 234.9 MB in the beginning and 308.0 MB in the end (delta: -73.0 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 74.68 ms. Allocated memory is still 348.1 MB. Free memory was 308.0 MB in the beginning and 305.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 37.33 ms. Allocated memory is still 348.1 MB. Free memory was 305.2 MB in the beginning and 303.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1553.59 ms. Allocated memory is still 348.1 MB. Free memory was 303.1 MB in the beginning and 238.7 MB in the end (delta: 64.4 MB). Peak memory consumption was 67.8 MB. Max. memory is 16.0 GB. * TraceAbstraction took 18517.84 ms. Allocated memory was 348.1 MB in the beginning and 658.5 MB in the end (delta: 310.4 MB). Free memory was 238.7 MB in the beginning and 377.1 MB in the end (delta: -138.4 MB). Peak memory consumption was 172.0 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6055.4ms, 87 PlacesBefore, 39 PlacesAfterwards, 82 TransitionsBefore, 33 TransitionsAfterwards, 1046 CoEnabledTransitionPairs, 4 FixpointIterations, 26 TrivialSequentialCompositions, 25 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 56 TotalNumberOfCompositions, 1715 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 857, positive: 803, positive conditional: 803, positive unconditional: 0, negative: 54, negative conditional: 54, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 857, positive: 803, positive conditional: 0, positive unconditional: 803, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 857, positive: 803, positive conditional: 0, positive unconditional: 803, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 697, positive: 663, positive conditional: 0, positive unconditional: 663, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 697, positive: 661, positive conditional: 0, positive unconditional: 661, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 36, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 726, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 721, negative conditional: 0, negative unconditional: 721, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 857, positive: 140, positive conditional: 0, positive unconditional: 140, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 697, unknown conditional: 0, unknown unconditional: 697] , Statistics on independence cache: Total cache size (in pairs): 697, Positive cache size: 663, Positive conditional cache size: 0, Positive unconditional cache size: 663, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5283.3ms, 37 PlacesBefore, 25 PlacesAfterwards, 30 TransitionsBefore, 18 TransitionsAfterwards, 218 CoEnabledTransitionPairs, 4 FixpointIterations, 7 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 13 TotalNumberOfCompositions, 651 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 283, positive: 228, positive conditional: 228, positive unconditional: 0, negative: 55, negative conditional: 55, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 283, positive: 228, positive conditional: 19, positive unconditional: 209, negative: 55, negative conditional: 8, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 283, positive: 228, positive conditional: 19, positive unconditional: 209, negative: 55, negative conditional: 8, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 94, positive: 80, positive conditional: 8, positive unconditional: 72, negative: 14, negative conditional: 4, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 94, positive: 79, positive conditional: 0, positive unconditional: 79, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 15, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 14, negative conditional: 4, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 281, positive: 38, positive conditional: 0, positive unconditional: 38, negative: 242, negative conditional: 102, negative unconditional: 141, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 283, positive: 148, positive conditional: 11, positive unconditional: 137, negative: 41, negative conditional: 4, negative unconditional: 37, unknown: 94, unknown conditional: 12, unknown unconditional: 82] , Statistics on independence cache: Total cache size (in pairs): 791, Positive cache size: 743, Positive conditional cache size: 8, Positive unconditional cache size: 735, Negative cache size: 48, Negative conditional cache size: 4, Negative unconditional cache size: 44, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 881.2ms, 28 PlacesBefore, 23 PlacesAfterwards, 16 TransitionsBefore, 15 TransitionsAfterwards, 92 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 222 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 99, positive: 71, positive conditional: 71, positive unconditional: 0, negative: 28, negative conditional: 28, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 99, positive: 71, positive conditional: 0, positive unconditional: 71, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 99, positive: 71, positive conditional: 0, positive unconditional: 71, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 147, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 147, negative conditional: 0, negative unconditional: 147, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 99, positive: 65, positive conditional: 0, positive unconditional: 65, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 802, Positive cache size: 749, Positive conditional cache size: 8, Positive unconditional cache size: 741, Negative cache size: 53, Negative conditional cache size: 4, Negative unconditional cache size: 49, Eliminated conditions: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 33.4ms, 24 PlacesBefore, 24 PlacesAfterwards, 17 TransitionsBefore, 17 TransitionsAfterwards, 94 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 92 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38, positive: 27, positive conditional: 27, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 38, positive: 27, positive conditional: 1, positive unconditional: 26, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 38, positive: 27, positive conditional: 1, positive unconditional: 26, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 28, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 38, positive: 24, positive conditional: 1, positive unconditional: 23, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 807, Positive cache size: 752, Positive conditional cache size: 8, Positive unconditional cache size: 744, Negative cache size: 55, Negative conditional cache size: 4, Negative unconditional cache size: 51, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.4ms, 30 PlacesBefore, 30 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 102 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 87 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30, positive: 21, positive conditional: 21, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 30, positive: 21, positive conditional: 4, positive unconditional: 17, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 30, positive: 21, positive conditional: 4, positive unconditional: 17, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 30, positive: 21, positive conditional: 4, positive unconditional: 17, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 807, Positive cache size: 752, Positive conditional cache size: 8, Positive unconditional cache size: 744, Negative cache size: 55, Negative conditional cache size: 4, Negative unconditional cache size: 51, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2903.1ms, 38 PlacesBefore, 35 PlacesAfterwards, 22 TransitionsBefore, 18 TransitionsAfterwards, 78 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 194 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 86, positive: 59, positive conditional: 59, positive unconditional: 0, negative: 27, negative conditional: 27, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 86, positive: 59, positive conditional: 28, positive unconditional: 31, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 86, positive: 59, positive conditional: 28, positive unconditional: 31, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 3, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 86, positive: 56, positive conditional: 25, positive unconditional: 31, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 4, unknown conditional: 3, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 811, Positive cache size: 755, Positive conditional cache size: 11, Positive unconditional cache size: 744, Negative cache size: 56, Negative conditional cache size: 4, Negative unconditional cache size: 52, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 706.6ms, 29 PlacesBefore, 27 PlacesAfterwards, 17 TransitionsBefore, 16 TransitionsAfterwards, 36 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 34 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, positive: 19, positive conditional: 19, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 24, positive: 19, positive conditional: 7, positive unconditional: 12, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 24, positive: 19, positive conditional: 7, positive unconditional: 12, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 1, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 24, positive: 17, positive conditional: 6, positive unconditional: 11, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 813, Positive cache size: 757, Positive conditional cache size: 12, Positive unconditional cache size: 745, Negative cache size: 56, Negative conditional cache size: 4, Negative unconditional cache size: 52, Eliminated conditions: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L719] 0 _Bool y$flush_delayed; [L720] 0 int y$mem_tmp; [L721] 0 _Bool y$r_buff0_thd0; [L722] 0 _Bool y$r_buff0_thd1; [L723] 0 _Bool y$r_buff0_thd2; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$read_delayed; [L728] 0 int *y$read_delayed_var; [L729] 0 int y$w_buff0; [L730] 0 _Bool y$w_buff0_used; [L731] 0 int y$w_buff1; [L732] 0 _Bool y$w_buff1_used; [L734] 0 int z = 0; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L802] 0 pthread_t t1603; [L803] FCALL, FORK 0 pthread_create(&t1603, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] 0 pthread_t t1604; [L805] FCALL, FORK 0 pthread_create(&t1604, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L760] 2 y$w_buff1 = y$w_buff0 [L761] 2 y$w_buff0 = 2 [L762] 2 y$w_buff1_used = y$w_buff0_used [L763] 2 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L765] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L766] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L767] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L768] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L771] 2 z = 1 [L774] 2 __unbuffered_p1_EAX = z [L777] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L740] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L743] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L746] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y [L746] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L746] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L747] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L748] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L749] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L750] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L780] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L780] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L781] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L781] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L782] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L782] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L783] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L783] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L784] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L784] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L807] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L3] COND FALSE 0 !(!cond) [L811] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L811] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L811] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L811] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L812] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L813] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L814] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L815] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L815] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L818] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 0 y$flush_delayed = weak$$choice2 [L821] 0 y$mem_tmp = y [L822] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L822] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L823] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L823] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L823] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L823] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L824] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L824] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L824] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L824] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L825] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L825] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L825] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L825] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L826] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L826] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L826] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L826] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L827] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L827] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L827] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L828] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L828] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L830] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L830] 0 y = y$flush_delayed ? y$mem_tmp : y [L831] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 83 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.2ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 17907.0ms, OverallIterations: 7, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 548.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6168.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 20 SDtfs, 9 SDslu, 8 SDs, 0 SdLazy, 67 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 90.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 61.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=118occurred in iteration=5, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 27.9ms SsaConstructionTime, 319.2ms SatisfiabilityAnalysisTime, 657.7ms InterpolantComputationTime, 89 NumberOfCodeBlocks, 89 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 269 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...