/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix042_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-11 11:08:47,820 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-11 11:08:47,821 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-11 11:08:47,842 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-11 11:08:47,842 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-11 11:08:47,843 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-11 11:08:47,844 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-11 11:08:47,845 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-11 11:08:47,846 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-11 11:08:47,847 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-11 11:08:47,848 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-11 11:08:47,848 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-11 11:08:47,849 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-11 11:08:47,849 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-11 11:08:47,850 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-11 11:08:47,851 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-11 11:08:47,851 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-11 11:08:47,852 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-11 11:08:47,853 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-11 11:08:47,854 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-11 11:08:47,855 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-11 11:08:47,856 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-11 11:08:47,856 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-11 11:08:47,857 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-11 11:08:47,859 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-11 11:08:47,859 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-11 11:08:47,859 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-11 11:08:47,859 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-11 11:08:47,860 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-11 11:08:47,860 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-11 11:08:47,860 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-11 11:08:47,861 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-11 11:08:47,861 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-11 11:08:47,862 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-11 11:08:47,862 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-11 11:08:47,863 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-11 11:08:47,863 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-11 11:08:47,863 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-11 11:08:47,863 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-11 11:08:47,864 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-11 11:08:47,864 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-11 11:08:47,865 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-FA-SemanticLbe.epf [2021-03-11 11:08:47,879 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-11 11:08:47,879 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-11 11:08:47,880 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-11 11:08:47,880 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-11 11:08:47,881 INFO L138 SettingsManager]: * Use SBE=true [2021-03-11 11:08:47,881 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-11 11:08:47,881 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-11 11:08:47,881 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-11 11:08:47,881 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-11 11:08:47,881 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-11 11:08:47,881 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-11 11:08:47,881 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-11 11:08:47,881 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-11 11:08:47,881 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-11 11:08:47,882 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-11 11:08:47,882 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-11 11:08:47,882 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-11 11:08:47,882 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-11 11:08:47,882 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-11 11:08:47,882 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-11 11:08:47,882 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-11 11:08:47,882 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 11:08:47,882 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-11 11:08:47,883 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-11 11:08:47,883 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-11 11:08:47,883 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-11 11:08:47,883 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-11 11:08:47,883 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-03-11 11:08:47,883 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-03-11 11:08:48,091 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-11 11:08:48,110 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-11 11:08:48,111 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-11 11:08:48,112 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-11 11:08:48,112 INFO L275 PluginConnector]: CDTParser initialized [2021-03-11 11:08:48,115 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042_power.opt.i [2021-03-11 11:08:48,170 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fab30fca/833f81abfca5481784c16b5bba4370bb/FLAG2587a685c [2021-03-11 11:08:48,550 INFO L306 CDTParser]: Found 1 translation units. [2021-03-11 11:08:48,565 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_power.opt.i [2021-03-11 11:08:48,576 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fab30fca/833f81abfca5481784c16b5bba4370bb/FLAG2587a685c [2021-03-11 11:08:48,926 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fab30fca/833f81abfca5481784c16b5bba4370bb [2021-03-11 11:08:48,927 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-11 11:08:48,930 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-11 11:08:48,931 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-11 11:08:48,931 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-11 11:08:48,934 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-11 11:08:48,935 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 11:08:48" (1/1) ... [2021-03-11 11:08:48,935 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6572bea8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:08:48, skipping insertion in model container [2021-03-11 11:08:48,935 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 11:08:48" (1/1) ... [2021-03-11 11:08:48,940 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-11 11:08:48,980 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-11 11:08:49,083 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_power.opt.i[950,963] [2021-03-11 11:08:49,182 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 11:08:49,188 INFO L203 MainTranslator]: Completed pre-run [2021-03-11 11:08:49,194 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_power.opt.i[950,963] [2021-03-11 11:08:49,220 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 11:08:49,268 INFO L208 MainTranslator]: Completed translation [2021-03-11 11:08:49,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:08:49 WrapperNode [2021-03-11 11:08:49,269 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-11 11:08:49,269 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-11 11:08:49,270 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-11 11:08:49,270 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-11 11:08:49,274 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:08:49" (1/1) ... [2021-03-11 11:08:49,283 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:08:49" (1/1) ... [2021-03-11 11:08:49,299 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-11 11:08:49,299 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-11 11:08:49,299 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-11 11:08:49,299 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-11 11:08:49,304 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:08:49" (1/1) ... [2021-03-11 11:08:49,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:08:49" (1/1) ... [2021-03-11 11:08:49,306 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:08:49" (1/1) ... [2021-03-11 11:08:49,307 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:08:49" (1/1) ... [2021-03-11 11:08:49,311 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:08:49" (1/1) ... [2021-03-11 11:08:49,313 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:08:49" (1/1) ... [2021-03-11 11:08:49,314 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:08:49" (1/1) ... [2021-03-11 11:08:49,316 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-11 11:08:49,317 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-11 11:08:49,317 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-11 11:08:49,317 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-11 11:08:49,318 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:08:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 11:08:49,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-11 11:08:49,369 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-11 11:08:49,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-11 11:08:49,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-11 11:08:49,370 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-11 11:08:49,370 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-11 11:08:49,370 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-11 11:08:49,370 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-11 11:08:49,370 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-11 11:08:49,370 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-11 11:08:49,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-11 11:08:49,370 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-11 11:08:49,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-11 11:08:49,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-11 11:08:49,371 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-11 11:08:50,483 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-11 11:08:50,484 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-11 11:08:50,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 11:08:50 BoogieIcfgContainer [2021-03-11 11:08:50,485 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-11 11:08:50,486 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-11 11:08:50,486 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-11 11:08:50,488 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-11 11:08:50,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 11:08:48" (1/3) ... [2021-03-11 11:08:50,488 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f5ba140 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 11:08:50, skipping insertion in model container [2021-03-11 11:08:50,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:08:49" (2/3) ... [2021-03-11 11:08:50,488 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f5ba140 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 11:08:50, skipping insertion in model container [2021-03-11 11:08:50,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 11:08:50" (3/3) ... [2021-03-11 11:08:50,489 INFO L111 eAbstractionObserver]: Analyzing ICFG mix042_power.opt.i [2021-03-11 11:08:50,493 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-03-11 11:08:50,493 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-11 11:08:50,495 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-11 11:08:50,496 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-11 11:08:50,519 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,519 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,519 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,519 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,520 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,520 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,520 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,520 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,520 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,520 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,521 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,521 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,521 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,521 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,521 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,522 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,522 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,522 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,522 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,522 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,524 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,524 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,524 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,524 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,526 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,526 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,526 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,526 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,526 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,526 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,527 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,527 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,531 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,531 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,531 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,531 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,531 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,531 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,531 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,532 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,532 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,532 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,532 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,533 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,534 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,534 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,534 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,534 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,534 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,534 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,535 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,535 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,535 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,535 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,535 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,536 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,536 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,536 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,536 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,537 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,537 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,537 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,537 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,537 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,538 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,538 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,538 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,538 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,538 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:50,538 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 11:08:50,548 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-11 11:08:50,567 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 11:08:50,567 INFO L377 AbstractCegarLoop]: Hoare is true [2021-03-11 11:08:50,567 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 11:08:50,567 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 11:08:50,571 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 11:08:50,571 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 11:08:50,571 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 11:08:50,571 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 11:08:50,584 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 11:08:50,592 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 101 transitions, 217 flow [2021-03-11 11:08:50,594 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 101 transitions, 217 flow [2021-03-11 11:08:50,594 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 109 places, 101 transitions, 217 flow [2021-03-11 11:08:50,627 INFO L129 PetriNetUnfolder]: 2/98 cut-off events. [2021-03-11 11:08:50,628 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 11:08:50,630 INFO L84 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 2/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2021-03-11 11:08:50,632 INFO L116 LiptonReduction]: Number of co-enabled transitions 1738 [2021-03-11 11:08:51,637 WARN L205 SmtUtils]: Spent 631.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2021-03-11 11:08:52,158 WARN L205 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 185 [2021-03-11 11:08:53,330 WARN L205 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-03-11 11:08:53,842 WARN L205 SmtUtils]: Spent 509.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-11 11:08:54,150 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-11 11:08:54,440 WARN L205 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-11 11:08:55,700 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-11 11:08:56,177 WARN L205 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-11 11:08:56,434 WARN L205 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-11 11:08:56,971 WARN L205 SmtUtils]: Spent 535.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-11 11:08:57,528 WARN L205 SmtUtils]: Spent 556.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-11 11:08:57,780 WARN L205 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-11 11:08:58,030 WARN L205 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-11 11:08:58,578 WARN L205 SmtUtils]: Spent 547.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-11 11:08:59,125 WARN L205 SmtUtils]: Spent 541.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-11 11:08:59,398 WARN L205 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-11 11:08:59,660 WARN L205 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-11 11:09:00,222 WARN L205 SmtUtils]: Spent 559.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-11 11:09:00,746 WARN L205 SmtUtils]: Spent 523.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-11 11:09:01,313 WARN L205 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 198 [2021-03-11 11:09:01,596 WARN L205 SmtUtils]: Spent 282.00 ms on a formula simplification that was a NOOP. DAG size: 198 [2021-03-11 11:09:02,674 WARN L205 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 278 DAG size of output: 277 [2021-03-11 11:09:03,238 WARN L205 SmtUtils]: Spent 562.00 ms on a formula simplification that was a NOOP. DAG size: 277 [2021-03-11 11:09:03,975 WARN L205 SmtUtils]: Spent 375.00 ms on a formula simplification that was a NOOP. DAG size: 204 [2021-03-11 11:09:04,241 WARN L205 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 202 [2021-03-11 11:09:05,043 WARN L205 SmtUtils]: Spent 800.00 ms on a formula simplification that was a NOOP. DAG size: 283 [2021-03-11 11:09:05,831 WARN L205 SmtUtils]: Spent 787.00 ms on a formula simplification that was a NOOP. DAG size: 281 [2021-03-11 11:09:06,594 WARN L205 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2021-03-11 11:09:06,719 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-11 11:09:06,996 WARN L205 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2021-03-11 11:09:07,126 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-11 11:09:07,131 INFO L131 LiptonReduction]: Checked pairs total: 4678 [2021-03-11 11:09:07,131 INFO L133 LiptonReduction]: Total number of compositions: 88 [2021-03-11 11:09:07,139 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 27 transitions, 69 flow [2021-03-11 11:09:07,174 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 750 states, 746 states have (on average 3.3552278820375334) internal successors, (2503), 749 states have internal predecessors, (2503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:09:07,177 INFO L276 IsEmpty]: Start isEmpty. Operand has 750 states, 746 states have (on average 3.3552278820375334) internal successors, (2503), 749 states have internal predecessors, (2503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:09:07,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-03-11 11:09:07,180 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:09:07,180 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:09:07,180 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:09:07,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:09:07,184 INFO L82 PathProgramCache]: Analyzing trace with hash 905360759, now seen corresponding path program 1 times [2021-03-11 11:09:07,189 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:09:07,190 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047910673] [2021-03-11 11:09:07,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:09:07,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:09:07,359 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:09:07,359 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:09:07,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:09:07,364 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047910673] [2021-03-11 11:09:07,364 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:09:07,364 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 11:09:07,365 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549363452] [2021-03-11 11:09:07,367 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 11:09:07,367 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:09:07,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 11:09:07,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 11:09:07,376 INFO L87 Difference]: Start difference. First operand has 750 states, 746 states have (on average 3.3552278820375334) internal successors, (2503), 749 states have internal predecessors, (2503), 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) Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:09:07,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:09:07,441 INFO L93 Difference]: Finished difference Result 650 states and 2028 transitions. [2021-03-11 11:09:07,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 11:09:07,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) Word has length 7 [2021-03-11 11:09:07,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:09:07,454 INFO L225 Difference]: With dead ends: 650 [2021-03-11 11:09:07,454 INFO L226 Difference]: Without dead ends: 530 [2021-03-11 11:09:07,454 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 11:09:07,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2021-03-11 11:09:07,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2021-03-11 11:09:07,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 529 states have (on average 3.0661625708884688) internal successors, (1622), 529 states have internal predecessors, (1622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:09:07,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1622 transitions. [2021-03-11 11:09:07,513 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1622 transitions. Word has length 7 [2021-03-11 11:09:07,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:09:07,513 INFO L480 AbstractCegarLoop]: Abstraction has 530 states and 1622 transitions. [2021-03-11 11:09:07,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:09:07,514 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1622 transitions. [2021-03-11 11:09:07,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-03-11 11:09:07,514 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:09:07,514 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:09:07,515 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-11 11:09:07,515 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:09:07,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:09:07,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1826617641, now seen corresponding path program 1 times [2021-03-11 11:09:07,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:09:07,515 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511320817] [2021-03-11 11:09:07,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:09:07,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:09:07,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:09:07,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 11:09:07,652 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:09:07,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 11:09:07,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:09:07,662 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511320817] [2021-03-11 11:09:07,662 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:09:07,662 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 11:09:07,663 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894109695] [2021-03-11 11:09:07,663 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 11:09:07,663 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:09:07,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 11:09:07,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-11 11:09:07,664 INFO L87 Difference]: Start difference. First operand 530 states and 1622 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:09:07,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:09:07,692 INFO L93 Difference]: Finished difference Result 522 states and 1592 transitions. [2021-03-11 11:09:07,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 11:09:07,693 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) Word has length 9 [2021-03-11 11:09:07,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:09:07,695 INFO L225 Difference]: With dead ends: 522 [2021-03-11 11:09:07,695 INFO L226 Difference]: Without dead ends: 522 [2021-03-11 11:09:07,696 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.9ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-11 11:09:07,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2021-03-11 11:09:07,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 522. [2021-03-11 11:09:07,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 521 states have (on average 3.055662188099808) internal successors, (1592), 521 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:09:07,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 1592 transitions. [2021-03-11 11:09:07,712 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 1592 transitions. Word has length 9 [2021-03-11 11:09:07,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:09:07,712 INFO L480 AbstractCegarLoop]: Abstraction has 522 states and 1592 transitions. [2021-03-11 11:09:07,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:09:07,713 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 1592 transitions. [2021-03-11 11:09:07,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-03-11 11:09:07,713 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:09:07,713 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:09:07,714 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-11 11:09:07,714 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:09:07,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:09:07,714 INFO L82 PathProgramCache]: Analyzing trace with hash -790286839, now seen corresponding path program 1 times [2021-03-11 11:09:07,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:09:07,714 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792052139] [2021-03-11 11:09:07,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:09:07,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:09:07,758 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:09:07,758 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:09:07,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:09:07,763 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792052139] [2021-03-11 11:09:07,763 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:09:07,763 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 11:09:07,763 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383445248] [2021-03-11 11:09:07,763 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 11:09:07,763 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:09:07,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 11:09:07,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 11:09:07,764 INFO L87 Difference]: Start difference. First operand 522 states and 1592 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:09:07,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:09:07,773 INFO L93 Difference]: Finished difference Result 490 states and 1480 transitions. [2021-03-11 11:09:07,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 11:09:07,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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) Word has length 10 [2021-03-11 11:09:07,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:09:07,796 INFO L225 Difference]: With dead ends: 490 [2021-03-11 11:09:07,796 INFO L226 Difference]: Without dead ends: 490 [2021-03-11 11:09:07,796 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 11:09:07,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2021-03-11 11:09:07,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 490. [2021-03-11 11:09:07,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 489 states have (on average 3.0265848670756648) internal successors, (1480), 489 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:09:07,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 1480 transitions. [2021-03-11 11:09:07,809 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 1480 transitions. Word has length 10 [2021-03-11 11:09:07,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:09:07,809 INFO L480 AbstractCegarLoop]: Abstraction has 490 states and 1480 transitions. [2021-03-11 11:09:07,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:09:07,809 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 1480 transitions. [2021-03-11 11:09:07,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-03-11 11:09:07,810 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:09:07,810 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:09:07,810 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-11 11:09:07,810 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:09:07,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:09:07,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1270910170, now seen corresponding path program 1 times [2021-03-11 11:09:07,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:09:07,811 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932504194] [2021-03-11 11:09:07,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:09:07,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:09:07,853 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:09:07,854 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 11:09:07,858 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:09:07,858 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 11:09:07,864 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:09:07,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 11:09:07,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:09:07,865 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932504194] [2021-03-11 11:09:07,865 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:09:07,865 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 11:09:07,865 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318670110] [2021-03-11 11:09:07,865 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 11:09:07,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:09:07,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 11:09:07,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-11 11:09:07,866 INFO L87 Difference]: Start difference. First operand 490 states and 1480 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:09:07,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:09:07,887 INFO L93 Difference]: Finished difference Result 474 states and 1420 transitions. [2021-03-11 11:09:07,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 11:09:07,887 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) Word has length 11 [2021-03-11 11:09:07,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:09:07,889 INFO L225 Difference]: With dead ends: 474 [2021-03-11 11:09:07,889 INFO L226 Difference]: Without dead ends: 474 [2021-03-11 11:09:07,889 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-11 11:09:07,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2021-03-11 11:09:07,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 474. [2021-03-11 11:09:07,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 473 states have (on average 3.0021141649048624) internal successors, (1420), 473 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:09:07,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 1420 transitions. [2021-03-11 11:09:07,898 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 1420 transitions. Word has length 11 [2021-03-11 11:09:07,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:09:07,898 INFO L480 AbstractCegarLoop]: Abstraction has 474 states and 1420 transitions. [2021-03-11 11:09:07,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:09:07,898 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 1420 transitions. [2021-03-11 11:09:07,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-03-11 11:09:07,900 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:09:07,900 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:09:07,900 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-11 11:09:07,900 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:09:07,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:09:07,900 INFO L82 PathProgramCache]: Analyzing trace with hash 954269895, now seen corresponding path program 1 times [2021-03-11 11:09:07,901 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:09:07,901 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122841234] [2021-03-11 11:09:07,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:09:07,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:09:07,943 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:09:07,947 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 11:09:07,952 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:09:07,954 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 11:09:07,962 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:09:07,962 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-11 11:09:07,973 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:09:07,974 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-11 11:09:07,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:09:07,992 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122841234] [2021-03-11 11:09:07,992 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:09:07,992 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 11:09:07,992 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652694314] [2021-03-11 11:09:07,993 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 11:09:07,993 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:09:07,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 11:09:07,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-11 11:09:07,993 INFO L87 Difference]: Start difference. First operand 474 states and 1420 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:09:08,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:09:08,071 INFO L93 Difference]: Finished difference Result 542 states and 1631 transitions. [2021-03-11 11:09:08,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-11 11:09:08,072 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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) Word has length 13 [2021-03-11 11:09:08,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:09:08,074 INFO L225 Difference]: With dead ends: 542 [2021-03-11 11:09:08,074 INFO L226 Difference]: Without dead ends: 542 [2021-03-11 11:09:08,074 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 62.8ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-11 11:09:08,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2021-03-11 11:09:08,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 534. [2021-03-11 11:09:08,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 533 states have (on average 3.026266416510319) internal successors, (1613), 533 states have internal predecessors, (1613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:09:08,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 1613 transitions. [2021-03-11 11:09:08,084 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 1613 transitions. Word has length 13 [2021-03-11 11:09:08,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:09:08,084 INFO L480 AbstractCegarLoop]: Abstraction has 534 states and 1613 transitions. [2021-03-11 11:09:08,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:09:08,085 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 1613 transitions. [2021-03-11 11:09:08,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-03-11 11:09:08,086 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:09:08,086 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:09:08,086 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-11 11:09:08,086 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:09:08,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:09:08,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1573911225, now seen corresponding path program 1 times [2021-03-11 11:09:08,086 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:09:08,086 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798297080] [2021-03-11 11:09:08,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:09:08,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:09:08,127 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:09:08,127 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:09:08,130 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:09:08,130 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 11:09:08,135 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:09:08,135 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 11:09:08,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:09:08,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798297080] [2021-03-11 11:09:08,135 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:09:08,136 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 11:09:08,136 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709123168] [2021-03-11 11:09:08,136 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 11:09:08,136 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:09:08,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 11:09:08,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 11:09:08,136 INFO L87 Difference]: Start difference. First operand 534 states and 1613 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:09:08,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:09:08,158 INFO L93 Difference]: Finished difference Result 506 states and 1350 transitions. [2021-03-11 11:09:08,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 11:09:08,159 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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) Word has length 13 [2021-03-11 11:09:08,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:09:08,160 INFO L225 Difference]: With dead ends: 506 [2021-03-11 11:09:08,160 INFO L226 Difference]: Without dead ends: 366 [2021-03-11 11:09:08,160 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-11 11:09:08,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-03-11 11:09:08,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2021-03-11 11:09:08,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 365 states have (on average 2.578082191780822) internal successors, (941), 365 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:09:08,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 941 transitions. [2021-03-11 11:09:08,167 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 941 transitions. Word has length 13 [2021-03-11 11:09:08,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:09:08,167 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 941 transitions. [2021-03-11 11:09:08,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:09:08,167 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 941 transitions. [2021-03-11 11:09:08,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-03-11 11:09:08,167 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:09:08,167 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:09:08,167 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-11 11:09:08,168 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:09:08,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:09:08,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1128443826, now seen corresponding path program 1 times [2021-03-11 11:09:08,168 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:09:08,168 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139130758] [2021-03-11 11:09:08,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:09:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:09:08,231 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:09:08,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:09:08,233 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:09:08,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:09:08,237 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:09:08,237 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 11:09:08,242 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:09:08,242 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 11:09:08,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:09:08,243 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139130758] [2021-03-11 11:09:08,243 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:09:08,243 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 11:09:08,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828759177] [2021-03-11 11:09:08,244 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 11:09:08,244 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:09:08,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 11:09:08,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 11:09:08,244 INFO L87 Difference]: Start difference. First operand 366 states and 941 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:09:08,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:09:08,278 INFO L93 Difference]: Finished difference Result 297 states and 705 transitions. [2021-03-11 11:09:08,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-11 11:09:08,278 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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) Word has length 14 [2021-03-11 11:09:08,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:09:08,279 INFO L225 Difference]: With dead ends: 297 [2021-03-11 11:09:08,279 INFO L226 Difference]: Without dead ends: 229 [2021-03-11 11:09:08,282 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 13.8ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-11 11:09:08,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2021-03-11 11:09:08,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 217. [2021-03-11 11:09:08,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 2.300925925925926) internal successors, (497), 216 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:09:08,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 497 transitions. [2021-03-11 11:09:08,285 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 497 transitions. Word has length 14 [2021-03-11 11:09:08,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:09:08,286 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 497 transitions. [2021-03-11 11:09:08,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:09:08,286 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 497 transitions. [2021-03-11 11:09:08,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-03-11 11:09:08,287 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:09:08,287 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:09:08,287 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-11 11:09:08,287 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:09:08,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:09:08,287 INFO L82 PathProgramCache]: Analyzing trace with hash 668044008, now seen corresponding path program 1 times [2021-03-11 11:09:08,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:09:08,287 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408395830] [2021-03-11 11:09:08,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:09:08,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:09:08,340 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:09:08,340 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 11:09:08,341 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:09:08,341 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:09:08,343 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:09:08,343 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:09:08,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:09:08,346 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408395830] [2021-03-11 11:09:08,346 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:09:08,346 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 11:09:08,346 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982260920] [2021-03-11 11:09:08,347 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 11:09:08,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:09:08,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 11:09:08,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 11:09:08,347 INFO L87 Difference]: Start difference. First operand 217 states and 497 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:09:08,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:09:08,360 INFO L93 Difference]: Finished difference Result 291 states and 646 transitions. [2021-03-11 11:09:08,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-11 11:09:08,361 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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) Word has length 17 [2021-03-11 11:09:08,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:09:08,362 INFO L225 Difference]: With dead ends: 291 [2021-03-11 11:09:08,362 INFO L226 Difference]: Without dead ends: 220 [2021-03-11 11:09:08,362 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-11 11:09:08,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-03-11 11:09:08,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 217. [2021-03-11 11:09:08,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 2.2222222222222223) internal successors, (480), 216 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:09:08,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 480 transitions. [2021-03-11 11:09:08,366 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 480 transitions. Word has length 17 [2021-03-11 11:09:08,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:09:08,366 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 480 transitions. [2021-03-11 11:09:08,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:09:08,366 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 480 transitions. [2021-03-11 11:09:08,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-03-11 11:09:08,367 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:09:08,367 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:09:08,367 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-11 11:09:08,367 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:09:08,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:09:08,367 INFO L82 PathProgramCache]: Analyzing trace with hash -724449802, now seen corresponding path program 2 times [2021-03-11 11:09:08,367 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:09:08,367 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747783269] [2021-03-11 11:09:08,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:09:08,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:09:08,429 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:09:08,429 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:09:08,431 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:09:08,432 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:09:08,436 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:09:08,436 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:09:08,440 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:09:08,441 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 11:09:08,446 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:09:08,447 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 11:09:08,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:09:08,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747783269] [2021-03-11 11:09:08,447 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:09:08,447 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 11:09:08,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821919022] [2021-03-11 11:09:08,448 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 11:09:08,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:09:08,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 11:09:08,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-11 11:09:08,449 INFO L87 Difference]: Start difference. First operand 217 states and 480 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:09:08,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:09:08,485 INFO L93 Difference]: Finished difference Result 195 states and 435 transitions. [2021-03-11 11:09:08,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 11:09:08,485 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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) Word has length 17 [2021-03-11 11:09:08,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:09:08,486 INFO L225 Difference]: With dead ends: 195 [2021-03-11 11:09:08,486 INFO L226 Difference]: Without dead ends: 100 [2021-03-11 11:09:08,486 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 17.9ms TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-03-11 11:09:08,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-03-11 11:09:08,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 92. [2021-03-11 11:09:08,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 2.032967032967033) internal successors, (185), 91 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:09:08,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 185 transitions. [2021-03-11 11:09:08,488 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 185 transitions. Word has length 17 [2021-03-11 11:09:08,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:09:08,488 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 185 transitions. [2021-03-11 11:09:08,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:09:08,489 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 185 transitions. [2021-03-11 11:09:08,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-11 11:09:08,489 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:09:08,489 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:09:08,489 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-11 11:09:08,489 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:09:08,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:09:08,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1669378837, now seen corresponding path program 1 times [2021-03-11 11:09:08,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:09:08,490 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435183341] [2021-03-11 11:09:08,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:09:08,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:09:08,531 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:09:08,531 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 11:09:08,532 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:09:08,532 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:09:08,534 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:09:08,534 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:09:08,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:09:08,538 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435183341] [2021-03-11 11:09:08,538 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:09:08,538 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 11:09:08,538 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751056940] [2021-03-11 11:09:08,538 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 11:09:08,538 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:09:08,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 11:09:08,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 11:09:08,539 INFO L87 Difference]: Start difference. First operand 92 states and 185 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:09:08,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:09:08,550 INFO L93 Difference]: Finished difference Result 118 states and 233 transitions. [2021-03-11 11:09:08,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-11 11:09:08,551 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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) Word has length 21 [2021-03-11 11:09:08,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:09:08,551 INFO L225 Difference]: With dead ends: 118 [2021-03-11 11:09:08,551 INFO L226 Difference]: Without dead ends: 48 [2021-03-11 11:09:08,553 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-11 11:09:08,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2021-03-11 11:09:08,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2021-03-11 11:09:08,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.7234042553191489) internal successors, (81), 47 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:09:08,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 81 transitions. [2021-03-11 11:09:08,554 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 81 transitions. Word has length 21 [2021-03-11 11:09:08,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:09:08,555 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 81 transitions. [2021-03-11 11:09:08,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:09:08,555 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 81 transitions. [2021-03-11 11:09:08,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-11 11:09:08,556 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:09:08,556 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:09:08,556 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-11 11:09:08,556 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:09:08,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:09:08,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1783107383, now seen corresponding path program 2 times [2021-03-11 11:09:08,557 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:09:08,557 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418824069] [2021-03-11 11:09:08,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:09:08,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:09:08,614 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:09:08,614 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 11:09:08,619 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:09:08,621 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 11:09:08,631 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:09:08,632 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 11:09:08,642 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:09:08,643 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 11:09:08,651 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:09:08,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 11:09:08,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:09:08,661 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418824069] [2021-03-11 11:09:08,661 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:09:08,661 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 11:09:08,662 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767708170] [2021-03-11 11:09:08,662 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 11:09:08,662 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:09:08,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 11:09:08,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-11 11:09:08,662 INFO L87 Difference]: Start difference. First operand 48 states and 81 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:09:08,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:09:08,713 INFO L93 Difference]: Finished difference Result 62 states and 103 transitions. [2021-03-11 11:09:08,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 11:09:08,714 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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) Word has length 21 [2021-03-11 11:09:08,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:09:08,714 INFO L225 Difference]: With dead ends: 62 [2021-03-11 11:09:08,714 INFO L226 Difference]: Without dead ends: 36 [2021-03-11 11:09:08,714 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 47.6ms TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-03-11 11:09:08,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2021-03-11 11:09:08,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2021-03-11 11:09:08,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 35 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:09:08,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2021-03-11 11:09:08,715 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 53 transitions. Word has length 21 [2021-03-11 11:09:08,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:09:08,716 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 53 transitions. [2021-03-11 11:09:08,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:09:08,716 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 53 transitions. [2021-03-11 11:09:08,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-11 11:09:08,716 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:09:08,716 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:09:08,716 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-11 11:09:08,716 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:09:08,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:09:08,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1637834507, now seen corresponding path program 3 times [2021-03-11 11:09:08,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:09:08,717 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842450592] [2021-03-11 11:09:08,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:09:08,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 11:09:08,755 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 11:09:08,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 11:09:08,783 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 11:09:08,810 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 11:09:08,810 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 11:09:08,810 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-11 11:09:08,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.03 11:09:08 BasicIcfg [2021-03-11 11:09:08,878 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-11 11:09:08,878 INFO L168 Benchmark]: Toolchain (without parser) took 19950.31 ms. Allocated memory was 255.9 MB in the beginning and 515.9 MB in the end (delta: 260.0 MB). Free memory was 232.9 MB in the beginning and 232.4 MB in the end (delta: 453.5 kB). Peak memory consumption was 260.0 MB. Max. memory is 16.0 GB. [2021-03-11 11:09:08,879 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 255.9 MB. Free memory is still 238.0 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-11 11:09:08,879 INFO L168 Benchmark]: CACSL2BoogieTranslator took 337.84 ms. Allocated memory was 255.9 MB in the beginning and 350.2 MB in the end (delta: 94.4 MB). Free memory was 232.3 MB in the beginning and 309.1 MB in the end (delta: -76.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. [2021-03-11 11:09:08,879 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.32 ms. Allocated memory is still 350.2 MB. Free memory was 309.1 MB in the beginning and 306.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 11:09:08,879 INFO L168 Benchmark]: Boogie Preprocessor took 17.46 ms. Allocated memory is still 350.2 MB. Free memory was 306.5 MB in the beginning and 304.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 11:09:08,879 INFO L168 Benchmark]: RCFGBuilder took 1167.89 ms. Allocated memory is still 350.2 MB. Free memory was 304.4 MB in the beginning and 234.1 MB in the end (delta: 70.3 MB). Peak memory consumption was 72.2 MB. Max. memory is 16.0 GB. [2021-03-11 11:09:08,880 INFO L168 Benchmark]: TraceAbstraction took 18392.18 ms. Allocated memory was 350.2 MB in the beginning and 515.9 MB in the end (delta: 165.7 MB). Free memory was 233.1 MB in the beginning and 232.4 MB in the end (delta: 674.6 kB). Peak memory consumption was 166.3 MB. Max. memory is 16.0 GB. [2021-03-11 11:09:08,881 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.09 ms. Allocated memory is still 255.9 MB. Free memory is still 238.0 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 337.84 ms. Allocated memory was 255.9 MB in the beginning and 350.2 MB in the end (delta: 94.4 MB). Free memory was 232.3 MB in the beginning and 309.1 MB in the end (delta: -76.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 29.32 ms. Allocated memory is still 350.2 MB. Free memory was 309.1 MB in the beginning and 306.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 17.46 ms. Allocated memory is still 350.2 MB. Free memory was 306.5 MB in the beginning and 304.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1167.89 ms. Allocated memory is still 350.2 MB. Free memory was 304.4 MB in the beginning and 234.1 MB in the end (delta: 70.3 MB). Peak memory consumption was 72.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 18392.18 ms. Allocated memory was 350.2 MB in the beginning and 515.9 MB in the end (delta: 165.7 MB). Free memory was 233.1 MB in the beginning and 232.4 MB in the end (delta: 674.6 kB). Peak memory consumption was 166.3 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 16537.3ms, 109 PlacesBefore, 36 PlacesAfterwards, 101 TransitionsBefore, 27 TransitionsAfterwards, 1738 CoEnabledTransitionPairs, 7 FixpointIterations, 38 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 88 TotalNumberOfCompositions, 4678 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2417, positive: 2240, positive conditional: 0, positive unconditional: 2240, negative: 177, negative conditional: 0, negative unconditional: 177, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1296, positive: 1244, positive conditional: 0, positive unconditional: 1244, negative: 52, negative conditional: 0, negative unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1296, positive: 1218, positive conditional: 0, positive unconditional: 1218, negative: 78, negative conditional: 0, negative unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 78, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 52, negative conditional: 0, negative unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 659, positive: 51, positive conditional: 0, positive unconditional: 51, negative: 608, negative conditional: 0, negative unconditional: 608, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2417, positive: 996, positive conditional: 0, positive unconditional: 996, negative: 125, negative conditional: 0, negative unconditional: 125, unknown: 1296, unknown conditional: 0, unknown unconditional: 1296] , Statistics on independence cache: Total cache size (in pairs): 140, Positive cache size: 121, Positive conditional cache size: 0, Positive unconditional cache size: 121, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff0_thd3; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L825] 0 pthread_t t1108; [L826] FCALL, FORK 0 pthread_create(&t1108, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L827] 0 pthread_t t1109; [L828] FCALL, FORK 0 pthread_create(&t1109, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L829] 0 pthread_t t1110; [L830] FCALL, FORK 0 pthread_create(&t1110, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L782] 3 y$w_buff1 = y$w_buff0 [L783] 3 y$w_buff0 = 2 [L784] 3 y$w_buff1_used = y$w_buff0_used [L785] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L787] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L788] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L789] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L790] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L791] 3 y$r_buff0_thd3 = (_Bool)1 [L794] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L757] 1 return 0; [L762] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L803] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L804] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L805] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L806] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L806] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L807] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L807] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L768] 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) [L768] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L768] 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) [L768] 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) [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L770] 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 [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L772] 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 [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 3 return 0; [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L836] 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) [L836] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L836] 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) [L836] 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) [L837] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L837] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L838] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L838] 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 [L839] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L839] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L840] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L840] 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 [L843] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L844] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L845] 0 y$flush_delayed = weak$$choice2 [L846] 0 y$mem_tmp = y [L847] 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) [L847] 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) [L848] 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)) [L848] 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) [L848] 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)) [L848] 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)) [L849] 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)) [L849] 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) [L849] 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)) [L849] 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)) [L850] 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)) [L850] 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) [L850] 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)) [L850] 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)) [L851] 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)) [L851] 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) [L851] 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)) [L851] 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)) [L852] 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)) [L852] 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) [L852] 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)) [L852] 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)) [L853] 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)) [L853] 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) [L853] 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)) [L853] 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)) [L854] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L855] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L855] 0 y = y$flush_delayed ? y$mem_tmp : y [L856] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 100 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 18245.3ms, OverallIterations: 12, TraceHistogramMax: 1, EmptinessCheckTime: 11.8ms, AutomataDifference: 437.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 16603.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 270 SDtfs, 267 SDslu, 405 SDs, 0 SdLazy, 187 SolverSat, 49 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 170.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 200.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=750occurred in iteration=0, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 114.8ms AutomataMinimizationTime, 11 MinimizatonAttempts, 31 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 31.3ms SsaConstructionTime, 299.3ms SatisfiabilityAnalysisTime, 542.2ms InterpolantComputationTime, 174 NumberOfCodeBlocks, 174 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 142 ConstructedInterpolants, 0 QuantifiedInterpolants, 849 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...