/usr/bin/java -Xmx8000000000 -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.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2cf4d3f9dd5fed411db405f577e28237a543b59a-2cf4d3f [2021-08-12 21:05:36,836 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-12 21:05:36,838 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-12 21:05:36,856 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-12 21:05:36,856 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-12 21:05:36,857 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-12 21:05:36,858 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-12 21:05:36,860 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-12 21:05:36,861 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-12 21:05:36,861 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-12 21:05:36,862 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-12 21:05:36,863 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-12 21:05:36,863 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-12 21:05:36,864 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-12 21:05:36,864 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-12 21:05:36,865 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-12 21:05:36,866 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-12 21:05:36,866 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-12 21:05:36,867 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-12 21:05:36,868 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-12 21:05:36,869 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-12 21:05:36,870 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-12 21:05:36,871 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-12 21:05:36,871 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-12 21:05:36,873 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-12 21:05:36,873 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-12 21:05:36,874 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-12 21:05:36,874 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-12 21:05:36,874 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-12 21:05:36,875 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-12 21:05:36,875 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-12 21:05:36,876 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-12 21:05:36,876 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-12 21:05:36,877 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-12 21:05:36,877 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-12 21:05:36,877 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-12 21:05:36,878 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-12 21:05:36,878 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-12 21:05:36,878 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-12 21:05:36,879 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-12 21:05:36,879 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-12 21:05:36,881 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-08-12 21:05:36,895 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-12 21:05:36,896 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-12 21:05:36,896 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-12 21:05:36,897 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-12 21:05:36,897 INFO L138 SettingsManager]: * Use SBE=true [2021-08-12 21:05:36,897 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-12 21:05:36,897 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-12 21:05:36,897 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-12 21:05:36,897 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-12 21:05:36,897 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-12 21:05:36,897 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-12 21:05:36,897 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-12 21:05:36,898 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-12 21:05:36,898 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-12 21:05:36,898 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-12 21:05:36,898 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-12 21:05:36,898 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-12 21:05:36,898 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-12 21:05:36,898 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-12 21:05:36,898 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-12 21:05:36,898 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-12 21:05:36,898 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-12 21:05:36,898 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-12 21:05:36,899 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-12 21:05:36,899 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-12 21:05:36,899 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-12 21:05:36,899 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-12 21:05:36,899 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-12 21:05:36,899 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-08-12 21:05:36,899 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-12 21:05:36,899 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-08-12 21:05:37,138 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-12 21:05:37,168 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-12 21:05:37,170 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-12 21:05:37,171 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-12 21:05:37,171 INFO L275 PluginConnector]: CDTParser initialized [2021-08-12 21:05:37,172 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_pso.opt.i [2021-08-12 21:05:37,215 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3807c7643/17095172ec3348d49609bdcc50f7a8fc/FLAGe6c1ab7cf [2021-08-12 21:05:37,660 INFO L306 CDTParser]: Found 1 translation units. [2021-08-12 21:05:37,660 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_pso.opt.i [2021-08-12 21:05:37,679 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3807c7643/17095172ec3348d49609bdcc50f7a8fc/FLAGe6c1ab7cf [2021-08-12 21:05:37,694 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3807c7643/17095172ec3348d49609bdcc50f7a8fc [2021-08-12 21:05:37,701 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-12 21:05:37,703 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-12 21:05:37,704 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-12 21:05:37,704 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-12 21:05:37,709 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-12 21:05:37,709 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.08 09:05:37" (1/1) ... [2021-08-12 21:05:37,710 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@723cac01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 09:05:37, skipping insertion in model container [2021-08-12 21:05:37,710 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.08 09:05:37" (1/1) ... [2021-08-12 21:05:37,715 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-12 21:05:37,760 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-12 21:05:37,881 WARN L224 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.opt.i[949,962] [2021-08-12 21:05:38,083 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-12 21:05:38,090 INFO L203 MainTranslator]: Completed pre-run [2021-08-12 21:05:38,100 WARN L224 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.opt.i[949,962] [2021-08-12 21:05:38,143 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-12 21:05:38,196 INFO L208 MainTranslator]: Completed translation [2021-08-12 21:05:38,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 09:05:38 WrapperNode [2021-08-12 21:05:38,198 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-12 21:05:38,199 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-12 21:05:38,199 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-12 21:05:38,199 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-12 21:05:38,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 09:05:38" (1/1) ... [2021-08-12 21:05:38,234 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 09:05:38" (1/1) ... [2021-08-12 21:05:38,262 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-12 21:05:38,263 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-12 21:05:38,263 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-12 21:05:38,263 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-12 21:05:38,269 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 09:05:38" (1/1) ... [2021-08-12 21:05:38,269 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 09:05:38" (1/1) ... [2021-08-12 21:05:38,272 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 09:05:38" (1/1) ... [2021-08-12 21:05:38,272 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 09:05:38" (1/1) ... [2021-08-12 21:05:38,277 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 09:05:38" (1/1) ... [2021-08-12 21:05:38,279 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 09:05:38" (1/1) ... [2021-08-12 21:05:38,281 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 09:05:38" (1/1) ... [2021-08-12 21:05:38,284 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-12 21:05:38,285 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-12 21:05:38,285 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-12 21:05:38,285 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-12 21:05:38,285 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 09:05:38" (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-08-12 21:05:38,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-12 21:05:38,409 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-12 21:05:38,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-12 21:05:38,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-12 21:05:38,410 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-12 21:05:38,410 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-12 21:05:38,410 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-12 21:05:38,410 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-12 21:05:38,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-12 21:05:38,411 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-12 21:05:38,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-12 21:05:38,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-12 21:05:38,412 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-12 21:05:39,546 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-12 21:05:39,546 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-12 21:05:39,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.08 09:05:39 BoogieIcfgContainer [2021-08-12 21:05:39,548 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-12 21:05:39,550 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-12 21:05:39,550 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-12 21:05:39,552 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-12 21:05:39,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.08 09:05:37" (1/3) ... [2021-08-12 21:05:39,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4240913b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.08 09:05:39, skipping insertion in model container [2021-08-12 21:05:39,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 09:05:38" (2/3) ... [2021-08-12 21:05:39,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4240913b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.08 09:05:39, skipping insertion in model container [2021-08-12 21:05:39,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.08 09:05:39" (3/3) ... [2021-08-12 21:05:39,554 INFO L111 eAbstractionObserver]: Analyzing ICFG safe010_pso.opt.i [2021-08-12 21:05:39,558 INFO L206 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-12 21:05:39,558 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-12 21:05:39,559 INFO L445 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-12 21:05:39,576 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,577 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,577 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,577 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,577 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,577 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,577 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,577 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,577 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,577 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,578 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,578 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,578 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,578 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,578 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,578 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,578 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,578 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,578 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,578 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,579 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,579 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,579 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,579 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,579 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,579 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,579 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,579 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,579 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,579 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,580 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,580 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,580 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,580 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,580 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,580 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,580 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,580 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,580 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,581 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,581 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,581 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,581 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,581 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,581 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,581 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,581 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,581 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,581 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,583 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,584 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,584 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,584 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,584 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,584 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,584 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,584 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,584 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,584 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,586 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,586 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,586 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,586 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,586 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,586 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,586 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,586 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,586 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,586 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,586 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,587 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 21:05:39,587 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-12 21:05:39,601 INFO L255 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-08-12 21:05:39,613 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-08-12 21:05:39,613 INFO L379 AbstractCegarLoop]: Hoare is false [2021-08-12 21:05:39,613 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-08-12 21:05:39,614 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-12 21:05:39,614 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-12 21:05:39,614 INFO L383 AbstractCegarLoop]: Difference is false [2021-08-12 21:05:39,614 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-12 21:05:39,614 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-08-12 21:05:39,620 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 91 places, 86 transitions, 182 flow [2021-08-12 21:05:39,639 INFO L129 PetriNetUnfolder]: 2/84 cut-off events. [2021-08-12 21:05:39,640 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-12 21:05:39,642 INFO L84 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 84 events. 2/84 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 39 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2021-08-12 21:05:39,642 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 86 transitions, 182 flow [2021-08-12 21:05:39,645 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 84 transitions, 174 flow [2021-08-12 21:05:39,649 INFO L129 PetriNetUnfolder]: 0/39 cut-off events. [2021-08-12 21:05:39,650 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-12 21:05:39,650 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 21:05:39,650 INFO L266 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] [2021-08-12 21:05:39,650 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 21:05:39,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 21:05:39,654 INFO L82 PathProgramCache]: Analyzing trace with hash -23040913, now seen corresponding path program 1 times [2021-08-12 21:05:39,659 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 21:05:39,659 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839459450] [2021-08-12 21:05:39,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 21:05:39,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 21:05:39,787 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:39,788 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 21:05:39,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:39,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 21:05:39,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 21:05:39,795 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 21:05:39,796 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839459450] [2021-08-12 21:05:39,796 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839459450] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 21:05:39,796 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 21:05:39,796 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-12 21:05:39,797 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151054887] [2021-08-12 21:05:39,802 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-08-12 21:05:39,803 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 21:05:39,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-12 21:05:39,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-12 21:05:39,812 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 86 [2021-08-12 21:05:39,814 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 84 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 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-08-12 21:05:39,814 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 21:05:39,814 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 86 [2021-08-12 21:05:39,814 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 21:05:39,854 INFO L129 PetriNetUnfolder]: 16/144 cut-off events. [2021-08-12 21:05:39,855 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-12 21:05:39,855 INFO L84 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 144 events. 16/144 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 361 event pairs, 2 based on Foata normal form. 7/144 useless extension candidates. Maximal degree in co-relation 143. Up to 27 conditions per place. [2021-08-12 21:05:39,857 INFO L132 encePairwiseOnDemand]: 81/86 looper letters, 7 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2021-08-12 21:05:39,857 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 83 transitions, 190 flow [2021-08-12 21:05:39,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-12 21:05:39,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-08-12 21:05:39,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 242 transitions. [2021-08-12 21:05:39,865 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.937984496124031 [2021-08-12 21:05:39,865 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 242 transitions. [2021-08-12 21:05:39,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 242 transitions. [2021-08-12 21:05:39,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 21:05:39,868 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 242 transitions. [2021-08-12 21:05:39,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 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-08-12 21:05:39,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 86.0) internal successors, (344), 4 states have internal predecessors, (344), 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-08-12 21:05:39,873 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 86.0) internal successors, (344), 4 states have internal predecessors, (344), 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-08-12 21:05:39,874 INFO L348 CegarLoopForPetriNet]: 89 programPoint places, 0 predicate places. [2021-08-12 21:05:39,874 INFO L482 AbstractCegarLoop]: Abstraction has has 89 places, 83 transitions, 190 flow [2021-08-12 21:05:39,874 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 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-08-12 21:05:39,874 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 21:05:39,874 INFO L266 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-08-12 21:05:39,875 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-12 21:05:39,875 INFO L430 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 21:05:39,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 21:05:39,875 INFO L82 PathProgramCache]: Analyzing trace with hash -580539508, now seen corresponding path program 1 times [2021-08-12 21:05:39,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 21:05:39,875 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685082337] [2021-08-12 21:05:39,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 21:05:39,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 21:05:39,970 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:39,970 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 21:05:39,970 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:39,971 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 21:05:39,978 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-12 21:05:39,978 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-12 21:05:39,990 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:39,990 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 21:05:39,996 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:39,996 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 21:05:40,002 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:40,002 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 21:05:40,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 21:05:40,003 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 21:05:40,003 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685082337] [2021-08-12 21:05:40,003 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685082337] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 21:05:40,004 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 21:05:40,004 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-12 21:05:40,004 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990833881] [2021-08-12 21:05:40,005 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-12 21:05:40,005 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 21:05:40,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-12 21:05:40,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-12 21:05:40,044 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 86 [2021-08-12 21:05:40,045 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 83 transitions, 190 flow. Second operand has 6 states, 6 states have (on average 75.16666666666667) internal successors, (451), 6 states have internal predecessors, (451), 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-08-12 21:05:40,045 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 21:05:40,045 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 86 [2021-08-12 21:05:40,045 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 21:05:40,136 INFO L129 PetriNetUnfolder]: 24/201 cut-off events. [2021-08-12 21:05:40,137 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2021-08-12 21:05:40,137 INFO L84 FinitePrefix]: Finished finitePrefix Result has 289 conditions, 201 events. 24/201 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 749 event pairs, 6 based on Foata normal form. 0/194 useless extension candidates. Maximal degree in co-relation 243. Up to 35 conditions per place. [2021-08-12 21:05:40,138 INFO L132 encePairwiseOnDemand]: 80/86 looper letters, 8 selfloop transitions, 2 changer transitions 13/96 dead transitions. [2021-08-12 21:05:40,138 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 96 transitions, 266 flow [2021-08-12 21:05:40,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-12 21:05:40,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-12 21:05:40,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 689 transitions. [2021-08-12 21:05:40,149 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8901808785529716 [2021-08-12 21:05:40,149 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 689 transitions. [2021-08-12 21:05:40,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 689 transitions. [2021-08-12 21:05:40,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 21:05:40,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 689 transitions. [2021-08-12 21:05:40,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 76.55555555555556) internal successors, (689), 9 states have internal predecessors, (689), 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-08-12 21:05:40,154 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 86.0) internal successors, (860), 10 states have internal predecessors, (860), 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-08-12 21:05:40,154 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 86.0) internal successors, (860), 10 states have internal predecessors, (860), 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-08-12 21:05:40,154 INFO L348 CegarLoopForPetriNet]: 89 programPoint places, 8 predicate places. [2021-08-12 21:05:40,154 INFO L482 AbstractCegarLoop]: Abstraction has has 97 places, 96 transitions, 266 flow [2021-08-12 21:05:40,155 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 75.16666666666667) internal successors, (451), 6 states have internal predecessors, (451), 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-08-12 21:05:40,155 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 21:05:40,155 INFO L266 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] [2021-08-12 21:05:40,155 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-12 21:05:40,155 INFO L430 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 21:05:40,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 21:05:40,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1979180659, now seen corresponding path program 1 times [2021-08-12 21:05:40,156 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 21:05:40,156 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60321390] [2021-08-12 21:05:40,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 21:05:40,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 21:05:40,225 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:40,226 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 21:05:40,226 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:40,226 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 21:05:40,229 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:40,229 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 21:05:40,232 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-12 21:05:40,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-12 21:05:40,244 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:40,245 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 21:05:40,251 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:40,252 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 21:05:40,259 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:40,259 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 21:05:40,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 21:05:40,260 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 21:05:40,260 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60321390] [2021-08-12 21:05:40,260 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60321390] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 21:05:40,260 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 21:05:40,260 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-12 21:05:40,260 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585523202] [2021-08-12 21:05:40,260 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-12 21:05:40,260 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 21:05:40,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-12 21:05:40,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-12 21:05:40,262 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 86 [2021-08-12 21:05:40,262 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 96 transitions, 266 flow. Second operand has 7 states, 7 states have (on average 73.28571428571429) internal successors, (513), 7 states have internal predecessors, (513), 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-08-12 21:05:40,262 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 21:05:40,262 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 86 [2021-08-12 21:05:40,262 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 21:05:40,424 INFO L129 PetriNetUnfolder]: 59/424 cut-off events. [2021-08-12 21:05:40,425 INFO L130 PetriNetUnfolder]: For 48/52 co-relation queries the response was YES. [2021-08-12 21:05:40,426 INFO L84 FinitePrefix]: Finished finitePrefix Result has 729 conditions, 424 events. 59/424 cut-off events. For 48/52 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2598 event pairs, 19 based on Foata normal form. 0/409 useless extension candidates. Maximal degree in co-relation 679. Up to 68 conditions per place. [2021-08-12 21:05:40,427 INFO L132 encePairwiseOnDemand]: 78/86 looper letters, 8 selfloop transitions, 4 changer transitions 44/126 dead transitions. [2021-08-12 21:05:40,427 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 126 transitions, 496 flow [2021-08-12 21:05:40,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-12 21:05:40,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-08-12 21:05:40,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 973 transitions. [2021-08-12 21:05:40,429 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.870304114490161 [2021-08-12 21:05:40,429 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 973 transitions. [2021-08-12 21:05:40,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 973 transitions. [2021-08-12 21:05:40,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 21:05:40,429 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 973 transitions. [2021-08-12 21:05:40,431 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 74.84615384615384) internal successors, (973), 13 states have internal predecessors, (973), 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-08-12 21:05:40,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 86.0) internal successors, (1204), 14 states have internal predecessors, (1204), 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-08-12 21:05:40,433 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 86.0) internal successors, (1204), 14 states have internal predecessors, (1204), 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-08-12 21:05:40,433 INFO L348 CegarLoopForPetriNet]: 89 programPoint places, 20 predicate places. [2021-08-12 21:05:40,433 INFO L482 AbstractCegarLoop]: Abstraction has has 109 places, 126 transitions, 496 flow [2021-08-12 21:05:40,433 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 73.28571428571429) internal successors, (513), 7 states have internal predecessors, (513), 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-08-12 21:05:40,433 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 21:05:40,433 INFO L266 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, 1] [2021-08-12 21:05:40,433 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-12 21:05:40,434 INFO L430 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 21:05:40,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 21:05:40,434 INFO L82 PathProgramCache]: Analyzing trace with hash 2011144508, now seen corresponding path program 1 times [2021-08-12 21:05:40,434 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 21:05:40,434 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689503045] [2021-08-12 21:05:40,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 21:05:40,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 21:05:40,526 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:40,526 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 21:05:40,527 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:40,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 21:05:40,529 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:40,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 21:05:40,533 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:40,534 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-12 21:05:40,539 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:40,539 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-12 21:05:40,551 INFO L142 QuantifierPusher]: treesize reduction 23, result has 80.2 percent of original size [2021-08-12 21:05:40,553 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 93 [2021-08-12 21:05:40,608 INFO L142 QuantifierPusher]: treesize reduction 47, result has 64.1 percent of original size [2021-08-12 21:05:40,609 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 84 [2021-08-12 21:05:40,634 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-12 21:05:40,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-12 21:05:40,648 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:40,648 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 21:05:40,655 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:40,655 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 21:05:40,663 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:40,663 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 21:05:40,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 21:05:40,664 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 21:05:40,664 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689503045] [2021-08-12 21:05:40,664 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689503045] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 21:05:40,664 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 21:05:40,664 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-12 21:05:40,664 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508640356] [2021-08-12 21:05:40,664 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-08-12 21:05:40,665 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 21:05:40,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-12 21:05:40,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-08-12 21:05:40,666 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 86 [2021-08-12 21:05:40,666 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 126 transitions, 496 flow. Second operand has 11 states, 11 states have (on average 66.18181818181819) internal successors, (728), 11 states have internal predecessors, (728), 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-08-12 21:05:40,666 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 21:05:40,667 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 86 [2021-08-12 21:05:40,667 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 21:05:41,010 INFO L129 PetriNetUnfolder]: 354/1252 cut-off events. [2021-08-12 21:05:41,011 INFO L130 PetriNetUnfolder]: For 428/506 co-relation queries the response was YES. [2021-08-12 21:05:41,013 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2786 conditions, 1252 events. 354/1252 cut-off events. For 428/506 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 9494 event pairs, 51 based on Foata normal form. 2/1239 useless extension candidates. Maximal degree in co-relation 2729. Up to 265 conditions per place. [2021-08-12 21:05:41,015 INFO L132 encePairwiseOnDemand]: 74/86 looper letters, 12 selfloop transitions, 8 changer transitions 147/224 dead transitions. [2021-08-12 21:05:41,015 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 224 transitions, 1308 flow [2021-08-12 21:05:41,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-12 21:05:41,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-08-12 21:05:41,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1168 transitions. [2021-08-12 21:05:41,017 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.79890560875513 [2021-08-12 21:05:41,017 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1168 transitions. [2021-08-12 21:05:41,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1168 transitions. [2021-08-12 21:05:41,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 21:05:41,056 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1168 transitions. [2021-08-12 21:05:41,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 68.70588235294117) internal successors, (1168), 17 states have internal predecessors, (1168), 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-08-12 21:05:41,059 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 86.0) internal successors, (1548), 18 states have internal predecessors, (1548), 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-08-12 21:05:41,060 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 86.0) internal successors, (1548), 18 states have internal predecessors, (1548), 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-08-12 21:05:41,060 INFO L348 CegarLoopForPetriNet]: 89 programPoint places, 36 predicate places. [2021-08-12 21:05:41,060 INFO L482 AbstractCegarLoop]: Abstraction has has 125 places, 224 transitions, 1308 flow [2021-08-12 21:05:41,060 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 66.18181818181819) internal successors, (728), 11 states have internal predecessors, (728), 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-08-12 21:05:41,060 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 21:05:41,061 INFO L266 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, 1, 1] [2021-08-12 21:05:41,061 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-12 21:05:41,061 INFO L430 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 21:05:41,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 21:05:41,061 INFO L82 PathProgramCache]: Analyzing trace with hash -2054722064, now seen corresponding path program 1 times [2021-08-12 21:05:41,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 21:05:41,062 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505380139] [2021-08-12 21:05:41,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 21:05:41,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 21:05:41,113 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:41,113 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 21:05:41,114 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:41,114 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 21:05:41,117 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-12 21:05:41,118 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-12 21:05:41,129 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:41,130 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 21:05:41,136 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-12 21:05:41,136 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 21:05:41,142 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:41,143 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 21:05:41,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 21:05:41,143 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 21:05:41,143 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505380139] [2021-08-12 21:05:41,143 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505380139] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 21:05:41,144 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 21:05:41,144 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-12 21:05:41,144 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967399096] [2021-08-12 21:05:41,144 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-12 21:05:41,144 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 21:05:41,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-12 21:05:41,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-12 21:05:41,145 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 86 [2021-08-12 21:05:41,146 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 224 transitions, 1308 flow. Second operand has 6 states, 6 states have (on average 74.16666666666667) internal successors, (445), 6 states have internal predecessors, (445), 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-08-12 21:05:41,146 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 21:05:41,146 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 86 [2021-08-12 21:05:41,146 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 21:05:41,270 INFO L129 PetriNetUnfolder]: 142/619 cut-off events. [2021-08-12 21:05:41,270 INFO L130 PetriNetUnfolder]: For 88/95 co-relation queries the response was YES. [2021-08-12 21:05:41,271 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1299 conditions, 619 events. 142/619 cut-off events. For 88/95 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3899 event pairs, 34 based on Foata normal form. 1/582 useless extension candidates. Maximal degree in co-relation 1239. Up to 181 conditions per place. [2021-08-12 21:05:41,272 INFO L132 encePairwiseOnDemand]: 77/86 looper letters, 13 selfloop transitions, 12 changer transitions 39/136 dead transitions. [2021-08-12 21:05:41,273 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 136 transitions, 600 flow [2021-08-12 21:05:41,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-12 21:05:41,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-08-12 21:05:41,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 765 transitions. [2021-08-12 21:05:41,275 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8895348837209303 [2021-08-12 21:05:41,275 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 765 transitions. [2021-08-12 21:05:41,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 765 transitions. [2021-08-12 21:05:41,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 21:05:41,275 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 765 transitions. [2021-08-12 21:05:41,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 76.5) internal successors, (765), 10 states have internal predecessors, (765), 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-08-12 21:05:41,277 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 86.0) internal successors, (946), 11 states have internal predecessors, (946), 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-08-12 21:05:41,277 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 86.0) internal successors, (946), 11 states have internal predecessors, (946), 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-08-12 21:05:41,278 INFO L348 CegarLoopForPetriNet]: 89 programPoint places, 36 predicate places. [2021-08-12 21:05:41,278 INFO L482 AbstractCegarLoop]: Abstraction has has 125 places, 136 transitions, 600 flow [2021-08-12 21:05:41,278 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 74.16666666666667) internal successors, (445), 6 states have internal predecessors, (445), 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-08-12 21:05:41,278 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 21:05:41,278 INFO L266 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, 1, 1, 1] [2021-08-12 21:05:41,278 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-12 21:05:41,278 INFO L430 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 21:05:41,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 21:05:41,279 INFO L82 PathProgramCache]: Analyzing trace with hash -257229869, now seen corresponding path program 1 times [2021-08-12 21:05:41,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 21:05:41,279 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920802140] [2021-08-12 21:05:41,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 21:05:41,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 21:05:41,323 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:41,324 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 21:05:41,324 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:41,324 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 21:05:41,327 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:41,327 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 21:05:41,330 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-12 21:05:41,331 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-12 21:05:41,342 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:41,343 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 21:05:41,349 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-12 21:05:41,350 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 21:05:41,357 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:41,357 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 21:05:41,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 21:05:41,358 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 21:05:41,358 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920802140] [2021-08-12 21:05:41,358 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920802140] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 21:05:41,358 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 21:05:41,359 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-12 21:05:41,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230066561] [2021-08-12 21:05:41,359 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-12 21:05:41,359 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 21:05:41,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-12 21:05:41,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-12 21:05:41,360 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 86 [2021-08-12 21:05:41,361 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 136 transitions, 600 flow. Second operand has 7 states, 7 states have (on average 74.14285714285714) internal successors, (519), 7 states have internal predecessors, (519), 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-08-12 21:05:41,361 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 21:05:41,361 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 86 [2021-08-12 21:05:41,361 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 21:05:41,506 INFO L129 PetriNetUnfolder]: 72/356 cut-off events. [2021-08-12 21:05:41,506 INFO L130 PetriNetUnfolder]: For 54/220 co-relation queries the response was YES. [2021-08-12 21:05:41,507 INFO L84 FinitePrefix]: Finished finitePrefix Result has 827 conditions, 356 events. 72/356 cut-off events. For 54/220 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2058 event pairs, 0 based on Foata normal form. 41/375 useless extension candidates. Maximal degree in co-relation 764. Up to 61 conditions per place. [2021-08-12 21:05:41,508 INFO L132 encePairwiseOnDemand]: 77/86 looper letters, 12 selfloop transitions, 15 changer transitions 40/131 dead transitions. [2021-08-12 21:05:41,508 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 131 transitions, 606 flow [2021-08-12 21:05:41,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-12 21:05:41,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-08-12 21:05:41,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 985 transitions. [2021-08-12 21:05:41,511 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8810375670840788 [2021-08-12 21:05:41,511 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 985 transitions. [2021-08-12 21:05:41,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 985 transitions. [2021-08-12 21:05:41,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 21:05:41,511 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 985 transitions. [2021-08-12 21:05:41,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 75.76923076923077) internal successors, (985), 13 states have internal predecessors, (985), 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-08-12 21:05:41,514 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 86.0) internal successors, (1204), 14 states have internal predecessors, (1204), 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-08-12 21:05:41,514 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 86.0) internal successors, (1204), 14 states have internal predecessors, (1204), 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-08-12 21:05:41,515 INFO L348 CegarLoopForPetriNet]: 89 programPoint places, 36 predicate places. [2021-08-12 21:05:41,515 INFO L482 AbstractCegarLoop]: Abstraction has has 125 places, 131 transitions, 606 flow [2021-08-12 21:05:41,515 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 74.14285714285714) internal successors, (519), 7 states have internal predecessors, (519), 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-08-12 21:05:41,515 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 21:05:41,515 INFO L266 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, 1, 1, 1, 1, 1, 1] [2021-08-12 21:05:41,515 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-12 21:05:41,515 INFO L430 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 21:05:41,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 21:05:41,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1857203048, now seen corresponding path program 1 times [2021-08-12 21:05:41,516 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 21:05:41,516 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044584066] [2021-08-12 21:05:41,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 21:05:41,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 21:05:41,577 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:41,578 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 21:05:41,578 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:41,578 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 21:05:41,581 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:41,581 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 21:05:41,585 INFO L142 QuantifierPusher]: treesize reduction 9, result has 75.0 percent of original size [2021-08-12 21:05:41,586 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-08-12 21:05:41,598 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:41,599 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-08-12 21:05:41,610 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:41,611 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-08-12 21:05:41,624 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:41,625 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-08-12 21:05:41,637 INFO L142 QuantifierPusher]: treesize reduction 26, result has 55.2 percent of original size [2021-08-12 21:05:41,638 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-08-12 21:05:41,652 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-12 21:05:41,653 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-12 21:05:41,666 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:41,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 21:05:41,673 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:41,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 21:05:41,681 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 21:05:41,682 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 21:05:41,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 21:05:41,682 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 21:05:41,682 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044584066] [2021-08-12 21:05:41,682 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044584066] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 21:05:41,683 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 21:05:41,683 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-12 21:05:41,683 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761379462] [2021-08-12 21:05:41,683 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-08-12 21:05:41,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 21:05:41,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-12 21:05:41,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-08-12 21:05:41,684 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 86 [2021-08-12 21:05:41,685 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 131 transitions, 606 flow. Second operand has 12 states, 12 states have (on average 63.583333333333336) internal successors, (763), 12 states have internal predecessors, (763), 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-08-12 21:05:41,685 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 21:05:41,685 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 86 [2021-08-12 21:05:41,685 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 21:05:41,903 INFO L129 PetriNetUnfolder]: 124/560 cut-off events. [2021-08-12 21:05:41,904 INFO L130 PetriNetUnfolder]: For 105/161 co-relation queries the response was YES. [2021-08-12 21:05:41,905 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1391 conditions, 560 events. 124/560 cut-off events. For 105/161 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4028 event pairs, 0 based on Foata normal form. 4/528 useless extension candidates. Maximal degree in co-relation 1318. Up to 109 conditions per place. [2021-08-12 21:05:41,905 INFO L132 encePairwiseOnDemand]: 77/86 looper letters, 16 selfloop transitions, 4 changer transitions 54/144 dead transitions. [2021-08-12 21:05:41,906 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 144 transitions, 794 flow [2021-08-12 21:05:41,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-12 21:05:41,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-08-12 21:05:41,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 652 transitions. [2021-08-12 21:05:41,907 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.7581395348837209 [2021-08-12 21:05:41,907 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 652 transitions. [2021-08-12 21:05:41,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 652 transitions. [2021-08-12 21:05:41,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 21:05:41,907 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 652 transitions. [2021-08-12 21:05:41,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 65.2) internal successors, (652), 10 states have internal predecessors, (652), 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-08-12 21:05:41,909 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 86.0) internal successors, (946), 11 states have internal predecessors, (946), 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-08-12 21:05:41,910 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 86.0) internal successors, (946), 11 states have internal predecessors, (946), 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-08-12 21:05:41,910 INFO L348 CegarLoopForPetriNet]: 89 programPoint places, 45 predicate places. [2021-08-12 21:05:41,910 INFO L482 AbstractCegarLoop]: Abstraction has has 134 places, 144 transitions, 794 flow [2021-08-12 21:05:41,910 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 63.583333333333336) internal successors, (763), 12 states have internal predecessors, (763), 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-08-12 21:05:41,910 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 21:05:41,910 INFO L266 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, 1, 1, 1, 1, 1, 1] [2021-08-12 21:05:41,910 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-12 21:05:41,910 INFO L430 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 21:05:41,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 21:05:41,911 INFO L82 PathProgramCache]: Analyzing trace with hash -97164960, now seen corresponding path program 2 times [2021-08-12 21:05:41,911 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 21:05:41,911 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256568478] [2021-08-12 21:05:41,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 21:05:41,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-12 21:05:41,935 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-12 21:05:41,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-12 21:05:41,963 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-12 21:05:41,983 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-12 21:05:41,983 INFO L651 BasicCegarLoop]: Counterexample might be feasible [2021-08-12 21:05:41,983 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-12 21:05:41,985 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-12 21:05:42,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.08 09:05:42 BasicIcfg [2021-08-12 21:05:42,040 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-12 21:05:42,040 INFO L168 Benchmark]: Toolchain (without parser) took 4337.43 ms. Allocated memory was 197.1 MB in the beginning and 404.8 MB in the end (delta: 207.6 MB). Free memory was 159.9 MB in the beginning and 293.4 MB in the end (delta: -133.5 MB). Peak memory consumption was 74.5 MB. Max. memory is 8.0 GB. [2021-08-12 21:05:42,040 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 197.1 MB. Free memory is still 178.2 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-08-12 21:05:42,041 INFO L168 Benchmark]: CACSL2BoogieTranslator took 494.13 ms. Allocated memory is still 197.1 MB. Free memory was 159.7 MB in the beginning and 156.3 MB in the end (delta: 3.4 MB). Peak memory consumption was 7.9 MB. Max. memory is 8.0 GB. [2021-08-12 21:05:42,041 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.56 ms. Allocated memory is still 197.1 MB. Free memory was 156.3 MB in the beginning and 153.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-12 21:05:42,041 INFO L168 Benchmark]: Boogie Preprocessor took 21.13 ms. Allocated memory is still 197.1 MB. Free memory was 153.5 MB in the beginning and 151.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-12 21:05:42,042 INFO L168 Benchmark]: RCFGBuilder took 1263.83 ms. Allocated memory was 197.1 MB in the beginning and 255.9 MB in the end (delta: 58.7 MB). Free memory was 151.4 MB in the beginning and 191.1 MB in the end (delta: -39.7 MB). Peak memory consumption was 64.6 MB. Max. memory is 8.0 GB. [2021-08-12 21:05:42,042 INFO L168 Benchmark]: TraceAbstraction took 2489.97 ms. Allocated memory was 255.9 MB in the beginning and 404.8 MB in the end (delta: 148.9 MB). Free memory was 190.6 MB in the beginning and 293.4 MB in the end (delta: -102.8 MB). Peak memory consumption was 45.6 MB. Max. memory is 8.0 GB. [2021-08-12 21:05:42,043 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.12 ms. Allocated memory is still 197.1 MB. Free memory is still 178.2 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 494.13 ms. Allocated memory is still 197.1 MB. Free memory was 159.7 MB in the beginning and 156.3 MB in the end (delta: 3.4 MB). Peak memory consumption was 7.9 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 63.56 ms. Allocated memory is still 197.1 MB. Free memory was 156.3 MB in the beginning and 153.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 21.13 ms. Allocated memory is still 197.1 MB. Free memory was 153.5 MB in the beginning and 151.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1263.83 ms. Allocated memory was 197.1 MB in the beginning and 255.9 MB in the end (delta: 58.7 MB). Free memory was 151.4 MB in the beginning and 191.1 MB in the end (delta: -39.7 MB). Peak memory consumption was 64.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 2489.97 ms. Allocated memory was 255.9 MB in the beginning and 404.8 MB in the end (delta: 148.9 MB). Free memory was 190.6 MB in the beginning and 293.4 MB in the end (delta: -102.8 MB). Peak memory consumption was 45.6 MB. Max. memory is 8.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 t2015; 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(&t2015, ((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] [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, 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, 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] [L794] 0 pthread_t t2016; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L795] FCALL, FORK 0 pthread_create(&t2016, ((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=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] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [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] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [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] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [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] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [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] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [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] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [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=0, 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=0, 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=0, 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 with 1 thread instances CFG has 5 procedures, 104 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 4.8ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 2373.1ms, OverallIterations: 8, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1296.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 30.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 59 SDtfs, 257 SDslu, 229 SDs, 0 SdLazy, 333 SolverSat, 87 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 251.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 767.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1308occurred in iteration=4, InterpolantAutomatonStates: 75, 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: 19.1ms SsaConstructionTime, 214.1ms SatisfiabilityAnalysisTime, 650.9ms InterpolantComputationTime, 477 NumberOfCodeBlocks, 477 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 403 ConstructedInterpolants, 0 QuantifiedInterpolants, 1929 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...