/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-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2abb09bbbae98a04ae2fcc735832bfdba44f6fbc-2abb09b [2021-06-05 19:58:02,879 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 19:58:02,880 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 19:58:02,907 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 19:58:02,908 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 19:58:02,910 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 19:58:02,913 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 19:58:02,917 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 19:58:02,918 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 19:58:02,925 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 19:58:02,926 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 19:58:02,927 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 19:58:02,927 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 19:58:02,928 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 19:58:02,929 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 19:58:02,930 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 19:58:02,931 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 19:58:02,931 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 19:58:02,935 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 19:58:02,940 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 19:58:02,941 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 19:58:02,941 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 19:58:02,942 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 19:58:02,943 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 19:58:02,945 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 19:58:02,945 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 19:58:02,945 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 19:58:02,946 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 19:58:02,946 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 19:58:02,947 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 19:58:02,947 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 19:58:02,948 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 19:58:02,949 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 19:58:02,949 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 19:58:02,950 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 19:58:02,950 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 19:58:02,950 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 19:58:02,950 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 19:58:02,950 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 19:58:02,951 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 19:58:02,951 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 19:58:02,952 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-NoLbe.epf [2021-06-05 19:58:02,982 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 19:58:02,983 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 19:58:02,983 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 19:58:02,983 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 19:58:02,985 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 19:58:02,985 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 19:58:02,985 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 19:58:02,985 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 19:58:02,985 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 19:58:02,985 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 19:58:02,986 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 19:58:02,986 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 19:58:02,986 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 19:58:02,986 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 19:58:02,986 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 19:58:02,986 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 19:58:02,986 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 19:58:02,986 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 19:58:02,986 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 19:58:02,987 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 19:58:02,987 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 19:58:02,987 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 19:58:02,987 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 19:58:02,987 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 19:58:02,987 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 19:58:02,987 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 19:58:02,987 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 19:58:02,987 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 19:58:02,987 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 19:58:02,987 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 19:58:02,987 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 19:58:02,988 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-05 19:58:03,211 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 19:58:03,223 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 19:58:03,225 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 19:58:03,226 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-05 19:58:03,226 INFO L275 PluginConnector]: CDTParser initialized [2021-06-05 19:58:03,226 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_power.oepc.i [2021-06-05 19:58:03,265 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17c88ae99/181f16ba5d9546eeb56a592a45554556/FLAGb2d024467 [2021-06-05 19:58:03,672 INFO L306 CDTParser]: Found 1 translation units. [2021-06-05 19:58:03,673 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.oepc.i [2021-06-05 19:58:03,697 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17c88ae99/181f16ba5d9546eeb56a592a45554556/FLAGb2d024467 [2021-06-05 19:58:04,052 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17c88ae99/181f16ba5d9546eeb56a592a45554556 [2021-06-05 19:58:04,054 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 19:58:04,055 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-05 19:58:04,055 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-05 19:58:04,056 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-05 19:58:04,058 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-05 19:58:04,059 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 07:58:04" (1/1) ... [2021-06-05 19:58:04,059 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b97e6f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:58:04, skipping insertion in model container [2021-06-05 19:58:04,060 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 07:58:04" (1/1) ... [2021-06-05 19:58:04,063 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-05 19:58:04,095 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-05 19:58:04,216 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.oepc.i[952,965] [2021-06-05 19:58:04,323 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 19:58:04,328 INFO L203 MainTranslator]: Completed pre-run [2021-06-05 19:58:04,335 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.oepc.i[952,965] [2021-06-05 19:58:04,361 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 19:58:04,395 INFO L208 MainTranslator]: Completed translation [2021-06-05 19:58:04,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:58:04 WrapperNode [2021-06-05 19:58:04,396 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-05 19:58:04,397 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 19:58:04,397 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 19:58:04,397 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 19:58:04,401 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:58:04" (1/1) ... [2021-06-05 19:58:04,428 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:58:04" (1/1) ... [2021-06-05 19:58:04,452 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 19:58:04,452 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 19:58:04,453 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 19:58:04,453 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 19:58:04,458 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:58:04" (1/1) ... [2021-06-05 19:58:04,458 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:58:04" (1/1) ... [2021-06-05 19:58:04,460 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:58:04" (1/1) ... [2021-06-05 19:58:04,461 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:58:04" (1/1) ... [2021-06-05 19:58:04,466 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:58:04" (1/1) ... [2021-06-05 19:58:04,468 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:58:04" (1/1) ... [2021-06-05 19:58:04,481 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:58:04" (1/1) ... [2021-06-05 19:58:04,485 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 19:58:04,485 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 19:58:04,485 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 19:58:04,485 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 19:58:04,486 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:58:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 19:58:04,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-05 19:58:04,552 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-05 19:58:04,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-05 19:58:04,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-05 19:58:04,553 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-05 19:58:04,554 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-05 19:58:04,554 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-05 19:58:04,554 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-05 19:58:04,554 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-05 19:58:04,554 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-05 19:58:04,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-05 19:58:04,555 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-05 19:58:04,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 19:58:04,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 19:58:04,557 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-05 19:58:05,761 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 19:58:05,761 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-05 19:58:05,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 07:58:05 BoogieIcfgContainer [2021-06-05 19:58:05,763 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 19:58:05,764 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 19:58:05,765 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 19:58:05,766 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 19:58:05,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.06 07:58:04" (1/3) ... [2021-06-05 19:58:05,767 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50ebcdf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 07:58:05, skipping insertion in model container [2021-06-05 19:58:05,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:58:04" (2/3) ... [2021-06-05 19:58:05,767 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50ebcdf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 07:58:05, skipping insertion in model container [2021-06-05 19:58:05,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 07:58:05" (3/3) ... [2021-06-05 19:58:05,768 INFO L111 eAbstractionObserver]: Analyzing ICFG safe030_power.oepc.i [2021-06-05 19:58:05,774 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 19:58:05,774 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 19:58:05,774 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-05 19:58:05,775 INFO L471 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 19:58:05,797 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,797 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,797 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,797 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,797 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,797 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,797 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,797 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,798 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,798 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,798 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,798 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,798 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,798 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,798 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,798 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,798 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,798 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,799 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,799 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,799 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,799 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,799 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,800 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,800 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,800 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,800 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,801 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,801 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,801 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,801 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,802 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,802 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,802 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,802 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,802 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,802 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,802 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,802 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,802 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,803 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,803 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,803 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,803 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,803 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,803 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,803 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,803 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,803 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,803 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,805 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,805 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,805 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,805 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,805 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,805 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,805 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,805 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,805 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,805 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,806 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,806 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,806 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,806 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,806 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,806 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,806 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,806 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,806 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,806 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,806 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,807 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,807 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,807 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,807 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,807 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,807 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,809 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,809 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,809 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,809 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,809 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,809 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,809 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,809 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,809 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,810 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,812 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,814 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,814 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,814 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,819 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,820 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,820 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,820 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,820 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,821 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,821 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,821 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,821 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,821 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,821 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,821 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,821 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,821 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,821 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,822 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,822 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:58:05,823 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 19:58:05,838 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 19:58:05,856 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 19:58:05,857 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 19:58:05,857 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 19:58:05,857 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 19:58:05,857 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 19:58:05,857 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 19:58:05,857 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 19:58:05,857 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P0======== [2021-06-05 19:58:05,866 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 113 places, 105 transitions, 225 flow [2021-06-05 19:58:06,611 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 16157 states, 16153 states have (on average 3.635114220268681) internal successors, (58718), 16156 states have internal predecessors, (58718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:06,635 INFO L276 IsEmpty]: Start isEmpty. Operand has 16157 states, 16153 states have (on average 3.635114220268681) internal successors, (58718), 16156 states have internal predecessors, (58718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:06,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-05 19:58:06,711 INFO L301 ceAbstractionStarter]: Result for error location P0 was SAFE (1/3) [2021-06-05 19:58:06,712 INFO L255 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-06-05 19:58:06,717 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 19:58:06,717 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 19:58:06,717 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 19:58:06,717 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 19:58:06,717 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 19:58:06,717 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 19:58:06,717 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 19:58:06,717 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-06-05 19:58:06,720 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 113 places, 105 transitions, 225 flow [2021-06-05 19:58:07,248 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 16157 states, 16153 states have (on average 3.635114220268681) internal successors, (58718), 16156 states have internal predecessors, (58718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:07,273 INFO L276 IsEmpty]: Start isEmpty. Operand has 16157 states, 16153 states have (on average 3.635114220268681) internal successors, (58718), 16156 states have internal predecessors, (58718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:07,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-06-05 19:58:07,283 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:58:07,284 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 19:58:07,284 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:58:07,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:58:07,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1389165035, now seen corresponding path program 1 times [2021-06-05 19:58:07,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:58:07,293 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856793203] [2021-06-05 19:58:07,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:58:07,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:58:07,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 19:58:07,636 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:58:07,637 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856793203] [2021-06-05 19:58:07,637 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856793203] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:58:07,637 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:58:07,637 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 19:58:07,637 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767910336] [2021-06-05 19:58:07,640 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 19:58:07,640 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:58:07,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 19:58:07,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 19:58:07,668 INFO L87 Difference]: Start difference. First operand has 16157 states, 16153 states have (on average 3.635114220268681) internal successors, (58718), 16156 states have internal predecessors, (58718), 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 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:07,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:58:07,967 INFO L93 Difference]: Finished difference Result 22781 states and 80932 transitions. [2021-06-05 19:58:07,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 19:58:07,968 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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 66 [2021-06-05 19:58:07,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:58:08,040 INFO L225 Difference]: With dead ends: 22781 [2021-06-05 19:58:08,040 INFO L226 Difference]: Without dead ends: 8921 [2021-06-05 19:58:08,041 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 74.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 19:58:08,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8921 states. [2021-06-05 19:58:08,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8921 to 8921. [2021-06-05 19:58:08,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8921 states, 8919 states have (on average 3.4929924879470793) internal successors, (31154), 8920 states have internal predecessors, (31154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:08,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8921 states to 8921 states and 31154 transitions. [2021-06-05 19:58:08,333 INFO L78 Accepts]: Start accepts. Automaton has 8921 states and 31154 transitions. Word has length 66 [2021-06-05 19:58:08,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:58:08,335 INFO L482 AbstractCegarLoop]: Abstraction has 8921 states and 31154 transitions. [2021-06-05 19:58:08,335 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:08,335 INFO L276 IsEmpty]: Start isEmpty. Operand 8921 states and 31154 transitions. [2021-06-05 19:58:08,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-06-05 19:58:08,347 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:58:08,347 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 19:58:08,348 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 19:58:08,348 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:58:08,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:58:08,348 INFO L82 PathProgramCache]: Analyzing trace with hash -183393644, now seen corresponding path program 1 times [2021-06-05 19:58:08,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:58:08,349 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487049527] [2021-06-05 19:58:08,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:58:08,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:58:08,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 19:58:08,583 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:58:08,583 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487049527] [2021-06-05 19:58:08,584 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487049527] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:58:08,584 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:58:08,584 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 19:58:08,584 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308077407] [2021-06-05 19:58:08,585 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 19:58:08,585 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:58:08,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 19:58:08,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 19:58:08,586 INFO L87 Difference]: Start difference. First operand 8921 states and 31154 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:08,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:58:08,731 INFO L93 Difference]: Finished difference Result 10361 states and 35882 transitions. [2021-06-05 19:58:08,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 19:58:08,732 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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 68 [2021-06-05 19:58:08,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:58:08,824 INFO L225 Difference]: With dead ends: 10361 [2021-06-05 19:58:08,824 INFO L226 Difference]: Without dead ends: 8633 [2021-06-05 19:58:08,825 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 138.3ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 19:58:08,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8633 states. [2021-06-05 19:58:08,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8633 to 8633. [2021-06-05 19:58:08,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8633 states, 8631 states have (on average 3.481635963387788) internal successors, (30050), 8632 states have internal predecessors, (30050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:09,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8633 states to 8633 states and 30050 transitions. [2021-06-05 19:58:09,011 INFO L78 Accepts]: Start accepts. Automaton has 8633 states and 30050 transitions. Word has length 68 [2021-06-05 19:58:09,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:58:09,011 INFO L482 AbstractCegarLoop]: Abstraction has 8633 states and 30050 transitions. [2021-06-05 19:58:09,011 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:09,012 INFO L276 IsEmpty]: Start isEmpty. Operand 8633 states and 30050 transitions. [2021-06-05 19:58:09,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-06-05 19:58:09,028 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:58:09,028 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 19:58:09,028 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 19:58:09,029 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:58:09,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:58:09,029 INFO L82 PathProgramCache]: Analyzing trace with hash -92275972, now seen corresponding path program 1 times [2021-06-05 19:58:09,030 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:58:09,030 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202284046] [2021-06-05 19:58:09,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:58:09,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:58:09,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 19:58:09,162 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:58:09,164 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202284046] [2021-06-05 19:58:09,165 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202284046] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:58:09,165 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:58:09,165 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 19:58:09,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13055917] [2021-06-05 19:58:09,165 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 19:58:09,165 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:58:09,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 19:58:09,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 19:58:09,166 INFO L87 Difference]: Start difference. First operand 8633 states and 30050 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:09,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:58:09,469 INFO L93 Difference]: Finished difference Result 10685 states and 36652 transitions. [2021-06-05 19:58:09,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 19:58:09,470 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 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 69 [2021-06-05 19:58:09,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:58:09,492 INFO L225 Difference]: With dead ends: 10685 [2021-06-05 19:58:09,492 INFO L226 Difference]: Without dead ends: 8885 [2021-06-05 19:58:09,493 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 127.0ms TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2021-06-05 19:58:09,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8885 states. [2021-06-05 19:58:09,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8885 to 8441. [2021-06-05 19:58:09,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8441 states, 8439 states have (on average 3.462732551250148) internal successors, (29222), 8440 states have internal predecessors, (29222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:09,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8441 states to 8441 states and 29222 transitions. [2021-06-05 19:58:09,700 INFO L78 Accepts]: Start accepts. Automaton has 8441 states and 29222 transitions. Word has length 69 [2021-06-05 19:58:09,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:58:09,701 INFO L482 AbstractCegarLoop]: Abstraction has 8441 states and 29222 transitions. [2021-06-05 19:58:09,701 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:09,701 INFO L276 IsEmpty]: Start isEmpty. Operand 8441 states and 29222 transitions. [2021-06-05 19:58:09,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 19:58:09,712 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:58:09,712 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 19:58:09,712 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 19:58:09,712 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:58:09,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:58:09,712 INFO L82 PathProgramCache]: Analyzing trace with hash 312175067, now seen corresponding path program 1 times [2021-06-05 19:58:09,712 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:58:09,713 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694828031] [2021-06-05 19:58:09,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:58:09,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:58:09,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 19:58:09,767 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:58:09,767 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694828031] [2021-06-05 19:58:09,767 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694828031] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:58:09,767 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:58:09,767 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 19:58:09,767 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106618031] [2021-06-05 19:58:09,768 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 19:58:09,768 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:58:09,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 19:58:09,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 19:58:09,768 INFO L87 Difference]: Start difference. First operand 8441 states and 29222 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:09,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:58:09,812 INFO L93 Difference]: Finished difference Result 7526 states and 26027 transitions. [2021-06-05 19:58:09,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 19:58:09,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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 71 [2021-06-05 19:58:09,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:58:09,830 INFO L225 Difference]: With dead ends: 7526 [2021-06-05 19:58:09,830 INFO L226 Difference]: Without dead ends: 7526 [2021-06-05 19:58:09,831 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 19:58:09,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7526 states. [2021-06-05 19:58:09,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7526 to 7526. [2021-06-05 19:58:09,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7526 states, 7525 states have (on average 3.4587375415282393) internal successors, (26027), 7525 states have internal predecessors, (26027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:09,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7526 states to 7526 states and 26027 transitions. [2021-06-05 19:58:09,971 INFO L78 Accepts]: Start accepts. Automaton has 7526 states and 26027 transitions. Word has length 71 [2021-06-05 19:58:09,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:58:09,972 INFO L482 AbstractCegarLoop]: Abstraction has 7526 states and 26027 transitions. [2021-06-05 19:58:09,972 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:09,972 INFO L276 IsEmpty]: Start isEmpty. Operand 7526 states and 26027 transitions. [2021-06-05 19:58:09,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 19:58:09,981 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:58:09,981 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 19:58:09,981 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-05 19:58:09,981 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:58:09,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:58:09,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1240776291, now seen corresponding path program 1 times [2021-06-05 19:58:09,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:58:09,982 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457066488] [2021-06-05 19:58:09,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:58:10,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:58:10,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 19:58:10,132 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:58:10,132 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457066488] [2021-06-05 19:58:10,132 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457066488] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:58:10,132 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:58:10,133 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 19:58:10,133 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58463355] [2021-06-05 19:58:10,133 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 19:58:10,133 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:58:10,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 19:58:10,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 19:58:10,134 INFO L87 Difference]: Start difference. First operand 7526 states and 26027 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:10,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:58:10,264 INFO L93 Difference]: Finished difference Result 12796 states and 43608 transitions. [2021-06-05 19:58:10,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 19:58:10,264 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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 71 [2021-06-05 19:58:10,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:58:10,286 INFO L225 Difference]: With dead ends: 12796 [2021-06-05 19:58:10,286 INFO L226 Difference]: Without dead ends: 8546 [2021-06-05 19:58:10,286 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 69.2ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 19:58:10,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8546 states. [2021-06-05 19:58:10,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8546 to 7166. [2021-06-05 19:58:10,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7166 states, 7165 states have (on average 3.383810188415911) internal successors, (24245), 7165 states have internal predecessors, (24245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:10,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7166 states to 7166 states and 24245 transitions. [2021-06-05 19:58:10,440 INFO L78 Accepts]: Start accepts. Automaton has 7166 states and 24245 transitions. Word has length 71 [2021-06-05 19:58:10,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:58:10,440 INFO L482 AbstractCegarLoop]: Abstraction has 7166 states and 24245 transitions. [2021-06-05 19:58:10,440 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:10,440 INFO L276 IsEmpty]: Start isEmpty. Operand 7166 states and 24245 transitions. [2021-06-05 19:58:10,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 19:58:10,449 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:58:10,449 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 19:58:10,449 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-05 19:58:10,449 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:58:10,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:58:10,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1697928774, now seen corresponding path program 1 times [2021-06-05 19:58:10,450 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:58:10,450 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301291791] [2021-06-05 19:58:10,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:58:10,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:58:10,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 19:58:10,685 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:58:10,686 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301291791] [2021-06-05 19:58:10,686 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301291791] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:58:10,686 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:58:10,686 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 19:58:10,686 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500217431] [2021-06-05 19:58:10,686 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 19:58:10,686 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:58:10,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 19:58:10,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-06-05 19:58:10,687 INFO L87 Difference]: Start difference. First operand 7166 states and 24245 transitions. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:10,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:58:10,990 INFO L93 Difference]: Finished difference Result 8366 states and 28205 transitions. [2021-06-05 19:58:10,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 19:58:10,990 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 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 71 [2021-06-05 19:58:10,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:58:11,004 INFO L225 Difference]: With dead ends: 8366 [2021-06-05 19:58:11,005 INFO L226 Difference]: Without dead ends: 7262 [2021-06-05 19:58:11,005 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 185.9ms TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2021-06-05 19:58:11,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7262 states. [2021-06-05 19:58:11,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7262 to 7262. [2021-06-05 19:58:11,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7262 states, 7261 states have (on average 3.3842445944084836) internal successors, (24573), 7261 states have internal predecessors, (24573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:11,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7262 states to 7262 states and 24573 transitions. [2021-06-05 19:58:11,128 INFO L78 Accepts]: Start accepts. Automaton has 7262 states and 24573 transitions. Word has length 71 [2021-06-05 19:58:11,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:58:11,128 INFO L482 AbstractCegarLoop]: Abstraction has 7262 states and 24573 transitions. [2021-06-05 19:58:11,128 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:11,128 INFO L276 IsEmpty]: Start isEmpty. Operand 7262 states and 24573 transitions. [2021-06-05 19:58:11,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 19:58:11,136 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:58:11,137 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 19:58:11,137 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-05 19:58:11,137 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:58:11,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:58:11,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1682137894, now seen corresponding path program 2 times [2021-06-05 19:58:11,137 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:58:11,137 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143845012] [2021-06-05 19:58:11,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:58:11,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:58:11,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 19:58:11,201 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:58:11,201 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143845012] [2021-06-05 19:58:11,201 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143845012] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:58:11,201 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:58:11,201 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 19:58:11,201 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753306009] [2021-06-05 19:58:11,201 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 19:58:11,201 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:58:11,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 19:58:11,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 19:58:11,202 INFO L87 Difference]: Start difference. First operand 7262 states and 24573 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:11,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:58:11,359 INFO L93 Difference]: Finished difference Result 12334 states and 41365 transitions. [2021-06-05 19:58:11,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 19:58:11,360 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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 71 [2021-06-05 19:58:11,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:58:11,376 INFO L225 Difference]: With dead ends: 12334 [2021-06-05 19:58:11,376 INFO L226 Difference]: Without dead ends: 8274 [2021-06-05 19:58:11,376 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 94.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 19:58:11,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8274 states. [2021-06-05 19:58:11,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8274 to 6894. [2021-06-05 19:58:11,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6894 states, 6893 states have (on average 3.3049470477295806) internal successors, (22781), 6893 states have internal predecessors, (22781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:11,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6894 states to 6894 states and 22781 transitions. [2021-06-05 19:58:11,506 INFO L78 Accepts]: Start accepts. Automaton has 6894 states and 22781 transitions. Word has length 71 [2021-06-05 19:58:11,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:58:11,506 INFO L482 AbstractCegarLoop]: Abstraction has 6894 states and 22781 transitions. [2021-06-05 19:58:11,506 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:11,506 INFO L276 IsEmpty]: Start isEmpty. Operand 6894 states and 22781 transitions. [2021-06-05 19:58:11,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 19:58:11,514 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:58:11,514 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 19:58:11,514 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-05 19:58:11,514 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:58:11,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:58:11,515 INFO L82 PathProgramCache]: Analyzing trace with hash -849400114, now seen corresponding path program 1 times [2021-06-05 19:58:11,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:58:11,515 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175538552] [2021-06-05 19:58:11,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:58:11,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:58:11,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 19:58:11,613 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:58:11,613 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175538552] [2021-06-05 19:58:11,613 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175538552] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:58:11,613 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:58:11,613 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 19:58:11,613 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557599801] [2021-06-05 19:58:11,614 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 19:58:11,614 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:58:11,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 19:58:11,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 19:58:11,616 INFO L87 Difference]: Start difference. First operand 6894 states and 22781 transitions. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:11,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:58:11,950 INFO L93 Difference]: Finished difference Result 7622 states and 25129 transitions. [2021-06-05 19:58:11,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 19:58:11,953 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 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 71 [2021-06-05 19:58:11,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:58:11,964 INFO L225 Difference]: With dead ends: 7622 [2021-06-05 19:58:11,965 INFO L226 Difference]: Without dead ends: 6614 [2021-06-05 19:58:11,965 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 172.8ms TimeCoverageRelationStatistics Valid=104, Invalid=202, Unknown=0, NotChecked=0, Total=306 [2021-06-05 19:58:11,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6614 states. [2021-06-05 19:58:12,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6614 to 6534. [2021-06-05 19:58:12,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6534 states, 6533 states have (on average 3.2868513699678554) internal successors, (21473), 6533 states have internal predecessors, (21473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:12,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6534 states to 6534 states and 21473 transitions. [2021-06-05 19:58:12,089 INFO L78 Accepts]: Start accepts. Automaton has 6534 states and 21473 transitions. Word has length 71 [2021-06-05 19:58:12,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:58:12,090 INFO L482 AbstractCegarLoop]: Abstraction has 6534 states and 21473 transitions. [2021-06-05 19:58:12,090 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:12,090 INFO L276 IsEmpty]: Start isEmpty. Operand 6534 states and 21473 transitions. [2021-06-05 19:58:12,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 19:58:12,098 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:58:12,098 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 19:58:12,099 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-05 19:58:12,099 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:58:12,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:58:12,099 INFO L82 PathProgramCache]: Analyzing trace with hash 117851699, now seen corresponding path program 1 times [2021-06-05 19:58:12,099 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:58:12,099 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735831879] [2021-06-05 19:58:12,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:58:12,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:58:12,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 19:58:12,242 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:58:12,242 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735831879] [2021-06-05 19:58:12,242 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735831879] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:58:12,242 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:58:12,242 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 19:58:12,242 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432550094] [2021-06-05 19:58:12,243 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 19:58:12,243 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:58:12,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 19:58:12,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-06-05 19:58:12,243 INFO L87 Difference]: Start difference. First operand 6534 states and 21473 transitions. Second operand has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:12,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:58:12,435 INFO L93 Difference]: Finished difference Result 7374 states and 24189 transitions. [2021-06-05 19:58:12,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 19:58:12,436 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 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 72 [2021-06-05 19:58:12,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:58:12,446 INFO L225 Difference]: With dead ends: 7374 [2021-06-05 19:58:12,446 INFO L226 Difference]: Without dead ends: 6510 [2021-06-05 19:58:12,447 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 126.4ms TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-06-05 19:58:12,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6510 states. [2021-06-05 19:58:12,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6510 to 6510. [2021-06-05 19:58:12,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6510 states, 6509 states have (on average 3.2842218466738364) internal successors, (21377), 6509 states have internal predecessors, (21377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:12,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6510 states to 6510 states and 21377 transitions. [2021-06-05 19:58:12,562 INFO L78 Accepts]: Start accepts. Automaton has 6510 states and 21377 transitions. Word has length 72 [2021-06-05 19:58:12,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:58:12,562 INFO L482 AbstractCegarLoop]: Abstraction has 6510 states and 21377 transitions. [2021-06-05 19:58:12,562 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:12,563 INFO L276 IsEmpty]: Start isEmpty. Operand 6510 states and 21377 transitions. [2021-06-05 19:58:12,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-06-05 19:58:12,570 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:58:12,571 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 19:58:12,571 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-05 19:58:12,571 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:58:12,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:58:12,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1901762316, now seen corresponding path program 1 times [2021-06-05 19:58:12,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:58:12,571 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826827760] [2021-06-05 19:58:12,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:58:12,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:58:12,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 19:58:12,706 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:58:12,706 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826827760] [2021-06-05 19:58:12,706 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826827760] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:58:12,706 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:58:12,706 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 19:58:12,706 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618216090] [2021-06-05 19:58:12,707 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 19:58:12,707 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:58:12,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 19:58:12,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-06-05 19:58:12,707 INFO L87 Difference]: Start difference. First operand 6510 states and 21377 transitions. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:12,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:58:12,970 INFO L93 Difference]: Finished difference Result 7385 states and 24208 transitions. [2021-06-05 19:58:12,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 19:58:12,970 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 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 73 [2021-06-05 19:58:12,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:58:12,981 INFO L225 Difference]: With dead ends: 7385 [2021-06-05 19:58:12,981 INFO L226 Difference]: Without dead ends: 6633 [2021-06-05 19:58:12,982 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 144.4ms TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2021-06-05 19:58:12,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6633 states. [2021-06-05 19:58:13,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6633 to 6570. [2021-06-05 19:58:13,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6570 states, 6569 states have (on average 3.282691429441315) internal successors, (21564), 6569 states have internal predecessors, (21564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:13,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6570 states to 6570 states and 21564 transitions. [2021-06-05 19:58:13,101 INFO L78 Accepts]: Start accepts. Automaton has 6570 states and 21564 transitions. Word has length 73 [2021-06-05 19:58:13,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:58:13,101 INFO L482 AbstractCegarLoop]: Abstraction has 6570 states and 21564 transitions. [2021-06-05 19:58:13,101 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:13,101 INFO L276 IsEmpty]: Start isEmpty. Operand 6570 states and 21564 transitions. [2021-06-05 19:58:13,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-06-05 19:58:13,109 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:58:13,109 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 19:58:13,109 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-05 19:58:13,109 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:58:13,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:58:13,110 INFO L82 PathProgramCache]: Analyzing trace with hash -115039928, now seen corresponding path program 2 times [2021-06-05 19:58:13,110 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:58:13,110 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435797327] [2021-06-05 19:58:13,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:58:13,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:58:13,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 19:58:13,210 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:58:13,210 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435797327] [2021-06-05 19:58:13,210 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435797327] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:58:13,211 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:58:13,211 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 19:58:13,211 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900267440] [2021-06-05 19:58:13,211 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 19:58:13,211 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:58:13,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 19:58:13,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-06-05 19:58:13,212 INFO L87 Difference]: Start difference. First operand 6570 states and 21564 transitions. Second operand has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 9 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:13,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:58:13,400 INFO L93 Difference]: Finished difference Result 7954 states and 26140 transitions. [2021-06-05 19:58:13,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 19:58:13,400 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 9 states have internal predecessors, (73), 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 73 [2021-06-05 19:58:13,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:58:13,413 INFO L225 Difference]: With dead ends: 7954 [2021-06-05 19:58:13,414 INFO L226 Difference]: Without dead ends: 7106 [2021-06-05 19:58:13,414 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 113.1ms TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2021-06-05 19:58:13,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7106 states. [2021-06-05 19:58:13,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7106 to 6830. [2021-06-05 19:58:13,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6830 states, 6829 states have (on average 3.290232830575487) internal successors, (22469), 6829 states have internal predecessors, (22469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:13,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6830 states to 6830 states and 22469 transitions. [2021-06-05 19:58:13,541 INFO L78 Accepts]: Start accepts. Automaton has 6830 states and 22469 transitions. Word has length 73 [2021-06-05 19:58:13,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:58:13,541 INFO L482 AbstractCegarLoop]: Abstraction has 6830 states and 22469 transitions. [2021-06-05 19:58:13,542 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 9 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:13,542 INFO L276 IsEmpty]: Start isEmpty. Operand 6830 states and 22469 transitions. [2021-06-05 19:58:13,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-05 19:58:13,550 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:58:13,550 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 19:58:13,550 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-05 19:58:13,550 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:58:13,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:58:13,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1347443626, now seen corresponding path program 1 times [2021-06-05 19:58:13,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:58:13,551 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959760138] [2021-06-05 19:58:13,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:58:13,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:58:13,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 19:58:13,612 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:58:13,612 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959760138] [2021-06-05 19:58:13,613 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959760138] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:58:13,613 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:58:13,613 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 19:58:13,613 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481647067] [2021-06-05 19:58:13,613 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 19:58:13,613 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:58:13,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 19:58:13,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 19:58:13,614 INFO L87 Difference]: Start difference. First operand 6830 states and 22469 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:13,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:58:13,710 INFO L93 Difference]: Finished difference Result 8152 states and 26275 transitions. [2021-06-05 19:58:13,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 19:58:13,710 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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 74 [2021-06-05 19:58:13,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:58:13,719 INFO L225 Difference]: With dead ends: 8152 [2021-06-05 19:58:13,720 INFO L226 Difference]: Without dead ends: 5912 [2021-06-05 19:58:13,720 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 62.2ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 19:58:13,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5912 states. [2021-06-05 19:58:13,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5912 to 5912. [2021-06-05 19:58:13,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5912 states, 5911 states have (on average 3.212485197090171) internal successors, (18989), 5911 states have internal predecessors, (18989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:13,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5912 states to 5912 states and 18989 transitions. [2021-06-05 19:58:13,821 INFO L78 Accepts]: Start accepts. Automaton has 5912 states and 18989 transitions. Word has length 74 [2021-06-05 19:58:13,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:58:13,822 INFO L482 AbstractCegarLoop]: Abstraction has 5912 states and 18989 transitions. [2021-06-05 19:58:13,822 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:13,822 INFO L276 IsEmpty]: Start isEmpty. Operand 5912 states and 18989 transitions. [2021-06-05 19:58:13,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-06-05 19:58:13,829 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:58:13,829 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 19:58:13,829 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-05 19:58:13,829 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:58:13,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:58:13,830 INFO L82 PathProgramCache]: Analyzing trace with hash 16000637, now seen corresponding path program 1 times [2021-06-05 19:58:13,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:58:13,830 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420043890] [2021-06-05 19:58:13,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:58:13,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:58:13,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 19:58:13,889 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:58:13,890 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420043890] [2021-06-05 19:58:13,890 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420043890] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:58:13,890 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:58:13,890 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 19:58:13,890 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349887614] [2021-06-05 19:58:13,890 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 19:58:13,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:58:13,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 19:58:13,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 19:58:13,891 INFO L87 Difference]: Start difference. First operand 5912 states and 18989 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:13,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:58:13,993 INFO L93 Difference]: Finished difference Result 5600 states and 17446 transitions. [2021-06-05 19:58:13,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 19:58:13,993 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 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 75 [2021-06-05 19:58:13,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:58:13,999 INFO L225 Difference]: With dead ends: 5600 [2021-06-05 19:58:13,999 INFO L226 Difference]: Without dead ends: 3842 [2021-06-05 19:58:14,000 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 67.0ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-06-05 19:58:14,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3842 states. [2021-06-05 19:58:14,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3842 to 3746. [2021-06-05 19:58:14,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3746 states, 3745 states have (on average 3.0539385847797065) internal successors, (11437), 3745 states have internal predecessors, (11437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:14,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3746 states to 3746 states and 11437 transitions. [2021-06-05 19:58:14,054 INFO L78 Accepts]: Start accepts. Automaton has 3746 states and 11437 transitions. Word has length 75 [2021-06-05 19:58:14,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:58:14,054 INFO L482 AbstractCegarLoop]: Abstraction has 3746 states and 11437 transitions. [2021-06-05 19:58:14,054 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:14,054 INFO L276 IsEmpty]: Start isEmpty. Operand 3746 states and 11437 transitions. [2021-06-05 19:58:14,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-06-05 19:58:14,058 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:58:14,058 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 19:58:14,058 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-05 19:58:14,058 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:58:14,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:58:14,059 INFO L82 PathProgramCache]: Analyzing trace with hash -2069921826, now seen corresponding path program 1 times [2021-06-05 19:58:14,059 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:58:14,059 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359405983] [2021-06-05 19:58:14,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:58:14,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:58:14,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 19:58:14,136 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:58:14,137 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359405983] [2021-06-05 19:58:14,137 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359405983] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:58:14,137 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:58:14,137 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 19:58:14,137 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837555903] [2021-06-05 19:58:14,137 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 19:58:14,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:58:14,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 19:58:14,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 19:58:14,138 INFO L87 Difference]: Start difference. First operand 3746 states and 11437 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:14,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:58:14,237 INFO L93 Difference]: Finished difference Result 3080 states and 9190 transitions. [2021-06-05 19:58:14,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 19:58:14,237 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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 78 [2021-06-05 19:58:14,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:58:14,239 INFO L225 Difference]: With dead ends: 3080 [2021-06-05 19:58:14,240 INFO L226 Difference]: Without dead ends: 1514 [2021-06-05 19:58:14,240 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 80.7ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-06-05 19:58:14,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2021-06-05 19:58:14,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1466. [2021-06-05 19:58:14,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1466 states, 1465 states have (on average 2.8784982935153582) internal successors, (4217), 1465 states have internal predecessors, (4217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:14,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1466 states and 4217 transitions. [2021-06-05 19:58:14,257 INFO L78 Accepts]: Start accepts. Automaton has 1466 states and 4217 transitions. Word has length 78 [2021-06-05 19:58:14,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:58:14,258 INFO L482 AbstractCegarLoop]: Abstraction has 1466 states and 4217 transitions. [2021-06-05 19:58:14,258 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:14,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1466 states and 4217 transitions. [2021-06-05 19:58:14,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-06-05 19:58:14,259 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:58:14,259 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 19:58:14,259 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-05 19:58:14,260 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:58:14,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:58:14,260 INFO L82 PathProgramCache]: Analyzing trace with hash -357430152, now seen corresponding path program 1 times [2021-06-05 19:58:14,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:58:14,260 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427539951] [2021-06-05 19:58:14,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:58:14,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:58:14,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 19:58:14,396 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:58:14,396 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427539951] [2021-06-05 19:58:14,396 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427539951] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:58:14,396 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:58:14,396 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 19:58:14,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478804138] [2021-06-05 19:58:14,397 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 19:58:14,397 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:58:14,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 19:58:14,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-06-05 19:58:14,397 INFO L87 Difference]: Start difference. First operand 1466 states and 4217 transitions. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 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-06-05 19:58:14,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:58:14,511 INFO L93 Difference]: Finished difference Result 2096 states and 6125 transitions. [2021-06-05 19:58:14,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 19:58:14,512 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 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) Word has length 81 [2021-06-05 19:58:14,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:58:14,514 INFO L225 Difference]: With dead ends: 2096 [2021-06-05 19:58:14,514 INFO L226 Difference]: Without dead ends: 1330 [2021-06-05 19:58:14,514 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 108.9ms TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2021-06-05 19:58:14,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2021-06-05 19:58:14,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1210. [2021-06-05 19:58:14,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1210 states, 1209 states have (on average 2.7733664185277087) internal successors, (3353), 1209 states have internal predecessors, (3353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:14,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 3353 transitions. [2021-06-05 19:58:14,528 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 3353 transitions. Word has length 81 [2021-06-05 19:58:14,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:58:14,528 INFO L482 AbstractCegarLoop]: Abstraction has 1210 states and 3353 transitions. [2021-06-05 19:58:14,528 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 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-06-05 19:58:14,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 3353 transitions. [2021-06-05 19:58:14,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-06-05 19:58:14,529 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:58:14,530 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 19:58:14,530 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-05 19:58:14,530 INFO L430 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:58:14,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:58:14,530 INFO L82 PathProgramCache]: Analyzing trace with hash 791898738, now seen corresponding path program 2 times [2021-06-05 19:58:14,530 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:58:14,530 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315320579] [2021-06-05 19:58:14,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:58:14,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:58:14,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 19:58:14,691 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:58:14,691 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315320579] [2021-06-05 19:58:14,692 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315320579] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:58:14,692 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:58:14,692 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-06-05 19:58:14,692 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337506534] [2021-06-05 19:58:14,692 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 19:58:14,692 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:58:14,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 19:58:14,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2021-06-05 19:58:14,692 INFO L87 Difference]: Start difference. First operand 1210 states and 3353 transitions. Second operand has 14 states, 14 states have (on average 5.785714285714286) internal successors, (81), 14 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-06-05 19:58:14,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:58:14,905 INFO L93 Difference]: Finished difference Result 1780 states and 5068 transitions. [2021-06-05 19:58:14,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 19:58:14,906 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.785714285714286) internal successors, (81), 14 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) Word has length 81 [2021-06-05 19:58:14,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:58:14,907 INFO L225 Difference]: With dead ends: 1780 [2021-06-05 19:58:14,907 INFO L226 Difference]: Without dead ends: 962 [2021-06-05 19:58:14,907 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 226.0ms TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2021-06-05 19:58:14,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2021-06-05 19:58:14,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 962. [2021-06-05 19:58:14,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 961 states have (on average 2.77315296566077) internal successors, (2665), 961 states have internal predecessors, (2665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:14,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 2665 transitions. [2021-06-05 19:58:14,917 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 2665 transitions. Word has length 81 [2021-06-05 19:58:14,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:58:14,917 INFO L482 AbstractCegarLoop]: Abstraction has 962 states and 2665 transitions. [2021-06-05 19:58:14,917 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 5.785714285714286) internal successors, (81), 14 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-06-05 19:58:14,917 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 2665 transitions. [2021-06-05 19:58:14,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-06-05 19:58:14,918 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:58:14,918 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 19:58:14,918 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-05 19:58:14,918 INFO L430 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:58:14,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:58:14,918 INFO L82 PathProgramCache]: Analyzing trace with hash -328124842, now seen corresponding path program 3 times [2021-06-05 19:58:14,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:58:14,919 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433951833] [2021-06-05 19:58:14,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:58:14,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 19:58:14,946 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 19:58:14,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 19:58:14,970 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 19:58:14,997 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 19:58:14,997 INFO L655 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 19:58:14,997 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-05 19:58:14,997 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/3) [2021-06-05 19:58:14,999 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 19:58:14,999 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 19:58:14,999 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 19:58:14,999 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 19:58:14,999 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 19:58:14,999 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 19:58:14,999 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 19:58:14,999 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 19:58:14,999 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P0Thread1of1ForFork2======== [2021-06-05 19:58:15,000 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 113 places, 105 transitions, 225 flow [2021-06-05 19:58:15,421 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 16157 states, 16153 states have (on average 3.635114220268681) internal successors, (58718), 16156 states have internal predecessors, (58718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:15,439 INFO L276 IsEmpty]: Start isEmpty. Operand has 16157 states, 16153 states have (on average 3.635114220268681) internal successors, (58718), 16156 states have internal predecessors, (58718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:15,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-06-05 19:58:15,439 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:58:15,439 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 19:58:15,439 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:58:15,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:58:15,440 INFO L82 PathProgramCache]: Analyzing trace with hash 38440550, now seen corresponding path program 1 times [2021-06-05 19:58:15,440 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:58:15,440 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331834715] [2021-06-05 19:58:15,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:58:15,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:58:15,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 19:58:15,452 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:58:15,452 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331834715] [2021-06-05 19:58:15,453 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331834715] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:58:15,453 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:58:15,453 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 19:58:15,453 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941720343] [2021-06-05 19:58:15,453 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 19:58:15,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:58:15,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 19:58:15,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 19:58:15,472 INFO L87 Difference]: Start difference. First operand has 16157 states, 16153 states have (on average 3.635114220268681) internal successors, (58718), 16156 states have internal predecessors, (58718), 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 20.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:15,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:58:15,543 INFO L93 Difference]: Finished difference Result 13854 states and 49119 transitions. [2021-06-05 19:58:15,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 19:58:15,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 20.0) internal successors, (40), 3 states have internal predecessors, (40), 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 40 [2021-06-05 19:58:15,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:58:15,544 INFO L225 Difference]: With dead ends: 13854 [2021-06-05 19:58:15,545 INFO L226 Difference]: Without dead ends: 0 [2021-06-05 19:58:15,545 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 19:58:15,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-05 19:58:15,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-05 19:58:15,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:15,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-05 19:58:15,545 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2021-06-05 19:58:15,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:58:15,545 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-05 19:58:15,545 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 20.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:58:15,545 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-05 19:58:15,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-05 19:58:15,546 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-05 19:58:15,546 INFO L301 ceAbstractionStarter]: Result for error location P0Thread1of1ForFork2 was SAFE (3/3) [2021-06-05 19:58:15,546 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-05 19:58:15,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 07:58:15 BasicIcfg [2021-06-05 19:58:15,632 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 19:58:15,633 INFO L168 Benchmark]: Toolchain (without parser) took 11578.42 ms. Allocated memory was 329.3 MB in the beginning and 2.6 GB in the end (delta: 2.3 GB). Free memory was 291.8 MB in the beginning and 2.1 GB in the end (delta: -1.8 GB). Peak memory consumption was 504.3 MB. Max. memory is 16.0 GB. [2021-06-05 19:58:15,633 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 329.3 MB. Free memory is still 309.6 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 19:58:15,633 INFO L168 Benchmark]: CACSL2BoogieTranslator took 340.54 ms. Allocated memory is still 329.3 MB. Free memory was 291.6 MB in the beginning and 287.6 MB in the end (delta: 4.0 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.0 GB. [2021-06-05 19:58:15,633 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.47 ms. Allocated memory is still 329.3 MB. Free memory was 287.6 MB in the beginning and 284.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 19:58:15,634 INFO L168 Benchmark]: Boogie Preprocessor took 32.23 ms. Allocated memory is still 329.3 MB. Free memory was 284.4 MB in the beginning and 282.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 19:58:15,634 INFO L168 Benchmark]: RCFGBuilder took 1278.02 ms. Allocated memory is still 329.3 MB. Free memory was 282.3 MB in the beginning and 222.1 MB in the end (delta: 60.3 MB). Peak memory consumption was 148.3 MB. Max. memory is 16.0 GB. [2021-06-05 19:58:15,634 INFO L168 Benchmark]: TraceAbstraction took 9868.01 ms. Allocated memory was 329.3 MB in the beginning and 2.6 GB in the end (delta: 2.3 GB). Free memory was 221.0 MB in the beginning and 2.1 GB in the end (delta: -1.8 GB). Peak memory consumption was 430.4 MB. Max. memory is 16.0 GB. [2021-06-05 19:58:15,634 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 329.3 MB. Free memory is still 309.6 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 340.54 ms. Allocated memory is still 329.3 MB. Free memory was 291.6 MB in the beginning and 287.6 MB in the end (delta: 4.0 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 55.47 ms. Allocated memory is still 329.3 MB. Free memory was 287.6 MB in the beginning and 284.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 32.23 ms. Allocated memory is still 329.3 MB. Free memory was 284.4 MB in the beginning and 282.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1278.02 ms. Allocated memory is still 329.3 MB. Free memory was 282.3 MB in the beginning and 222.1 MB in the end (delta: 60.3 MB). Peak memory consumption was 148.3 MB. Max. memory is 16.0 GB. * TraceAbstraction took 9868.01 ms. Allocated memory was 329.3 MB in the beginning and 2.6 GB in the end (delta: 2.3 GB). Free memory was 221.0 MB in the beginning and 2.1 GB in the end (delta: -1.8 GB). Peak memory consumption was 430.4 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - 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; VAL [__unbuffered_cnt=0] [L710] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L711] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L713] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L715] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L717] 0 int z = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L718] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L719] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L720] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L721] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L722] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L723] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L724] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L725] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L726] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L727] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L728] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L729] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L730] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L731] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L732] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L733] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L735] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L816] 0 pthread_t t2489; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] FCALL, FORK 0 pthread_create(&t2489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L739] 1 z$w_buff1 = z$w_buff0 [L740] 1 z$w_buff0 = 2 [L741] 1 z$w_buff1_used = z$w_buff0_used [L742] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L744] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L745] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L746] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L747] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L748] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 pthread_t t2490; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] FCALL, FORK 0 pthread_create(&t2490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L774] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L774] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L774] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L775] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L775] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L776] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L777] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L777] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L778] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L820] 0 pthread_t t2491; VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] FCALL, FORK 0 pthread_create(&t2491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] 3 y = 2 VAL [__unbuffered_cnt=0, 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=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z = 1 VAL [__unbuffered_cnt=0, 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=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L794] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L794] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L794] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L794] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L795] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L795] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L796] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L797] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L798] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=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=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L754] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L755] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L755] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L756] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L757] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L758] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, 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=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, 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=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L823] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L827] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L827] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L827] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L828] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L828] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L829] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L830] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L831] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L834] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L835] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L836] 0 z$flush_delayed = weak$$choice2 [L837] 0 z$mem_tmp = z [L838] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L838] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L839] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L839] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L839] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L839] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L840] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L840] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L840] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L840] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L841] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L841] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L841] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L841] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L842] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L842] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L843] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L843] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L843] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L844] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L844] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L846] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L846] 0 z = z$flush_delayed ? z$mem_tmp : z [L847] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P0 with 1 thread instances CFG has 7 procedures, 132 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 855.5ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 98.6ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 754.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=16157occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 132 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 8280.3ms, OverallIterations: 17, TraceHistogramMax: 1, EmptinessCheckTime: 152.9ms, AutomataDifference: 3359.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 530.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2155 SDtfs, 3021 SDslu, 8035 SDs, 0 SdLazy, 1214 SolverSat, 218 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 930.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 222 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 1794.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=16157occurred in iteration=0, InterpolantAutomatonStates: 168, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1904.0ms AutomataMinimizationTime, 16 MinimizatonAttempts, 3887 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 40.1ms SsaConstructionTime, 512.7ms SatisfiabilityAnalysisTime, 1514.6ms InterpolantComputationTime, 1246 NumberOfCodeBlocks, 1246 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1149 ConstructedInterpolants, 0 QuantifiedInterpolants, 5891 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P0Thread1of1ForFork2 with 1 thread instances CFG has 7 procedures, 132 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 546.6ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 17.8ms, AutomataDifference: 91.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 422.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 93 SDtfs, 49 SDslu, 79 SDs, 0 SdLazy, 11 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=16157occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 0.3ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8ms SsaConstructionTime, 1.9ms SatisfiabilityAnalysisTime, 7.5ms InterpolantComputationTime, 40 NumberOfCodeBlocks, 40 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 39 ConstructedInterpolants, 0 QuantifiedInterpolants, 65 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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...