/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi003_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-11 18:28:52,735 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-11 18:28:52,738 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-11 18:28:52,765 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-11 18:28:52,765 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-11 18:28:52,766 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-11 18:28:52,767 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-11 18:28:52,769 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-11 18:28:52,770 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-11 18:28:52,771 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-11 18:28:52,772 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-11 18:28:52,773 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-11 18:28:52,773 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-11 18:28:52,774 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-11 18:28:52,775 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-11 18:28:52,776 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-11 18:28:52,777 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-11 18:28:52,778 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-11 18:28:52,780 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-11 18:28:52,782 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-11 18:28:52,783 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-11 18:28:52,784 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-11 18:28:52,785 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-11 18:28:52,786 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-11 18:28:52,789 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-11 18:28:52,789 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-11 18:28:52,789 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-11 18:28:52,790 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-11 18:28:52,790 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-11 18:28:52,791 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-11 18:28:52,791 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-11 18:28:52,792 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-11 18:28:52,793 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-11 18:28:52,794 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-11 18:28:52,795 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-11 18:28:52,795 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-11 18:28:52,795 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-11 18:28:52,796 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-11 18:28:52,796 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-11 18:28:52,797 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-11 18:28:52,797 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-11 18:28:52,798 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf [2020-10-11 18:28:52,820 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-11 18:28:52,820 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-11 18:28:52,821 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-11 18:28:52,821 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-11 18:28:52,822 INFO L138 SettingsManager]: * Use SBE=true [2020-10-11 18:28:52,822 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-11 18:28:52,822 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-11 18:28:52,822 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-11 18:28:52,822 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-11 18:28:52,823 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-11 18:28:52,823 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-11 18:28:52,823 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-11 18:28:52,823 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-11 18:28:52,823 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-11 18:28:52,823 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-11 18:28:52,824 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-11 18:28:52,824 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-11 18:28:52,824 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-11 18:28:52,824 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-11 18:28:52,825 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-11 18:28:52,825 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-11 18:28:52,825 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 18:28:52,825 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-11 18:28:52,825 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-11 18:28:52,826 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-11 18:28:52,826 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-11 18:28:52,826 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-11 18:28:52,826 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-10-11 18:28:52,826 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-11 18:28:52,826 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-11 18:28:53,095 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-11 18:28:53,107 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-11 18:28:53,110 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-11 18:28:53,112 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-11 18:28:53,112 INFO L275 PluginConnector]: CDTParser initialized [2020-10-11 18:28:53,113 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi003_pso.opt.i [2020-10-11 18:28:53,169 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/437a9e62b/bffcdaabcf2742c7963a13ad036d96a4/FLAG7b1b114ef [2020-10-11 18:28:53,680 INFO L306 CDTParser]: Found 1 translation units. [2020-10-11 18:28:53,680 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi003_pso.opt.i [2020-10-11 18:28:53,694 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/437a9e62b/bffcdaabcf2742c7963a13ad036d96a4/FLAG7b1b114ef [2020-10-11 18:28:53,928 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/437a9e62b/bffcdaabcf2742c7963a13ad036d96a4 [2020-10-11 18:28:53,937 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-11 18:28:53,939 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-11 18:28:53,941 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-11 18:28:53,941 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-11 18:28:53,945 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-11 18:28:53,946 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:28:53" (1/1) ... [2020-10-11 18:28:53,948 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35cd13ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:28:53, skipping insertion in model container [2020-10-11 18:28:53,949 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:28:53" (1/1) ... [2020-10-11 18:28:53,956 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-11 18:28:53,994 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-11 18:28:54,529 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:28:54,543 INFO L203 MainTranslator]: Completed pre-run [2020-10-11 18:28:54,595 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:28:54,668 INFO L208 MainTranslator]: Completed translation [2020-10-11 18:28:54,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:28:54 WrapperNode [2020-10-11 18:28:54,669 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-11 18:28:54,670 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-11 18:28:54,670 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-11 18:28:54,670 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-11 18:28:54,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:28:54" (1/1) ... [2020-10-11 18:28:54,697 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:28:54" (1/1) ... [2020-10-11 18:28:54,734 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-11 18:28:54,734 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-11 18:28:54,735 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-11 18:28:54,735 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-11 18:28:54,742 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:28:54" (1/1) ... [2020-10-11 18:28:54,742 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:28:54" (1/1) ... [2020-10-11 18:28:54,747 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:28:54" (1/1) ... [2020-10-11 18:28:54,747 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:28:54" (1/1) ... [2020-10-11 18:28:54,756 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:28:54" (1/1) ... [2020-10-11 18:28:54,759 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:28:54" (1/1) ... [2020-10-11 18:28:54,763 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:28:54" (1/1) ... [2020-10-11 18:28:54,767 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-11 18:28:54,767 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-11 18:28:54,768 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-11 18:28:54,768 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-11 18:28:54,768 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:28:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 18:28:54,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-11 18:28:54,827 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-11 18:28:54,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-11 18:28:54,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-11 18:28:54,827 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-11 18:28:54,827 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-11 18:28:54,827 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-11 18:28:54,828 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-11 18:28:54,828 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-11 18:28:54,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-11 18:28:54,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-11 18:28:54,830 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-11 18:28:56,373 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-11 18:28:56,373 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-11 18:28:56,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:28:56 BoogieIcfgContainer [2020-10-11 18:28:56,376 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-11 18:28:56,377 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-11 18:28:56,377 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-11 18:28:56,380 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-11 18:28:56,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:28:53" (1/3) ... [2020-10-11 18:28:56,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a957b30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:28:56, skipping insertion in model container [2020-10-11 18:28:56,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:28:54" (2/3) ... [2020-10-11 18:28:56,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a957b30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:28:56, skipping insertion in model container [2020-10-11 18:28:56,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:28:56" (3/3) ... [2020-10-11 18:28:56,384 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi003_pso.opt.i [2020-10-11 18:28:56,395 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-11 18:28:56,402 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-11 18:28:56,403 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-11 18:28:56,429 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,429 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,429 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,429 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,430 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,430 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,430 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,430 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,431 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,431 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,431 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,431 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,431 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,432 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,432 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,432 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,432 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,432 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,432 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,433 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,433 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,433 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,433 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,433 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,434 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,434 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,434 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,434 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,434 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,435 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,435 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,435 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,435 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,435 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,435 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,436 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,436 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,436 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,436 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,436 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,436 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,437 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,439 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,439 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,439 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,440 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,440 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,440 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,440 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,440 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,441 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,441 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,441 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,441 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,441 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,442 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,442 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,442 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,442 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,443 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,443 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,446 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,447 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,447 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,447 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,447 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,448 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,448 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,448 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,448 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,448 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,448 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,449 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,449 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,449 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,449 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,449 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,450 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,450 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,450 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,450 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,450 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,451 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,451 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,451 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,451 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,451 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,452 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,457 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,457 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,458 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,458 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,458 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,458 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,458 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,459 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,459 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,459 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:28:56,476 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-11 18:28:56,497 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 18:28:56,497 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-11 18:28:56,497 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 18:28:56,497 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 18:28:56,498 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 18:28:56,498 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 18:28:56,498 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 18:28:56,498 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 18:28:56,512 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 83 places, 78 transitions, 166 flow [2020-10-11 18:28:56,555 INFO L129 PetriNetUnfolder]: 2/76 cut-off events. [2020-10-11 18:28:56,556 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:28:56,560 INFO L80 FinitePrefix]: Finished finitePrefix Result has 83 conditions, 76 events. 2/76 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 48 event pairs, 0 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2020-10-11 18:28:56,560 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 78 transitions, 166 flow [2020-10-11 18:28:56,567 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 81 places, 76 transitions, 158 flow [2020-10-11 18:28:56,581 INFO L129 PetriNetUnfolder]: 0/46 cut-off events. [2020-10-11 18:28:56,581 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:28:56,582 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:28:56,583 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:28:56,583 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:28:56,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:28:56,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1854767798, now seen corresponding path program 1 times [2020-10-11 18:28:56,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:28:56,602 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222887185] [2020-10-11 18:28:56,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:28:56,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:28:56,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:28:56,880 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222887185] [2020-10-11 18:28:56,881 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:28:56,881 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 18:28:56,882 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216893381] [2020-10-11 18:28:56,892 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 18:28:56,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:28:56,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 18:28:56,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 18:28:56,980 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 78 [2020-10-11 18:28:56,982 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 76 transitions, 158 flow. Second operand 3 states. [2020-10-11 18:28:56,982 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:28:56,982 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 78 [2020-10-11 18:28:56,984 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:28:57,009 INFO L129 PetriNetUnfolder]: 0/73 cut-off events. [2020-10-11 18:28:57,009 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:28:57,009 INFO L80 FinitePrefix]: Finished finitePrefix Result has 83 conditions, 73 events. 0/73 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 42 event pairs, 0 based on Foata normal form. 4/75 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2020-10-11 18:28:57,011 INFO L132 encePairwiseOnDemand]: 73/78 looper letters, 0 selfloop transitions, 2 changer transitions 9/73 dead transitions. [2020-10-11 18:28:57,011 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 73 transitions, 156 flow [2020-10-11 18:28:57,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 18:28:57,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-11 18:28:57,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 226 transitions. [2020-10-11 18:28:57,027 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9658119658119658 [2020-10-11 18:28:57,027 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 226 transitions. [2020-10-11 18:28:57,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 226 transitions. [2020-10-11 18:28:57,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:28:57,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 226 transitions. [2020-10-11 18:28:57,036 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-11 18:28:57,042 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-11 18:28:57,042 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-11 18:28:57,044 INFO L185 Difference]: Start difference. First operand has 81 places, 76 transitions, 158 flow. Second operand 3 states and 226 transitions. [2020-10-11 18:28:57,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 73 transitions, 156 flow [2020-10-11 18:28:57,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 73 transitions, 154 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-11 18:28:57,054 INFO L241 Difference]: Finished difference. Result has 80 places, 64 transitions, 136 flow [2020-10-11 18:28:57,056 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=80, PETRI_TRANSITIONS=64} [2020-10-11 18:28:57,057 INFO L341 CegarLoopForPetriNet]: 81 programPoint places, -1 predicate places. [2020-10-11 18:28:57,057 INFO L481 AbstractCegarLoop]: Abstraction has has 80 places, 64 transitions, 136 flow [2020-10-11 18:28:57,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 18:28:57,058 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:28:57,058 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:28:57,058 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-11 18:28:57,059 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:28:57,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:28:57,059 INFO L82 PathProgramCache]: Analyzing trace with hash 120328011, now seen corresponding path program 1 times [2020-10-11 18:28:57,059 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:28:57,060 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174569764] [2020-10-11 18:28:57,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:28:57,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:28:57,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:28:57,272 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174569764] [2020-10-11 18:28:57,273 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:28:57,273 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:28:57,273 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51523773] [2020-10-11 18:28:57,277 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:28:57,278 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:28:57,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:28:57,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:28:57,485 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 78 [2020-10-11 18:28:57,486 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 64 transitions, 136 flow. Second operand 6 states. [2020-10-11 18:28:57,486 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:28:57,486 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 78 [2020-10-11 18:28:57,486 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:28:57,605 INFO L129 PetriNetUnfolder]: 3/87 cut-off events. [2020-10-11 18:28:57,605 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:28:57,606 INFO L80 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 87 events. 3/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 129 event pairs, 0 based on Foata normal form. 2/89 useless extension candidates. Maximal degree in co-relation 75. Up to 7 conditions per place. [2020-10-11 18:28:57,607 INFO L132 encePairwiseOnDemand]: 72/78 looper letters, 6 selfloop transitions, 2 changer transitions 10/74 dead transitions. [2020-10-11 18:28:57,607 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 74 transitions, 192 flow [2020-10-11 18:28:57,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:28:57,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:28:57,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 632 transitions. [2020-10-11 18:28:57,612 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9002849002849003 [2020-10-11 18:28:57,612 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 632 transitions. [2020-10-11 18:28:57,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 632 transitions. [2020-10-11 18:28:57,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:28:57,614 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 632 transitions. [2020-10-11 18:28:57,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:28:57,620 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:28:57,620 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:28:57,620 INFO L185 Difference]: Start difference. First operand has 80 places, 64 transitions, 136 flow. Second operand 9 states and 632 transitions. [2020-10-11 18:28:57,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 74 transitions, 192 flow [2020-10-11 18:28:57,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 74 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-11 18:28:57,626 INFO L241 Difference]: Finished difference. Result has 84 places, 64 transitions, 152 flow [2020-10-11 18:28:57,628 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=152, PETRI_PLACES=84, PETRI_TRANSITIONS=64} [2020-10-11 18:28:57,628 INFO L341 CegarLoopForPetriNet]: 81 programPoint places, 3 predicate places. [2020-10-11 18:28:57,628 INFO L481 AbstractCegarLoop]: Abstraction has has 84 places, 64 transitions, 152 flow [2020-10-11 18:28:57,628 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:28:57,629 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:28:57,629 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:28:57,629 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-11 18:28:57,629 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:28:57,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:28:57,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1248487777, now seen corresponding path program 1 times [2020-10-11 18:28:57,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:28:57,630 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280263741] [2020-10-11 18:28:57,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:28:57,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:28:57,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:28:57,822 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280263741] [2020-10-11 18:28:57,823 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:28:57,823 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:28:57,823 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011944480] [2020-10-11 18:28:57,824 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:28:57,824 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:28:57,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:28:57,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:28:58,018 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 78 [2020-10-11 18:28:58,019 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 64 transitions, 152 flow. Second operand 6 states. [2020-10-11 18:28:58,019 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:28:58,019 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 78 [2020-10-11 18:28:58,019 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:28:58,122 INFO L129 PetriNetUnfolder]: 3/95 cut-off events. [2020-10-11 18:28:58,123 INFO L130 PetriNetUnfolder]: For 18/25 co-relation queries the response was YES. [2020-10-11 18:28:58,123 INFO L80 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 95 events. 3/95 cut-off events. For 18/25 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 172 event pairs, 0 based on Foata normal form. 3/96 useless extension candidates. Maximal degree in co-relation 146. Up to 10 conditions per place. [2020-10-11 18:28:58,124 INFO L132 encePairwiseOnDemand]: 72/78 looper letters, 7 selfloop transitions, 2 changer transitions 11/75 dead transitions. [2020-10-11 18:28:58,124 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 75 transitions, 232 flow [2020-10-11 18:28:58,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:28:58,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:28:58,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 625 transitions. [2020-10-11 18:28:58,127 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8903133903133903 [2020-10-11 18:28:58,127 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 625 transitions. [2020-10-11 18:28:58,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 625 transitions. [2020-10-11 18:28:58,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:28:58,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 625 transitions. [2020-10-11 18:28:58,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:28:58,131 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:28:58,131 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:28:58,132 INFO L185 Difference]: Start difference. First operand has 84 places, 64 transitions, 152 flow. Second operand 9 states and 625 transitions. [2020-10-11 18:28:58,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 75 transitions, 232 flow [2020-10-11 18:28:58,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 75 transitions, 200 flow, removed 14 selfloop flow, removed 8 redundant places. [2020-10-11 18:28:58,135 INFO L241 Difference]: Finished difference. Result has 85 places, 64 transitions, 156 flow [2020-10-11 18:28:58,136 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=156, PETRI_PLACES=85, PETRI_TRANSITIONS=64} [2020-10-11 18:28:58,136 INFO L341 CegarLoopForPetriNet]: 81 programPoint places, 4 predicate places. [2020-10-11 18:28:58,136 INFO L481 AbstractCegarLoop]: Abstraction has has 85 places, 64 transitions, 156 flow [2020-10-11 18:28:58,136 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:28:58,136 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:28:58,137 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:28:58,137 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-11 18:28:58,137 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:28:58,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:28:58,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1388070496, now seen corresponding path program 1 times [2020-10-11 18:28:58,138 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:28:58,138 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836893773] [2020-10-11 18:28:58,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:28:58,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:28:58,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:28:58,280 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836893773] [2020-10-11 18:28:58,280 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:28:58,280 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:28:58,281 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43271125] [2020-10-11 18:28:58,282 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:28:58,282 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:28:58,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:28:58,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:28:58,502 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 78 [2020-10-11 18:28:58,503 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 64 transitions, 156 flow. Second operand 7 states. [2020-10-11 18:28:58,503 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:28:58,503 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 78 [2020-10-11 18:28:58,503 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:28:58,643 INFO L129 PetriNetUnfolder]: 0/79 cut-off events. [2020-10-11 18:28:58,644 INFO L130 PetriNetUnfolder]: For 18/38 co-relation queries the response was YES. [2020-10-11 18:28:58,644 INFO L80 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 79 events. 0/79 cut-off events. For 18/38 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 106 event pairs, 0 based on Foata normal form. 2/81 useless extension candidates. Maximal degree in co-relation 0. Up to 7 conditions per place. [2020-10-11 18:28:58,645 INFO L132 encePairwiseOnDemand]: 72/78 looper letters, 10 selfloop transitions, 1 changer transitions 5/69 dead transitions. [2020-10-11 18:28:58,645 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 69 transitions, 210 flow [2020-10-11 18:28:58,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 18:28:58,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-11 18:28:58,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 472 transitions. [2020-10-11 18:28:58,648 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8644688644688645 [2020-10-11 18:28:58,649 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 472 transitions. [2020-10-11 18:28:58,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 472 transitions. [2020-10-11 18:28:58,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:28:58,649 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 472 transitions. [2020-10-11 18:28:58,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-11 18:28:58,654 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-11 18:28:58,654 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-11 18:28:58,654 INFO L185 Difference]: Start difference. First operand has 85 places, 64 transitions, 156 flow. Second operand 7 states and 472 transitions. [2020-10-11 18:28:58,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 69 transitions, 210 flow [2020-10-11 18:28:58,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 69 transitions, 188 flow, removed 10 selfloop flow, removed 7 redundant places. [2020-10-11 18:28:58,660 INFO L241 Difference]: Finished difference. Result has 83 places, 64 transitions, 155 flow [2020-10-11 18:28:58,661 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=155, PETRI_PLACES=83, PETRI_TRANSITIONS=64} [2020-10-11 18:28:58,662 INFO L341 CegarLoopForPetriNet]: 81 programPoint places, 2 predicate places. [2020-10-11 18:28:58,662 INFO L481 AbstractCegarLoop]: Abstraction has has 83 places, 64 transitions, 155 flow [2020-10-11 18:28:58,663 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:28:58,663 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:28:58,663 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:28:58,663 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-11 18:28:58,663 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:28:58,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:28:58,664 INFO L82 PathProgramCache]: Analyzing trace with hash -2005076384, now seen corresponding path program 2 times [2020-10-11 18:28:58,664 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:28:58,665 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105501345] [2020-10-11 18:28:58,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:28:58,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:28:58,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:28:58,878 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105501345] [2020-10-11 18:28:58,879 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:28:58,879 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:28:58,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048119198] [2020-10-11 18:28:58,879 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:28:58,880 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:28:58,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:28:58,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:28:58,966 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 78 [2020-10-11 18:28:58,967 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 64 transitions, 155 flow. Second operand 6 states. [2020-10-11 18:28:58,967 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:28:58,967 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 78 [2020-10-11 18:28:58,967 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:28:59,152 INFO L129 PetriNetUnfolder]: 27/181 cut-off events. [2020-10-11 18:28:59,153 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2020-10-11 18:28:59,155 INFO L80 FinitePrefix]: Finished finitePrefix Result has 293 conditions, 181 events. 27/181 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 718 event pairs, 0 based on Foata normal form. 5/180 useless extension candidates. Maximal degree in co-relation 274. Up to 31 conditions per place. [2020-10-11 18:28:59,156 INFO L132 encePairwiseOnDemand]: 70/78 looper letters, 8 selfloop transitions, 5 changer transitions 15/83 dead transitions. [2020-10-11 18:28:59,156 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 83 transitions, 249 flow [2020-10-11 18:28:59,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:28:59,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:28:59,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 624 transitions. [2020-10-11 18:28:59,159 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2020-10-11 18:28:59,159 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 624 transitions. [2020-10-11 18:28:59,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 624 transitions. [2020-10-11 18:28:59,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:28:59,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 624 transitions. [2020-10-11 18:28:59,161 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:28:59,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:28:59,163 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:28:59,163 INFO L185 Difference]: Start difference. First operand has 83 places, 64 transitions, 155 flow. Second operand 9 states and 624 transitions. [2020-10-11 18:28:59,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 83 transitions, 249 flow [2020-10-11 18:28:59,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 83 transitions, 240 flow, removed 4 selfloop flow, removed 5 redundant places. [2020-10-11 18:28:59,170 INFO L241 Difference]: Finished difference. Result has 88 places, 66 transitions, 190 flow [2020-10-11 18:28:59,171 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=190, PETRI_PLACES=88, PETRI_TRANSITIONS=66} [2020-10-11 18:28:59,171 INFO L341 CegarLoopForPetriNet]: 81 programPoint places, 7 predicate places. [2020-10-11 18:28:59,171 INFO L481 AbstractCegarLoop]: Abstraction has has 88 places, 66 transitions, 190 flow [2020-10-11 18:28:59,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:28:59,171 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:28:59,172 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:28:59,172 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-11 18:28:59,172 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:28:59,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:28:59,174 INFO L82 PathProgramCache]: Analyzing trace with hash -585142393, now seen corresponding path program 1 times [2020-10-11 18:28:59,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:28:59,175 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148295486] [2020-10-11 18:28:59,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:28:59,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:28:59,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:28:59,385 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148295486] [2020-10-11 18:28:59,385 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:28:59,386 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:28:59,386 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351467930] [2020-10-11 18:28:59,386 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:28:59,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:28:59,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:28:59,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:28:59,639 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 78 [2020-10-11 18:28:59,640 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 66 transitions, 190 flow. Second operand 7 states. [2020-10-11 18:28:59,640 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:28:59,640 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 78 [2020-10-11 18:28:59,640 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:28:59,756 INFO L129 PetriNetUnfolder]: 14/163 cut-off events. [2020-10-11 18:28:59,756 INFO L130 PetriNetUnfolder]: For 98/100 co-relation queries the response was YES. [2020-10-11 18:28:59,757 INFO L80 FinitePrefix]: Finished finitePrefix Result has 349 conditions, 163 events. 14/163 cut-off events. For 98/100 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 554 event pairs, 6 based on Foata normal form. 5/168 useless extension candidates. Maximal degree in co-relation 298. Up to 29 conditions per place. [2020-10-11 18:28:59,758 INFO L132 encePairwiseOnDemand]: 72/78 looper letters, 10 selfloop transitions, 1 changer transitions 5/71 dead transitions. [2020-10-11 18:28:59,758 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 71 transitions, 237 flow [2020-10-11 18:28:59,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 18:28:59,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-11 18:28:59,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 472 transitions. [2020-10-11 18:28:59,760 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8644688644688645 [2020-10-11 18:28:59,760 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 472 transitions. [2020-10-11 18:28:59,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 472 transitions. [2020-10-11 18:28:59,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:28:59,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 472 transitions. [2020-10-11 18:28:59,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-11 18:28:59,763 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-11 18:28:59,763 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-11 18:28:59,763 INFO L185 Difference]: Start difference. First operand has 88 places, 66 transitions, 190 flow. Second operand 7 states and 472 transitions. [2020-10-11 18:28:59,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 71 transitions, 237 flow [2020-10-11 18:28:59,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 71 transitions, 224 flow, removed 3 selfloop flow, removed 5 redundant places. [2020-10-11 18:28:59,767 INFO L241 Difference]: Finished difference. Result has 90 places, 66 transitions, 190 flow [2020-10-11 18:28:59,767 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=190, PETRI_PLACES=90, PETRI_TRANSITIONS=66} [2020-10-11 18:28:59,767 INFO L341 CegarLoopForPetriNet]: 81 programPoint places, 9 predicate places. [2020-10-11 18:28:59,767 INFO L481 AbstractCegarLoop]: Abstraction has has 90 places, 66 transitions, 190 flow [2020-10-11 18:28:59,767 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:28:59,767 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:28:59,768 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:28:59,768 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-11 18:28:59,768 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:28:59,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:28:59,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1548142857, now seen corresponding path program 2 times [2020-10-11 18:28:59,769 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:28:59,769 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85679230] [2020-10-11 18:28:59,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:28:59,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:28:59,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:28:59,894 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85679230] [2020-10-11 18:28:59,895 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:28:59,895 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:28:59,895 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033352213] [2020-10-11 18:28:59,896 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:28:59,896 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:28:59,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:28:59,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:28:59,983 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 78 [2020-10-11 18:28:59,984 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 66 transitions, 190 flow. Second operand 7 states. [2020-10-11 18:28:59,984 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:28:59,984 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 78 [2020-10-11 18:28:59,984 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:29:00,170 INFO L129 PetriNetUnfolder]: 8/113 cut-off events. [2020-10-11 18:29:00,171 INFO L130 PetriNetUnfolder]: For 75/77 co-relation queries the response was YES. [2020-10-11 18:29:00,171 INFO L80 FinitePrefix]: Finished finitePrefix Result has 242 conditions, 113 events. 8/113 cut-off events. For 75/77 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 251 event pairs, 0 based on Foata normal form. 7/120 useless extension candidates. Maximal degree in co-relation 225. Up to 21 conditions per place. [2020-10-11 18:29:00,172 INFO L132 encePairwiseOnDemand]: 70/78 looper letters, 4 selfloop transitions, 7 changer transitions 11/77 dead transitions. [2020-10-11 18:29:00,172 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 77 transitions, 289 flow [2020-10-11 18:29:00,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-11 18:29:00,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-11 18:29:00,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 684 transitions. [2020-10-11 18:29:00,178 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8769230769230769 [2020-10-11 18:29:00,178 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 684 transitions. [2020-10-11 18:29:00,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 684 transitions. [2020-10-11 18:29:00,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:29:00,181 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 684 transitions. [2020-10-11 18:29:00,183 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-11 18:29:00,185 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-11 18:29:00,185 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-11 18:29:00,185 INFO L185 Difference]: Start difference. First operand has 90 places, 66 transitions, 190 flow. Second operand 10 states and 684 transitions. [2020-10-11 18:29:00,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 77 transitions, 289 flow [2020-10-11 18:29:00,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 77 transitions, 260 flow, removed 12 selfloop flow, removed 7 redundant places. [2020-10-11 18:29:00,194 INFO L241 Difference]: Finished difference. Result has 94 places, 66 transitions, 202 flow [2020-10-11 18:29:00,194 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=202, PETRI_PLACES=94, PETRI_TRANSITIONS=66} [2020-10-11 18:29:00,195 INFO L341 CegarLoopForPetriNet]: 81 programPoint places, 13 predicate places. [2020-10-11 18:29:00,195 INFO L481 AbstractCegarLoop]: Abstraction has has 94 places, 66 transitions, 202 flow [2020-10-11 18:29:00,195 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:29:00,195 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:29:00,195 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:29:00,195 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-11 18:29:00,196 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:29:00,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:29:00,197 INFO L82 PathProgramCache]: Analyzing trace with hash -467173612, now seen corresponding path program 1 times [2020-10-11 18:29:00,197 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:29:00,197 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545549402] [2020-10-11 18:29:00,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:29:00,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:29:00,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:29:00,440 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545549402] [2020-10-11 18:29:00,440 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:29:00,440 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 18:29:00,440 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31757819] [2020-10-11 18:29:00,441 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 18:29:00,441 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:29:00,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 18:29:00,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-10-11 18:29:01,167 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 78 [2020-10-11 18:29:01,168 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 66 transitions, 202 flow. Second operand 9 states. [2020-10-11 18:29:01,168 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:29:01,168 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 78 [2020-10-11 18:29:01,168 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:29:01,334 INFO L129 PetriNetUnfolder]: 2/100 cut-off events. [2020-10-11 18:29:01,334 INFO L130 PetriNetUnfolder]: For 59/59 co-relation queries the response was YES. [2020-10-11 18:29:01,334 INFO L80 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 100 events. 2/100 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 162 event pairs, 0 based on Foata normal form. 1/101 useless extension candidates. Maximal degree in co-relation 166. Up to 13 conditions per place. [2020-10-11 18:29:01,335 INFO L132 encePairwiseOnDemand]: 69/78 looper letters, 12 selfloop transitions, 4 changer transitions 6/72 dead transitions. [2020-10-11 18:29:01,335 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 72 transitions, 258 flow [2020-10-11 18:29:01,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-11 18:29:01,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-11 18:29:01,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 623 transitions. [2020-10-11 18:29:01,338 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.7987179487179488 [2020-10-11 18:29:01,338 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 623 transitions. [2020-10-11 18:29:01,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 623 transitions. [2020-10-11 18:29:01,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:29:01,339 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 623 transitions. [2020-10-11 18:29:01,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-11 18:29:01,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-11 18:29:01,342 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-11 18:29:01,342 INFO L185 Difference]: Start difference. First operand has 94 places, 66 transitions, 202 flow. Second operand 10 states and 623 transitions. [2020-10-11 18:29:01,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 72 transitions, 258 flow [2020-10-11 18:29:01,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 72 transitions, 212 flow, removed 13 selfloop flow, removed 13 redundant places. [2020-10-11 18:29:01,345 INFO L241 Difference]: Finished difference. Result has 91 places, 66 transitions, 176 flow [2020-10-11 18:29:01,345 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=176, PETRI_PLACES=91, PETRI_TRANSITIONS=66} [2020-10-11 18:29:01,345 INFO L341 CegarLoopForPetriNet]: 81 programPoint places, 10 predicate places. [2020-10-11 18:29:01,346 INFO L481 AbstractCegarLoop]: Abstraction has has 91 places, 66 transitions, 176 flow [2020-10-11 18:29:01,346 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 18:29:01,346 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:29:01,346 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:29:01,346 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-11 18:29:01,346 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:29:01,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:29:01,347 INFO L82 PathProgramCache]: Analyzing trace with hash 177594600, now seen corresponding path program 2 times [2020-10-11 18:29:01,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:29:01,347 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36461895] [2020-10-11 18:29:01,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:29:01,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:29:01,382 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:29:01,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:29:01,412 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:29:01,447 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-11 18:29:01,447 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-11 18:29:01,448 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-11 18:29:01,478 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:29:01,478 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:29:01,479 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:29:01,479 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:29:01,480 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:29:01,480 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:29:01,480 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:29:01,480 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:29:01,480 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:29:01,481 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:29:01,481 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:29:01,481 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:29:01,481 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:29:01,481 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:29:01,482 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:29:01,482 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:29:01,482 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:29:01,482 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:29:01,482 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:29:01,482 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:29:01,483 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:29:01,483 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:29:01,483 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:29:01,483 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:29:01,483 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:29:01,483 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:29:01,484 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:29:01,484 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:29:01,484 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:29:01,484 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:29:01,485 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:29:01,485 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:29:01,485 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:29:01,485 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:29:01,486 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:29:01,486 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:29:01,486 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:29:01,486 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:29:01,486 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:29:01,486 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:29:01,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 06:29:01 BasicIcfg [2020-10-11 18:29:01,585 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-11 18:29:01,588 INFO L168 Benchmark]: Toolchain (without parser) took 7648.16 ms. Allocated memory was 250.6 MB in the beginning and 428.9 MB in the end (delta: 178.3 MB). Free memory was 206.0 MB in the beginning and 172.1 MB in the end (delta: 33.9 MB). Peak memory consumption was 212.2 MB. Max. memory is 14.2 GB. [2020-10-11 18:29:01,589 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 250.6 MB. Free memory is still 227.0 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-11 18:29:01,594 INFO L168 Benchmark]: CACSL2BoogieTranslator took 728.39 ms. Allocated memory was 250.6 MB in the beginning and 312.0 MB in the end (delta: 61.3 MB). Free memory was 206.0 MB in the beginning and 262.8 MB in the end (delta: -56.9 MB). Peak memory consumption was 29.3 MB. Max. memory is 14.2 GB. [2020-10-11 18:29:01,596 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.20 ms. Allocated memory is still 312.0 MB. Free memory was 262.8 MB in the beginning and 260.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-11 18:29:01,596 INFO L168 Benchmark]: Boogie Preprocessor took 32.68 ms. Allocated memory is still 312.0 MB. Free memory was 260.3 MB in the beginning and 257.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-11 18:29:01,598 INFO L168 Benchmark]: RCFGBuilder took 1608.49 ms. Allocated memory was 312.0 MB in the beginning and 357.6 MB in the end (delta: 45.6 MB). Free memory was 257.8 MB in the beginning and 242.5 MB in the end (delta: 15.3 MB). Peak memory consumption was 99.7 MB. Max. memory is 14.2 GB. [2020-10-11 18:29:01,600 INFO L168 Benchmark]: TraceAbstraction took 5208.45 ms. Allocated memory was 357.6 MB in the beginning and 428.9 MB in the end (delta: 71.3 MB). Free memory was 242.5 MB in the beginning and 172.1 MB in the end (delta: 70.4 MB). Peak memory consumption was 141.7 MB. Max. memory is 14.2 GB. [2020-10-11 18:29:01,607 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 250.6 MB. Free memory is still 227.0 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 728.39 ms. Allocated memory was 250.6 MB in the beginning and 312.0 MB in the end (delta: 61.3 MB). Free memory was 206.0 MB in the beginning and 262.8 MB in the end (delta: -56.9 MB). Peak memory consumption was 29.3 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 64.20 ms. Allocated memory is still 312.0 MB. Free memory was 262.8 MB in the beginning and 260.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 32.68 ms. Allocated memory is still 312.0 MB. Free memory was 260.3 MB in the beginning and 257.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 1608.49 ms. Allocated memory was 312.0 MB in the beginning and 357.6 MB in the end (delta: 45.6 MB). Free memory was 257.8 MB in the beginning and 242.5 MB in the end (delta: 15.3 MB). Peak memory consumption was 99.7 MB. Max. memory is 14.2 GB. * TraceAbstraction took 5208.45 ms. Allocated memory was 357.6 MB in the beginning and 428.9 MB in the end (delta: 71.3 MB). Free memory was 242.5 MB in the beginning and 172.1 MB in the end (delta: 70.4 MB). Peak memory consumption was 141.7 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 8]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L700] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L702] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L704] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L705] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L706] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L708] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L709] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L710] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L711] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L712] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L713] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L714] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L715] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L716] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L717] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L718] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L719] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L720] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L721] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L722] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L724] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L725] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L726] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L802] 0 pthread_t t1639; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L803] FCALL, FORK 0 pthread_create(&t1639, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L804] 0 pthread_t t1640; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L805] FCALL, FORK 0 pthread_create(&t1640, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L760] 2 x$w_buff1 = x$w_buff0 [L761] 2 x$w_buff0 = 1 [L762] 2 x$w_buff1_used = x$w_buff0_used [L763] 2 x$w_buff0_used = (_Bool)1 [L8] COND TRUE 2 !expression [L8] 2 __VERIFIER_error() [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L771] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L777] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L730] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L742] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L744] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L745] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L745] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EAX = x [L747] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L747] 1 x = x$flush_delayed ? x$mem_tmp : x [L748] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L780] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L781] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L782] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L783] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L783] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L784] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L784] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L807] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L811] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L811] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L812] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L812] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L813] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L813] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L814] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L814] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L815] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L815] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L818] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L8] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L8] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 77 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 4.9s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 211 SDtfs, 225 SDslu, 669 SDs, 0 SdLazy, 553 SolverSat, 68 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=202occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 489 NumberOfCodeBlocks, 489 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 421 ConstructedInterpolants, 0 QuantifiedInterpolants, 58776 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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...