/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe010_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065 [2021-06-10 12:25:15,103 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-10 12:25:15,105 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-10 12:25:15,129 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-10 12:25:15,130 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-10 12:25:15,131 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-10 12:25:15,132 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-10 12:25:15,136 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-10 12:25:15,137 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-10 12:25:15,138 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-10 12:25:15,139 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-10 12:25:15,140 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-10 12:25:15,140 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-10 12:25:15,141 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-10 12:25:15,142 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-10 12:25:15,143 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-10 12:25:15,143 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-10 12:25:15,144 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-10 12:25:15,146 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-10 12:25:15,148 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-10 12:25:15,149 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-10 12:25:15,150 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-10 12:25:15,152 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-10 12:25:15,153 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-10 12:25:15,155 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-10 12:25:15,155 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-10 12:25:15,156 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-10 12:25:15,156 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-10 12:25:15,157 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-10 12:25:15,158 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-10 12:25:15,158 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-10 12:25:15,159 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-10 12:25:15,160 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-10 12:25:15,160 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-10 12:25:15,161 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-10 12:25:15,161 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-10 12:25:15,162 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-10 12:25:15,162 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-10 12:25:15,163 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-10 12:25:15,164 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-10 12:25:15,164 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-10 12:25:15,165 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2021-06-10 12:25:15,185 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-10 12:25:15,185 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-10 12:25:15,186 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-10 12:25:15,187 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-10 12:25:15,187 INFO L138 SettingsManager]: * Use SBE=true [2021-06-10 12:25:15,187 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-10 12:25:15,187 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-10 12:25:15,187 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-10 12:25:15,188 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-10 12:25:15,188 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-10 12:25:15,188 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-10 12:25:15,188 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-10 12:25:15,188 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-10 12:25:15,188 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-10 12:25:15,188 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-10 12:25:15,189 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-10 12:25:15,189 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-10 12:25:15,189 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-10 12:25:15,189 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-10 12:25:15,189 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-10 12:25:15,189 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-10 12:25:15,189 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-10 12:25:15,190 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-10 12:25:15,190 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-10 12:25:15,190 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-10 12:25:15,190 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-10 12:25:15,190 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-10 12:25:15,190 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-10 12:25:15,190 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-10 12:25:15,190 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-10 12:25:15,493 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-10 12:25:15,518 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-10 12:25:15,521 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-10 12:25:15,522 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-10 12:25:15,524 INFO L275 PluginConnector]: CDTParser initialized [2021-06-10 12:25:15,526 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_pso.oepc.i [2021-06-10 12:25:15,582 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cba15a762/9d84773cbaa14a428b58cf7a22fdef2b/FLAG10508c8bd [2021-06-10 12:25:16,332 INFO L306 CDTParser]: Found 1 translation units. [2021-06-10 12:25:16,332 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_pso.oepc.i [2021-06-10 12:25:16,348 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cba15a762/9d84773cbaa14a428b58cf7a22fdef2b/FLAG10508c8bd [2021-06-10 12:25:16,459 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cba15a762/9d84773cbaa14a428b58cf7a22fdef2b [2021-06-10 12:25:16,461 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-10 12:25:16,463 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-10 12:25:16,465 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-10 12:25:16,465 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-10 12:25:16,469 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-10 12:25:16,469 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.06 12:25:16" (1/1) ... [2021-06-10 12:25:16,471 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a829147 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:25:16, skipping insertion in model container [2021-06-10 12:25:16,471 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.06 12:25:16" (1/1) ... [2021-06-10 12:25:16,477 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-10 12:25:16,528 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-10 12:25:16,710 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_pso.oepc.i[950,963] [2021-06-10 12:25:16,869 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-10 12:25:16,876 INFO L203 MainTranslator]: Completed pre-run [2021-06-10 12:25:16,886 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_pso.oepc.i[950,963] [2021-06-10 12:25:16,938 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-10 12:25:17,011 INFO L208 MainTranslator]: Completed translation [2021-06-10 12:25:17,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:25:17 WrapperNode [2021-06-10 12:25:17,011 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-10 12:25:17,012 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-10 12:25:17,012 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-10 12:25:17,013 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-10 12:25:17,017 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:25:17" (1/1) ... [2021-06-10 12:25:17,044 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:25:17" (1/1) ... [2021-06-10 12:25:17,067 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-10 12:25:17,068 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-10 12:25:17,068 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-10 12:25:17,068 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-10 12:25:17,075 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:25:17" (1/1) ... [2021-06-10 12:25:17,075 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:25:17" (1/1) ... [2021-06-10 12:25:17,079 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:25:17" (1/1) ... [2021-06-10 12:25:17,079 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:25:17" (1/1) ... [2021-06-10 12:25:17,086 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:25:17" (1/1) ... [2021-06-10 12:25:17,089 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:25:17" (1/1) ... [2021-06-10 12:25:17,091 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:25:17" (1/1) ... [2021-06-10 12:25:17,095 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-10 12:25:17,096 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-10 12:25:17,096 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-10 12:25:17,096 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-10 12:25:17,097 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:25:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-10 12:25:17,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-10 12:25:17,170 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-10 12:25:17,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-10 12:25:17,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-10 12:25:17,170 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-10 12:25:17,170 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-10 12:25:17,170 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-10 12:25:17,171 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-10 12:25:17,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-10 12:25:17,171 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-10 12:25:17,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-10 12:25:17,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-10 12:25:17,172 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-10 12:25:18,802 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-10 12:25:18,802 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-10 12:25:18,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.06 12:25:18 BoogieIcfgContainer [2021-06-10 12:25:18,805 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-10 12:25:18,808 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-10 12:25:18,808 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-10 12:25:18,811 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-10 12:25:18,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.06 12:25:16" (1/3) ... [2021-06-10 12:25:18,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dd3dc92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.06 12:25:18, skipping insertion in model container [2021-06-10 12:25:18,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:25:17" (2/3) ... [2021-06-10 12:25:18,813 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dd3dc92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.06 12:25:18, skipping insertion in model container [2021-06-10 12:25:18,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.06 12:25:18" (3/3) ... [2021-06-10 12:25:18,814 INFO L111 eAbstractionObserver]: Analyzing ICFG safe010_pso.oepc.i [2021-06-10 12:25:18,820 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-10 12:25:18,830 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-06-10 12:25:18,831 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-10 12:25:18,860 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,860 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,860 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,860 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,860 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,860 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,860 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,861 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,861 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,861 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,861 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,861 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,861 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,861 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,861 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,861 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,862 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,862 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,862 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,862 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,862 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,862 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,862 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,864 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,865 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,865 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,865 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,865 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,865 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,865 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,866 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,866 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,866 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,866 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,867 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,867 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,867 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,867 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,867 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,867 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,867 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,867 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,868 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,868 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,868 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,868 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,868 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,868 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,868 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,869 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,869 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,869 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,869 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,869 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,869 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,869 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,870 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,870 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,870 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,870 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,871 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,872 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,872 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,872 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,872 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,872 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,872 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,873 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,873 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,873 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,873 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,873 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,875 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,875 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,875 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,875 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,875 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,875 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,875 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,875 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,876 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,876 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:18,877 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 12:25:18,890 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-06-10 12:25:18,905 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 12:25:18,905 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 12:25:18,905 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 12:25:18,905 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 12:25:18,905 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 12:25:18,905 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 12:25:18,905 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 12:25:18,905 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 12:25:18,914 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 85 places, 80 transitions, 170 flow [2021-06-10 12:25:18,941 INFO L129 PetriNetUnfolder]: 2/78 cut-off events. [2021-06-10 12:25:18,941 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 12:25:18,943 INFO L84 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 78 events. 2/78 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2021-06-10 12:25:18,944 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 80 transitions, 170 flow [2021-06-10 12:25:18,947 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 78 transitions, 162 flow [2021-06-10 12:25:18,954 INFO L129 PetriNetUnfolder]: 0/36 cut-off events. [2021-06-10 12:25:18,954 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 12:25:18,954 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:25:18,955 INFO L263 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] [2021-06-10 12:25:18,955 INFO L428 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:25:18,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:25:18,959 INFO L82 PathProgramCache]: Analyzing trace with hash 932370220, now seen corresponding path program 1 times [2021-06-10 12:25:18,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:25:18,967 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696208062] [2021-06-10 12:25:18,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:25:19,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:25:19,154 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:19,155 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:25:19,156 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:19,156 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:25:19,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 12:25:19,166 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696208062] [2021-06-10 12:25:19,167 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:25:19,167 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-10 12:25:19,168 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281945794] [2021-06-10 12:25:19,175 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 12:25:19,175 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:25:19,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 12:25:19,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 12:25:19,190 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 80 [2021-06-10 12:25:19,192 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 78 transitions, 162 flow. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:25:19,193 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:25:19,193 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 80 [2021-06-10 12:25:19,194 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:25:19,284 INFO L129 PetriNetUnfolder]: 16/185 cut-off events. [2021-06-10 12:25:19,285 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 12:25:19,286 INFO L84 FinitePrefix]: Finished finitePrefix Result has 227 conditions, 185 events. 16/185 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 648 event pairs, 11 based on Foata normal form. 9/183 useless extension candidates. Maximal degree in co-relation 186. Up to 27 conditions per place. [2021-06-10 12:25:19,287 INFO L132 encePairwiseOnDemand]: 75/80 looper letters, 7 selfloop transitions, 2 changer transitions 0/77 dead transitions. [2021-06-10 12:25:19,287 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 77 transitions, 178 flow [2021-06-10 12:25:19,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 12:25:19,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 12:25:19,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2021-06-10 12:25:19,303 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9333333333333333 [2021-06-10 12:25:19,303 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 224 transitions. [2021-06-10 12:25:19,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 224 transitions. [2021-06-10 12:25:19,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:25:19,307 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 224 transitions. [2021-06-10 12:25:19,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:25:19,317 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:25:19,318 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:25:19,319 INFO L185 Difference]: Start difference. First operand has 83 places, 78 transitions, 162 flow. Second operand 3 states and 224 transitions. [2021-06-10 12:25:19,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 77 transitions, 178 flow [2021-06-10 12:25:19,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 77 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-10 12:25:19,329 INFO L241 Difference]: Finished difference. Result has 81 places, 74 transitions, 156 flow [2021-06-10 12:25:19,331 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=81, PETRI_TRANSITIONS=74} [2021-06-10 12:25:19,331 INFO L343 CegarLoopForPetriNet]: 83 programPoint places, -2 predicate places. [2021-06-10 12:25:19,331 INFO L480 AbstractCegarLoop]: Abstraction has has 81 places, 74 transitions, 156 flow [2021-06-10 12:25:19,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:25:19,332 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:25:19,332 INFO L263 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] [2021-06-10 12:25:19,332 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-10 12:25:19,332 INFO L428 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:25:19,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:25:19,333 INFO L82 PathProgramCache]: Analyzing trace with hash -140732567, now seen corresponding path program 1 times [2021-06-10 12:25:19,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:25:19,333 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180676738] [2021-06-10 12:25:19,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:25:19,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:25:19,557 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:19,558 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:25:19,559 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:19,560 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:25:19,568 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 12:25:19,569 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 12:25:19,591 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:19,592 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:25:19,599 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:19,601 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:25:19,612 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:19,612 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:25:19,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 12:25:19,614 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180676738] [2021-06-10 12:25:19,614 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:25:19,614 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-10 12:25:19,616 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024628973] [2021-06-10 12:25:19,617 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-10 12:25:19,617 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:25:19,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-10 12:25:19,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-10 12:25:19,620 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 80 [2021-06-10 12:25:19,621 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 74 transitions, 156 flow. Second operand has 6 states, 6 states have (on average 69.16666666666667) internal successors, (415), 6 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:25:19,621 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:25:19,621 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 80 [2021-06-10 12:25:19,621 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:25:19,739 INFO L129 PetriNetUnfolder]: 4/107 cut-off events. [2021-06-10 12:25:19,739 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 12:25:19,740 INFO L84 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 107 events. 4/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 163 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 101. Up to 8 conditions per place. [2021-06-10 12:25:19,740 INFO L132 encePairwiseOnDemand]: 74/80 looper letters, 6 selfloop transitions, 2 changer transitions 21/86 dead transitions. [2021-06-10 12:25:19,740 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 86 transitions, 222 flow [2021-06-10 12:25:19,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-10 12:25:19,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-10 12:25:19,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 635 transitions. [2021-06-10 12:25:19,744 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8819444444444444 [2021-06-10 12:25:19,744 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 635 transitions. [2021-06-10 12:25:19,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 635 transitions. [2021-06-10 12:25:19,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:25:19,744 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 635 transitions. [2021-06-10 12:25:19,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 70.55555555555556) internal successors, (635), 9 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:25:19,749 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 80.0) internal successors, (800), 10 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:25:19,749 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 80.0) internal successors, (800), 10 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:25:19,749 INFO L185 Difference]: Start difference. First operand has 81 places, 74 transitions, 156 flow. Second operand 9 states and 635 transitions. [2021-06-10 12:25:19,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 86 transitions, 222 flow [2021-06-10 12:25:19,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 86 transitions, 218 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-10 12:25:19,752 INFO L241 Difference]: Finished difference. Result has 94 places, 65 transitions, 154 flow [2021-06-10 12:25:19,752 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=154, PETRI_PLACES=94, PETRI_TRANSITIONS=65} [2021-06-10 12:25:19,753 INFO L343 CegarLoopForPetriNet]: 83 programPoint places, 11 predicate places. [2021-06-10 12:25:19,753 INFO L480 AbstractCegarLoop]: Abstraction has has 94 places, 65 transitions, 154 flow [2021-06-10 12:25:19,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 69.16666666666667) internal successors, (415), 6 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:25:19,753 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:25:19,753 INFO L263 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] [2021-06-10 12:25:19,753 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-10 12:25:19,754 INFO L428 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:25:19,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:25:19,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1897507286, now seen corresponding path program 1 times [2021-06-10 12:25:19,754 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:25:19,754 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684547327] [2021-06-10 12:25:19,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:25:19,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:25:19,891 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:19,892 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:25:19,893 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:19,893 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:25:19,896 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:19,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:25:19,901 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 12:25:19,905 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 12:25:19,924 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:19,927 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:25:19,940 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:19,940 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:25:19,951 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:19,953 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:25:19,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 12:25:19,955 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684547327] [2021-06-10 12:25:19,955 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:25:19,955 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-10 12:25:19,955 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617723677] [2021-06-10 12:25:19,956 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-10 12:25:19,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:25:19,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-10 12:25:19,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-10 12:25:19,958 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 80 [2021-06-10 12:25:19,958 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 65 transitions, 154 flow. Second operand has 7 states, 7 states have (on average 67.28571428571429) internal successors, (471), 7 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:25:19,959 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:25:19,959 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 80 [2021-06-10 12:25:19,959 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:25:20,117 INFO L129 PetriNetUnfolder]: 4/88 cut-off events. [2021-06-10 12:25:20,117 INFO L130 PetriNetUnfolder]: For 17/24 co-relation queries the response was YES. [2021-06-10 12:25:20,117 INFO L84 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 88 events. 4/88 cut-off events. For 17/24 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 138 event pairs, 0 based on Foata normal form. 2/90 useless extension candidates. Maximal degree in co-relation 133. Up to 7 conditions per place. [2021-06-10 12:25:20,118 INFO L132 encePairwiseOnDemand]: 72/80 looper letters, 6 selfloop transitions, 4 changer transitions 12/77 dead transitions. [2021-06-10 12:25:20,118 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 77 transitions, 245 flow [2021-06-10 12:25:20,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-10 12:25:20,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-06-10 12:25:20,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 684 transitions. [2021-06-10 12:25:20,121 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.855 [2021-06-10 12:25:20,121 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 684 transitions. [2021-06-10 12:25:20,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 684 transitions. [2021-06-10 12:25:20,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:25:20,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 684 transitions. [2021-06-10 12:25:20,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 68.4) internal successors, (684), 10 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:25:20,126 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 80.0) internal successors, (880), 11 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:25:20,126 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 80.0) internal successors, (880), 11 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:25:20,126 INFO L185 Difference]: Start difference. First operand has 94 places, 65 transitions, 154 flow. Second operand 10 states and 684 transitions. [2021-06-10 12:25:20,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 77 transitions, 245 flow [2021-06-10 12:25:20,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 77 transitions, 211 flow, removed 14 selfloop flow, removed 8 redundant places. [2021-06-10 12:25:20,129 INFO L241 Difference]: Finished difference. Result has 88 places, 65 transitions, 168 flow [2021-06-10 12:25:20,129 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=168, PETRI_PLACES=88, PETRI_TRANSITIONS=65} [2021-06-10 12:25:20,130 INFO L343 CegarLoopForPetriNet]: 83 programPoint places, 5 predicate places. [2021-06-10 12:25:20,130 INFO L480 AbstractCegarLoop]: Abstraction has has 88 places, 65 transitions, 168 flow [2021-06-10 12:25:20,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 67.28571428571429) internal successors, (471), 7 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:25:20,130 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:25:20,131 INFO L263 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] [2021-06-10 12:25:20,131 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-10 12:25:20,131 INFO L428 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:25:20,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:25:20,131 INFO L82 PathProgramCache]: Analyzing trace with hash 333757561, now seen corresponding path program 1 times [2021-06-10 12:25:20,131 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:25:20,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720957534] [2021-06-10 12:25:20,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:25:20,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:25:20,242 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:20,242 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:25:20,243 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:20,243 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:25:20,248 INFO L142 QuantifierPusher]: treesize reduction 4, result has 78.9 percent of original size [2021-06-10 12:25:20,248 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-06-10 12:25:20,260 INFO L142 QuantifierPusher]: treesize reduction 4, result has 81.8 percent of original size [2021-06-10 12:25:20,261 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-06-10 12:25:20,309 INFO L142 QuantifierPusher]: treesize reduction 10, result has 84.8 percent of original size [2021-06-10 12:25:20,310 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 56 [2021-06-10 12:25:20,338 INFO L142 QuantifierPusher]: treesize reduction 28, result has 60.6 percent of original size [2021-06-10 12:25:20,340 INFO L147 QuantifierPusher]: treesize reduction 9, result has 79.1 percent of original size 34 [2021-06-10 12:25:20,371 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 12:25:20,372 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 12:25:20,391 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:20,392 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:25:20,401 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:20,402 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:25:20,413 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:20,414 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:25:20,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 12:25:20,415 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720957534] [2021-06-10 12:25:20,415 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:25:20,415 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-10 12:25:20,415 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019084998] [2021-06-10 12:25:20,415 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-10 12:25:20,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:25:20,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-10 12:25:20,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-10 12:25:20,417 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 80 [2021-06-10 12:25:20,418 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 65 transitions, 168 flow. Second operand has 10 states, 10 states have (on average 60.3) internal successors, (603), 10 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:25:20,419 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:25:20,419 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 80 [2021-06-10 12:25:20,419 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:25:20,734 INFO L129 PetriNetUnfolder]: 58/202 cut-off events. [2021-06-10 12:25:20,734 INFO L130 PetriNetUnfolder]: For 79/79 co-relation queries the response was YES. [2021-06-10 12:25:20,736 INFO L84 FinitePrefix]: Finished finitePrefix Result has 429 conditions, 202 events. 58/202 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 631 event pairs, 15 based on Foata normal form. 6/207 useless extension candidates. Maximal degree in co-relation 382. Up to 71 conditions per place. [2021-06-10 12:25:20,737 INFO L132 encePairwiseOnDemand]: 68/80 looper letters, 12 selfloop transitions, 8 changer transitions 22/91 dead transitions. [2021-06-10 12:25:20,737 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 91 transitions, 326 flow [2021-06-10 12:25:20,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-10 12:25:20,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-06-10 12:25:20,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 870 transitions. [2021-06-10 12:25:20,740 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7767857142857143 [2021-06-10 12:25:20,740 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 870 transitions. [2021-06-10 12:25:20,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 870 transitions. [2021-06-10 12:25:20,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:25:20,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 870 transitions. [2021-06-10 12:25:20,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 62.142857142857146) internal successors, (870), 14 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:25:20,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 80.0) internal successors, (1200), 15 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:25:20,746 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 80.0) internal successors, (1200), 15 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:25:20,746 INFO L185 Difference]: Start difference. First operand has 88 places, 65 transitions, 168 flow. Second operand 14 states and 870 transitions. [2021-06-10 12:25:20,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 91 transitions, 326 flow [2021-06-10 12:25:20,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 91 transitions, 280 flow, removed 18 selfloop flow, removed 10 redundant places. [2021-06-10 12:25:20,750 INFO L241 Difference]: Finished difference. Result has 92 places, 67 transitions, 195 flow [2021-06-10 12:25:20,750 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=195, PETRI_PLACES=92, PETRI_TRANSITIONS=67} [2021-06-10 12:25:20,750 INFO L343 CegarLoopForPetriNet]: 83 programPoint places, 9 predicate places. [2021-06-10 12:25:20,750 INFO L480 AbstractCegarLoop]: Abstraction has has 92 places, 67 transitions, 195 flow [2021-06-10 12:25:20,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 60.3) internal successors, (603), 10 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:25:20,751 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:25:20,751 INFO L263 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] [2021-06-10 12:25:20,751 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-10 12:25:20,751 INFO L428 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:25:20,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:25:20,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1645862095, now seen corresponding path program 1 times [2021-06-10 12:25:20,752 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:25:20,752 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251169372] [2021-06-10 12:25:20,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:25:20,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:25:20,822 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:20,823 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:25:20,823 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:20,824 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:25:20,827 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-06-10 12:25:20,828 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-10 12:25:20,843 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:20,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 12:25:20,851 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-06-10 12:25:20,852 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:25:20,861 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:20,861 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:25:20,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 12:25:20,862 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251169372] [2021-06-10 12:25:20,862 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:25:20,862 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-10 12:25:20,862 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409864226] [2021-06-10 12:25:20,863 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-10 12:25:20,863 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:25:20,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-10 12:25:20,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-10 12:25:20,864 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 80 [2021-06-10 12:25:20,865 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 67 transitions, 195 flow. Second operand has 6 states, 6 states have (on average 68.16666666666667) internal successors, (409), 6 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:25:20,865 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:25:20,865 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 80 [2021-06-10 12:25:20,865 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:25:20,980 INFO L129 PetriNetUnfolder]: 37/199 cut-off events. [2021-06-10 12:25:20,980 INFO L130 PetriNetUnfolder]: For 81/81 co-relation queries the response was YES. [2021-06-10 12:25:20,981 INFO L84 FinitePrefix]: Finished finitePrefix Result has 381 conditions, 199 events. 37/199 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 765 event pairs, 10 based on Foata normal form. 5/197 useless extension candidates. Maximal degree in co-relation 340. Up to 32 conditions per place. [2021-06-10 12:25:20,982 INFO L132 encePairwiseOnDemand]: 72/80 looper letters, 11 selfloop transitions, 11 changer transitions 6/86 dead transitions. [2021-06-10 12:25:20,982 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 86 transitions, 289 flow [2021-06-10 12:25:20,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-10 12:25:20,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-10 12:25:20,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 633 transitions. [2021-06-10 12:25:20,984 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8791666666666667 [2021-06-10 12:25:20,984 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 633 transitions. [2021-06-10 12:25:20,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 633 transitions. [2021-06-10 12:25:20,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:25:20,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 633 transitions. [2021-06-10 12:25:20,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 70.33333333333333) internal successors, (633), 9 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:25:20,988 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 80.0) internal successors, (800), 10 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:25:20,988 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 80.0) internal successors, (800), 10 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:25:20,988 INFO L185 Difference]: Start difference. First operand has 92 places, 67 transitions, 195 flow. Second operand 9 states and 633 transitions. [2021-06-10 12:25:20,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 86 transitions, 289 flow [2021-06-10 12:25:20,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 86 transitions, 270 flow, removed 3 selfloop flow, removed 9 redundant places. [2021-06-10 12:25:20,991 INFO L241 Difference]: Finished difference. Result has 90 places, 77 transitions, 253 flow [2021-06-10 12:25:20,991 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=253, PETRI_PLACES=90, PETRI_TRANSITIONS=77} [2021-06-10 12:25:20,991 INFO L343 CegarLoopForPetriNet]: 83 programPoint places, 7 predicate places. [2021-06-10 12:25:20,992 INFO L480 AbstractCegarLoop]: Abstraction has has 90 places, 77 transitions, 253 flow [2021-06-10 12:25:20,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 68.16666666666667) internal successors, (409), 6 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:25:20,992 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:25:20,992 INFO L263 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] [2021-06-10 12:25:20,992 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-10 12:25:20,992 INFO L428 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:25:20,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:25:20,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1923571334, now seen corresponding path program 1 times [2021-06-10 12:25:20,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:25:20,993 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245789] [2021-06-10 12:25:20,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:25:21,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:25:21,061 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:21,062 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:25:21,062 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:21,062 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:25:21,065 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:21,065 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:25:21,070 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-06-10 12:25:21,070 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-10 12:25:21,085 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:21,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 12:25:21,094 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-06-10 12:25:21,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:25:21,103 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:21,103 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:25:21,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 12:25:21,104 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245789] [2021-06-10 12:25:21,104 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:25:21,104 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-10 12:25:21,104 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933678113] [2021-06-10 12:25:21,104 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-10 12:25:21,105 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:25:21,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-10 12:25:21,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-10 12:25:21,106 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 80 [2021-06-10 12:25:21,106 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 77 transitions, 253 flow. Second operand has 7 states, 7 states have (on average 68.14285714285714) internal successors, (477), 7 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:25:21,107 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:25:21,107 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 80 [2021-06-10 12:25:21,107 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:25:21,265 INFO L129 PetriNetUnfolder]: 19/154 cut-off events. [2021-06-10 12:25:21,265 INFO L130 PetriNetUnfolder]: For 113/194 co-relation queries the response was YES. [2021-06-10 12:25:21,266 INFO L84 FinitePrefix]: Finished finitePrefix Result has 351 conditions, 154 events. 19/154 cut-off events. For 113/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 540 event pairs, 0 based on Foata normal form. 31/180 useless extension candidates. Maximal degree in co-relation 297. Up to 19 conditions per place. [2021-06-10 12:25:21,266 INFO L132 encePairwiseOnDemand]: 72/80 looper letters, 8 selfloop transitions, 15 changer transitions 10/91 dead transitions. [2021-06-10 12:25:21,266 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 91 transitions, 380 flow [2021-06-10 12:25:21,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-10 12:25:21,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-06-10 12:25:21,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 834 transitions. [2021-06-10 12:25:21,269 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.86875 [2021-06-10 12:25:21,269 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 834 transitions. [2021-06-10 12:25:21,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 834 transitions. [2021-06-10 12:25:21,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:25:21,269 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 834 transitions. [2021-06-10 12:25:21,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 69.5) internal successors, (834), 12 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:25:21,273 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 80.0) internal successors, (1040), 13 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:25:21,273 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 80.0) internal successors, (1040), 13 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:25:21,273 INFO L185 Difference]: Start difference. First operand has 90 places, 77 transitions, 253 flow. Second operand 12 states and 834 transitions. [2021-06-10 12:25:21,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 91 transitions, 380 flow [2021-06-10 12:25:21,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 91 transitions, 354 flow, removed 11 selfloop flow, removed 5 redundant places. [2021-06-10 12:25:21,276 INFO L241 Difference]: Finished difference. Result has 102 places, 79 transitions, 297 flow [2021-06-10 12:25:21,277 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=297, PETRI_PLACES=102, PETRI_TRANSITIONS=79} [2021-06-10 12:25:21,277 INFO L343 CegarLoopForPetriNet]: 83 programPoint places, 19 predicate places. [2021-06-10 12:25:21,277 INFO L480 AbstractCegarLoop]: Abstraction has has 102 places, 79 transitions, 297 flow [2021-06-10 12:25:21,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 68.14285714285714) internal successors, (477), 7 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:25:21,277 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:25:21,277 INFO L263 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, 1] [2021-06-10 12:25:21,278 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-10 12:25:21,278 INFO L428 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:25:21,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:25:21,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1778573945, now seen corresponding path program 1 times [2021-06-10 12:25:21,278 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:25:21,278 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074038971] [2021-06-10 12:25:21,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:25:21,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:25:21,359 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:21,360 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:25:21,360 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:21,360 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:25:21,363 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:21,364 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 12:25:21,370 INFO L142 QuantifierPusher]: treesize reduction 9, result has 75.0 percent of original size [2021-06-10 12:25:21,373 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-06-10 12:25:21,391 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:21,392 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-06-10 12:25:21,407 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:21,408 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-06-10 12:25:21,425 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:21,426 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-06-10 12:25:21,442 INFO L142 QuantifierPusher]: treesize reduction 26, result has 55.2 percent of original size [2021-06-10 12:25:21,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-06-10 12:25:21,463 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 12:25:21,464 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 12:25:21,523 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:21,524 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:25:21,533 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:21,534 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:25:21,544 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:21,545 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:25:21,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 12:25:21,546 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074038971] [2021-06-10 12:25:21,546 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:25:21,546 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-10 12:25:21,546 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386531796] [2021-06-10 12:25:21,547 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-10 12:25:21,547 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:25:21,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-10 12:25:21,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-06-10 12:25:21,549 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 80 [2021-06-10 12:25:21,549 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 79 transitions, 297 flow. Second operand has 12 states, 12 states have (on average 57.583333333333336) internal successors, (691), 12 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:25:21,550 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:25:21,550 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 80 [2021-06-10 12:25:21,550 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:25:21,768 INFO L129 PetriNetUnfolder]: 9/175 cut-off events. [2021-06-10 12:25:21,769 INFO L130 PetriNetUnfolder]: For 215/227 co-relation queries the response was YES. [2021-06-10 12:25:21,769 INFO L84 FinitePrefix]: Finished finitePrefix Result has 434 conditions, 175 events. 9/175 cut-off events. For 215/227 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 763 event pairs, 0 based on Foata normal form. 3/173 useless extension candidates. Maximal degree in co-relation 385. Up to 23 conditions per place. [2021-06-10 12:25:21,770 INFO L132 encePairwiseOnDemand]: 71/80 looper letters, 16 selfloop transitions, 4 changer transitions 10/86 dead transitions. [2021-06-10 12:25:21,770 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 86 transitions, 367 flow [2021-06-10 12:25:21,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-10 12:25:21,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-06-10 12:25:21,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 588 transitions. [2021-06-10 12:25:21,772 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.735 [2021-06-10 12:25:21,772 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 588 transitions. [2021-06-10 12:25:21,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 588 transitions. [2021-06-10 12:25:21,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:25:21,772 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 588 transitions. [2021-06-10 12:25:21,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 58.8) internal successors, (588), 10 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:25:21,775 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 80.0) internal successors, (880), 11 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:25:21,775 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 80.0) internal successors, (880), 11 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:25:21,775 INFO L185 Difference]: Start difference. First operand has 102 places, 79 transitions, 297 flow. Second operand 10 states and 588 transitions. [2021-06-10 12:25:21,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 86 transitions, 367 flow [2021-06-10 12:25:21,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 86 transitions, 333 flow, removed 6 selfloop flow, removed 10 redundant places. [2021-06-10 12:25:21,779 INFO L241 Difference]: Finished difference. Result has 103 places, 75 transitions, 258 flow [2021-06-10 12:25:21,779 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=258, PETRI_PLACES=103, PETRI_TRANSITIONS=75} [2021-06-10 12:25:21,780 INFO L343 CegarLoopForPetriNet]: 83 programPoint places, 20 predicate places. [2021-06-10 12:25:21,780 INFO L480 AbstractCegarLoop]: Abstraction has has 103 places, 75 transitions, 258 flow [2021-06-10 12:25:21,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 57.583333333333336) internal successors, (691), 12 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:25:21,780 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:25:21,780 INFO L263 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, 1] [2021-06-10 12:25:21,780 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-10 12:25:21,781 INFO L428 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:25:21,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:25:21,781 INFO L82 PathProgramCache]: Analyzing trace with hash -526664569, now seen corresponding path program 2 times [2021-06-10 12:25:21,781 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:25:21,781 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502679430] [2021-06-10 12:25:21,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:25:21,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 12:25:21,820 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 12:25:21,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 12:25:21,859 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 12:25:21,886 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 12:25:21,886 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 12:25:21,887 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-10 12:25:21,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.06 12:25:21 BasicIcfg [2021-06-10 12:25:21,981 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-10 12:25:21,982 INFO L168 Benchmark]: Toolchain (without parser) took 5518.91 ms. Allocated memory was 379.6 MB in the beginning and 507.5 MB in the end (delta: 127.9 MB). Free memory was 342.2 MB in the beginning and 391.6 MB in the end (delta: -49.4 MB). Peak memory consumption was 80.7 MB. Max. memory is 16.0 GB. [2021-06-10 12:25:21,982 INFO L168 Benchmark]: CDTParser took 0.91 ms. Allocated memory is still 379.6 MB. Free memory is still 360.3 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-06-10 12:25:21,983 INFO L168 Benchmark]: CACSL2BoogieTranslator took 546.54 ms. Allocated memory is still 379.6 MB. Free memory was 342.0 MB in the beginning and 340.2 MB in the end (delta: 1.8 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB. [2021-06-10 12:25:21,983 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.24 ms. Allocated memory is still 379.6 MB. Free memory was 339.2 MB in the beginning and 337.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-10 12:25:21,983 INFO L168 Benchmark]: Boogie Preprocessor took 26.81 ms. Allocated memory is still 379.6 MB. Free memory was 337.1 MB in the beginning and 335.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-10 12:25:21,984 INFO L168 Benchmark]: RCFGBuilder took 1709.57 ms. Allocated memory is still 379.6 MB. Free memory was 335.0 MB in the beginning and 322.3 MB in the end (delta: 12.6 MB). Peak memory consumption was 172.0 MB. Max. memory is 16.0 GB. [2021-06-10 12:25:21,984 INFO L168 Benchmark]: TraceAbstraction took 3173.43 ms. Allocated memory was 379.6 MB in the beginning and 507.5 MB in the end (delta: 127.9 MB). Free memory was 322.3 MB in the beginning and 391.6 MB in the end (delta: -69.3 MB). Peak memory consumption was 58.7 MB. Max. memory is 16.0 GB. [2021-06-10 12:25:21,998 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.91 ms. Allocated memory is still 379.6 MB. Free memory is still 360.3 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 546.54 ms. Allocated memory is still 379.6 MB. Free memory was 342.0 MB in the beginning and 340.2 MB in the end (delta: 1.8 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 55.24 ms. Allocated memory is still 379.6 MB. Free memory was 339.2 MB in the beginning and 337.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 26.81 ms. Allocated memory is still 379.6 MB. Free memory was 337.1 MB in the beginning and 335.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1709.57 ms. Allocated memory is still 379.6 MB. Free memory was 335.0 MB in the beginning and 322.3 MB in the end (delta: 12.6 MB). Peak memory consumption was 172.0 MB. Max. memory is 16.0 GB. * TraceAbstraction took 3173.43 ms. Allocated memory was 379.6 MB in the beginning and 507.5 MB in the end (delta: 127.9 MB). Free memory was 322.3 MB in the beginning and 391.6 MB in the end (delta: -69.3 MB). Peak memory consumption was 58.7 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L711] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L712] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L714] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L716] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L717] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L718] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L719] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L720] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L721] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L722] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L723] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L724] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L725] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L726] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L727] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L728] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L729] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L730] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L731] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L732] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L792] 0 pthread_t t2013; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L793] FCALL, FORK 0 pthread_create(&t2013, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L794] 0 pthread_t t2014; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] FCALL, FORK 0 pthread_create(&t2014, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y$w_buff1 = y$w_buff0 [L737] 1 y$w_buff0 = 2 [L738] 1 y$w_buff1_used = y$w_buff0_used [L739] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L741] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L742] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L743] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L744] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L767] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L774] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L750] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L751] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L752] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L753] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L753] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L754] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L802] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L803] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L804] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L804] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L805] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L805] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 y$flush_delayed = weak$$choice2 [L811] 0 y$mem_tmp = y [L812] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L812] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L813] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L813] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L814] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L814] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L815] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L815] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L816] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L817] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L818] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L818] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) [L820] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L820] 0 y = y$flush_delayed ? y$mem_tmp : y [L821] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] 0 reach_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 79 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 6.5ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 2986.4ms, OverallIterations: 8, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1323.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 42.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 64 SDtfs, 160 SDslu, 206 SDs, 0 SdLazy, 269 SolverSat, 77 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 313.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 981.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=297occurred in iteration=6, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 28.5ms SsaConstructionTime, 332.5ms SatisfiabilityAnalysisTime, 1030.6ms InterpolantComputationTime, 433 NumberOfCodeBlocks, 433 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 365 ConstructedInterpolants, 0 QuantifiedInterpolants, 1669 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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...