/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/mix057_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2abb09bbbae98a04ae2fcc735832bfdba44f6fbc-2abb09b [2021-06-05 19:44:18,001 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 19:44:18,003 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 19:44:18,028 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 19:44:18,028 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 19:44:18,029 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 19:44:18,030 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 19:44:18,032 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 19:44:18,033 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 19:44:18,034 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 19:44:18,035 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 19:44:18,036 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 19:44:18,036 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 19:44:18,037 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 19:44:18,037 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 19:44:18,038 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 19:44:18,039 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 19:44:18,040 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 19:44:18,041 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 19:44:18,042 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 19:44:18,043 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 19:44:18,044 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 19:44:18,045 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 19:44:18,046 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 19:44:18,048 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 19:44:18,048 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 19:44:18,049 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 19:44:18,049 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 19:44:18,050 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 19:44:18,050 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 19:44:18,051 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 19:44:18,051 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 19:44:18,052 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 19:44:18,052 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 19:44:18,053 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 19:44:18,053 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 19:44:18,054 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 19:44:18,054 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 19:44:18,054 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 19:44:18,055 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 19:44:18,056 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 19:44:18,057 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:44:18,077 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 19:44:18,077 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 19:44:18,078 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 19:44:18,078 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 19:44:18,079 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 19:44:18,079 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 19:44:18,079 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 19:44:18,079 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 19:44:18,079 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 19:44:18,079 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 19:44:18,079 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 19:44:18,080 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 19:44:18,080 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 19:44:18,080 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 19:44:18,080 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 19:44:18,080 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 19:44:18,080 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 19:44:18,080 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 19:44:18,080 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 19:44:18,081 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 19:44:18,081 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 19:44:18,081 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 19:44:18,081 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 19:44:18,081 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 19:44:18,081 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 19:44:18,081 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 19:44:18,081 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 19:44:18,082 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 19:44:18,082 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 19:44:18,082 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 19:44:18,082 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 19:44:18,082 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:44:18,413 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 19:44:18,433 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 19:44:18,435 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 19:44:18,436 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-05 19:44:18,438 INFO L275 PluginConnector]: CDTParser initialized [2021-06-05 19:44:18,439 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix057_power.opt.i [2021-06-05 19:44:18,502 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dddc0b69/59168ea2a4844bad996acb337750ffb2/FLAGdfe8331e9 [2021-06-05 19:44:18,998 INFO L306 CDTParser]: Found 1 translation units. [2021-06-05 19:44:18,999 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_power.opt.i [2021-06-05 19:44:19,025 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dddc0b69/59168ea2a4844bad996acb337750ffb2/FLAGdfe8331e9 [2021-06-05 19:44:19,283 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dddc0b69/59168ea2a4844bad996acb337750ffb2 [2021-06-05 19:44:19,285 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 19:44:19,287 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-05 19:44:19,288 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-05 19:44:19,288 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-05 19:44:19,294 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-05 19:44:19,295 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 07:44:19" (1/1) ... [2021-06-05 19:44:19,296 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b6c9e8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:44:19, skipping insertion in model container [2021-06-05 19:44:19,296 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 07:44:19" (1/1) ... [2021-06-05 19:44:19,302 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-05 19:44:19,357 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-05 19:44:19,561 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/mix057_power.opt.i[950,963] [2021-06-05 19:44:19,801 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 19:44:19,808 INFO L203 MainTranslator]: Completed pre-run [2021-06-05 19:44:19,822 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/mix057_power.opt.i[950,963] [2021-06-05 19:44:19,877 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 19:44:19,931 INFO L208 MainTranslator]: Completed translation [2021-06-05 19:44:19,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:44:19 WrapperNode [2021-06-05 19:44:19,932 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-05 19:44:19,933 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 19:44:19,933 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 19:44:19,933 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 19:44:19,939 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:44:19" (1/1) ... [2021-06-05 19:44:19,954 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:44:19" (1/1) ... [2021-06-05 19:44:19,980 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 19:44:19,981 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 19:44:19,981 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 19:44:19,981 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 19:44:19,989 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:44:19" (1/1) ... [2021-06-05 19:44:19,989 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:44:19" (1/1) ... [2021-06-05 19:44:19,993 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:44:19" (1/1) ... [2021-06-05 19:44:19,993 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:44:19" (1/1) ... [2021-06-05 19:44:20,001 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:44:19" (1/1) ... [2021-06-05 19:44:20,004 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:44:19" (1/1) ... [2021-06-05 19:44:20,023 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:44:19" (1/1) ... [2021-06-05 19:44:20,026 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 19:44:20,027 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 19:44:20,027 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 19:44:20,027 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 19:44:20,028 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:44:19" (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:44:20,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-05 19:44:20,095 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-05 19:44:20,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-05 19:44:20,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-05 19:44:20,096 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-05 19:44:20,097 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-05 19:44:20,098 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-05 19:44:20,098 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-05 19:44:20,098 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-05 19:44:20,098 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-05 19:44:20,098 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-06-05 19:44:20,098 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-06-05 19:44:20,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-05 19:44:20,098 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-05 19:44:20,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 19:44:20,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 19:44:20,100 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:44:21,902 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 19:44:21,902 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-05 19:44:21,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 07:44:21 BoogieIcfgContainer [2021-06-05 19:44:21,905 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 19:44:21,907 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 19:44:21,907 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 19:44:21,910 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 19:44:21,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.06 07:44:19" (1/3) ... [2021-06-05 19:44:21,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@622be8df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 07:44:21, skipping insertion in model container [2021-06-05 19:44:21,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:44:19" (2/3) ... [2021-06-05 19:44:21,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@622be8df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 07:44:21, skipping insertion in model container [2021-06-05 19:44:21,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 07:44:21" (3/3) ... [2021-06-05 19:44:21,913 INFO L111 eAbstractionObserver]: Analyzing ICFG mix057_power.opt.i [2021-06-05 19:44:21,918 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 19:44:21,918 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 19:44:21,919 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-05 19:44:21,919 INFO L471 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 19:44:21,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,949 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,950 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,950 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,950 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,951 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,951 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,951 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,952 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,952 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,952 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,952 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,952 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,952 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,952 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,953 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,953 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,953 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,953 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,953 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,953 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,953 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,954 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,954 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,954 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,954 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,954 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,954 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,954 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,955 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,955 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,955 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,955 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,955 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,955 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,956 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,956 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,956 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,956 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,956 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,956 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,957 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,957 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,957 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,957 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,957 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,957 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,958 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,958 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,958 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,958 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,958 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,958 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,958 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,959 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,959 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,959 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,959 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,959 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,959 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,960 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,960 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,960 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,960 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,960 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,960 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,961 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,961 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,961 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,961 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,961 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,961 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,961 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,962 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,962 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,962 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,962 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,964 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,964 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,964 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,965 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,965 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,965 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,965 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,965 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,965 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,965 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,966 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,966 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,967 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,968 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,968 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,968 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,969 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,969 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,969 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,970 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,971 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,972 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,972 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,972 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:44:21,973 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 19:44:21,991 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 19:44:22,006 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 19:44:22,006 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 19:44:22,006 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 19:44:22,006 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 19:44:22,006 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 19:44:22,007 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 19:44:22,007 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 19:44:22,007 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P3======== [2021-06-05 19:44:22,016 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 135 places, 124 transitions, 268 flow [2021-06-05 19:44:40,212 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 105490 states, 105486 states have (on average 4.4803291432038375) internal successors, (472612), 105489 states have internal predecessors, (472612), 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:44:40,345 INFO L276 IsEmpty]: Start isEmpty. Operand has 105490 states, 105486 states have (on average 4.4803291432038375) internal successors, (472612), 105489 states have internal predecessors, (472612), 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:44:41,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-05 19:44:41,093 INFO L301 ceAbstractionStarter]: Result for error location P3 was SAFE (1/3) [2021-06-05 19:44:41,094 INFO L255 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-06-05 19:44:41,097 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 19:44:41,097 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 19:44:41,097 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 19:44:41,097 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 19:44:41,097 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 19:44:41,097 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 19:44:41,097 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 19:44:41,097 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-06-05 19:44:41,113 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 135 places, 124 transitions, 268 flow [2021-06-05 19:44:58,040 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 105490 states, 105486 states have (on average 4.4803291432038375) internal successors, (472612), 105489 states have internal predecessors, (472612), 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:44:58,255 INFO L276 IsEmpty]: Start isEmpty. Operand has 105490 states, 105486 states have (on average 4.4803291432038375) internal successors, (472612), 105489 states have internal predecessors, (472612), 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:44:58,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-06-05 19:44:58,320 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:44:58,321 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] [2021-06-05 19:44:58,321 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:44:58,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:44:58,327 INFO L82 PathProgramCache]: Analyzing trace with hash -715615938, now seen corresponding path program 1 times [2021-06-05 19:44:58,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:44:58,337 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439605427] [2021-06-05 19:44:58,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:44:58,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:44:58,775 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:44:58,776 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:44:58,776 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439605427] [2021-06-05 19:44:58,777 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439605427] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:44:58,777 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:44:58,778 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 19:44:58,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648211356] [2021-06-05 19:44:58,782 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 19:44:58,782 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:44:58,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 19:44:58,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 19:44:58,918 INFO L87 Difference]: Start difference. First operand has 105490 states, 105486 states have (on average 4.4803291432038375) internal successors, (472612), 105489 states have internal predecessors, (472612), 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 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 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:45:00,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:45:00,777 INFO L93 Difference]: Finished difference Result 151606 states and 667099 transitions. [2021-06-05 19:45:00,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 19:45:00,778 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 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 77 [2021-06-05 19:45:00,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:45:01,546 INFO L225 Difference]: With dead ends: 151606 [2021-06-05 19:45:01,546 INFO L226 Difference]: Without dead ends: 53830 [2021-06-05 19:45:01,547 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 94.7ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 19:45:02,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53830 states. [2021-06-05 19:45:03,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53830 to 53830. [2021-06-05 19:45:03,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53830 states, 53828 states have (on average 4.339860295756855) internal successors, (233606), 53829 states have internal predecessors, (233606), 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:45:04,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53830 states to 53830 states and 233606 transitions. [2021-06-05 19:45:04,013 INFO L78 Accepts]: Start accepts. Automaton has 53830 states and 233606 transitions. Word has length 77 [2021-06-05 19:45:04,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:45:04,015 INFO L482 AbstractCegarLoop]: Abstraction has 53830 states and 233606 transitions. [2021-06-05 19:45:04,015 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 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:45:04,015 INFO L276 IsEmpty]: Start isEmpty. Operand 53830 states and 233606 transitions. [2021-06-05 19:45:04,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-06-05 19:45:04,088 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:45:04,089 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] [2021-06-05 19:45:04,089 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 19:45:04,089 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:45:04,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:45:04,090 INFO L82 PathProgramCache]: Analyzing trace with hash 114274397, now seen corresponding path program 1 times [2021-06-05 19:45:04,090 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:45:04,090 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953738678] [2021-06-05 19:45:04,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:45:04,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:45:04,311 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:45:04,312 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:45:04,312 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953738678] [2021-06-05 19:45:04,312 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953738678] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:45:04,312 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:45:04,312 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 19:45:04,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389284755] [2021-06-05 19:45:04,317 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 19:45:04,317 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:45:04,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 19:45:04,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 19:45:04,319 INFO L87 Difference]: Start difference. First operand 53830 states and 233606 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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:45:05,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:45:05,546 INFO L93 Difference]: Finished difference Result 62470 states and 269060 transitions. [2021-06-05 19:45:05,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 19:45:05,547 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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 79 [2021-06-05 19:45:05,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:45:05,856 INFO L225 Difference]: With dead ends: 62470 [2021-06-05 19:45:05,856 INFO L226 Difference]: Without dead ends: 51886 [2021-06-05 19:45:05,857 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 86.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 19:45:06,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51886 states. [2021-06-05 19:45:07,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51886 to 51886. [2021-06-05 19:45:07,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51886 states, 51884 states have (on average 4.325533883278082) internal successors, (224426), 51885 states have internal predecessors, (224426), 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:45:08,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51886 states to 51886 states and 224426 transitions. [2021-06-05 19:45:08,169 INFO L78 Accepts]: Start accepts. Automaton has 51886 states and 224426 transitions. Word has length 79 [2021-06-05 19:45:08,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:45:08,170 INFO L482 AbstractCegarLoop]: Abstraction has 51886 states and 224426 transitions. [2021-06-05 19:45:08,170 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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:45:08,185 INFO L276 IsEmpty]: Start isEmpty. Operand 51886 states and 224426 transitions. [2021-06-05 19:45:08,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-05 19:45:08,275 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:45:08,275 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] [2021-06-05 19:45:08,276 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 19:45:08,276 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:45:08,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:45:08,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1940160349, now seen corresponding path program 1 times [2021-06-05 19:45:08,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:45:08,277 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42296985] [2021-06-05 19:45:08,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:45:08,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:45:08,430 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:45:08,430 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:45:08,430 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42296985] [2021-06-05 19:45:08,430 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42296985] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:45:08,431 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:45:08,431 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 19:45:08,431 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715835367] [2021-06-05 19:45:08,431 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 19:45:08,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:45:08,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 19:45:08,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 19:45:08,433 INFO L87 Difference]: Start difference. First operand 51886 states and 224426 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 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:45:09,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:45:09,467 INFO L93 Difference]: Finished difference Result 86830 states and 369962 transitions. [2021-06-05 19:45:09,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 19:45:09,478 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 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 80 [2021-06-05 19:45:09,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:45:09,807 INFO L225 Difference]: With dead ends: 86830 [2021-06-05 19:45:09,808 INFO L226 Difference]: Without dead ends: 57934 [2021-06-05 19:45:09,808 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 92.8ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 19:45:10,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57934 states. [2021-06-05 19:45:11,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57934 to 48862. [2021-06-05 19:45:11,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48862 states, 48860 states have (on average 4.239336880884159) internal successors, (207134), 48861 states have internal predecessors, (207134), 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:45:11,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48862 states to 48862 states and 207134 transitions. [2021-06-05 19:45:11,436 INFO L78 Accepts]: Start accepts. Automaton has 48862 states and 207134 transitions. Word has length 80 [2021-06-05 19:45:11,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:45:11,436 INFO L482 AbstractCegarLoop]: Abstraction has 48862 states and 207134 transitions. [2021-06-05 19:45:11,436 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 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:45:11,437 INFO L276 IsEmpty]: Start isEmpty. Operand 48862 states and 207134 transitions. [2021-06-05 19:45:11,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-06-05 19:45:11,862 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:45:11,862 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:45:11,862 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 19:45:11,865 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:45:11,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:45:11,866 INFO L82 PathProgramCache]: Analyzing trace with hash -849332228, now seen corresponding path program 1 times [2021-06-05 19:45:11,866 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:45:11,867 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330698050] [2021-06-05 19:45:11,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:45:11,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:45:12,231 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:45:12,232 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:45:12,232 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330698050] [2021-06-05 19:45:12,232 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330698050] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:45:12,232 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:45:12,232 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 19:45:12,233 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805923404] [2021-06-05 19:45:12,233 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 19:45:12,233 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:45:12,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 19:45:12,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-06-05 19:45:12,234 INFO L87 Difference]: Start difference. First operand 48862 states and 207134 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:45:12,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:45:12,814 INFO L93 Difference]: Finished difference Result 55365 states and 233002 transitions. [2021-06-05 19:45:12,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 19:45:12,814 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:45:12,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:45:12,945 INFO L225 Difference]: With dead ends: 55365 [2021-06-05 19:45:12,945 INFO L226 Difference]: Without dead ends: 46249 [2021-06-05 19:45:12,945 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 244.1ms TimeCoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2021-06-05 19:45:13,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46249 states. [2021-06-05 19:45:14,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46249 to 46249. [2021-06-05 19:45:14,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46249 states, 46247 states have (on average 4.2181546911150996) internal successors, (195077), 46248 states have internal predecessors, (195077), 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:45:14,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46249 states to 46249 states and 195077 transitions. [2021-06-05 19:45:14,914 INFO L78 Accepts]: Start accepts. Automaton has 46249 states and 195077 transitions. Word has length 81 [2021-06-05 19:45:14,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:45:14,915 INFO L482 AbstractCegarLoop]: Abstraction has 46249 states and 195077 transitions. [2021-06-05 19:45:14,915 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:45:14,915 INFO L276 IsEmpty]: Start isEmpty. Operand 46249 states and 195077 transitions. [2021-06-05 19:45:14,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-06-05 19:45:14,985 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:45:14,985 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, 1] [2021-06-05 19:45:14,985 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-05 19:45:14,985 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:45:14,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:45:14,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1733770590, now seen corresponding path program 1 times [2021-06-05 19:45:14,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:45:14,986 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215163659] [2021-06-05 19:45:14,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:45:15,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:45:15,150 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:45:15,151 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:45:15,151 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215163659] [2021-06-05 19:45:15,151 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215163659] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:45:15,151 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:45:15,151 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 19:45:15,151 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727568737] [2021-06-05 19:45:15,152 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 19:45:15,152 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:45:15,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 19:45:15,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-05 19:45:15,153 INFO L87 Difference]: Start difference. First operand 46249 states and 195077 transitions. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 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:45:15,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:45:15,697 INFO L93 Difference]: Finished difference Result 49118 states and 205789 transitions. [2021-06-05 19:45:15,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 19:45:15,698 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 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 82 [2021-06-05 19:45:15,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:45:15,818 INFO L225 Difference]: With dead ends: 49118 [2021-06-05 19:45:15,818 INFO L226 Difference]: Without dead ends: 42238 [2021-06-05 19:45:15,818 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 228.4ms TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2021-06-05 19:45:16,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42238 states. [2021-06-05 19:45:16,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42238 to 42238. [2021-06-05 19:45:17,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42238 states, 42237 states have (on average 4.202452825721524) internal successors, (177499), 42237 states have internal predecessors, (177499), 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:45:17,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42238 states to 42238 states and 177499 transitions. [2021-06-05 19:45:17,524 INFO L78 Accepts]: Start accepts. Automaton has 42238 states and 177499 transitions. Word has length 82 [2021-06-05 19:45:17,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:45:17,524 INFO L482 AbstractCegarLoop]: Abstraction has 42238 states and 177499 transitions. [2021-06-05 19:45:17,524 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 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:45:17,524 INFO L276 IsEmpty]: Start isEmpty. Operand 42238 states and 177499 transitions. [2021-06-05 19:45:17,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-06-05 19:45:17,583 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:45:17,583 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, 1, 1] [2021-06-05 19:45:17,584 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-05 19:45:17,584 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:45:17,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:45:17,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1124645029, now seen corresponding path program 1 times [2021-06-05 19:45:17,584 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:45:17,584 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102355605] [2021-06-05 19:45:17,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:45:17,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:45:17,830 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:45:17,830 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:45:17,831 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102355605] [2021-06-05 19:45:17,831 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102355605] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:45:17,831 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:45:17,831 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-06-05 19:45:17,831 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330610737] [2021-06-05 19:45:17,832 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 19:45:17,832 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:45:17,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 19:45:17,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-06-05 19:45:17,833 INFO L87 Difference]: Start difference. First operand 42238 states and 177499 transitions. Second operand has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 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:45:18,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:45:18,382 INFO L93 Difference]: Finished difference Result 45678 states and 190999 transitions. [2021-06-05 19:45:18,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 19:45:18,383 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 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 83 [2021-06-05 19:45:18,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:45:18,495 INFO L225 Difference]: With dead ends: 45678 [2021-06-05 19:45:18,495 INFO L226 Difference]: Without dead ends: 40174 [2021-06-05 19:45:18,495 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 318.8ms TimeCoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2021-06-05 19:45:19,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40174 states. [2021-06-05 19:45:19,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40174 to 40174. [2021-06-05 19:45:20,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40174 states, 40173 states have (on average 4.1910487143106065) internal successors, (168367), 40173 states have internal predecessors, (168367), 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:45:20,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40174 states to 40174 states and 168367 transitions. [2021-06-05 19:45:20,151 INFO L78 Accepts]: Start accepts. Automaton has 40174 states and 168367 transitions. Word has length 83 [2021-06-05 19:45:20,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:45:20,151 INFO L482 AbstractCegarLoop]: Abstraction has 40174 states and 168367 transitions. [2021-06-05 19:45:20,151 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 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:45:20,151 INFO L276 IsEmpty]: Start isEmpty. Operand 40174 states and 168367 transitions. [2021-06-05 19:45:20,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-06-05 19:45:20,209 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:45:20,209 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, 1, 1, 1] [2021-06-05 19:45:20,209 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-05 19:45:20,209 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:45:20,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:45:20,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1561535612, now seen corresponding path program 1 times [2021-06-05 19:45:20,210 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:45:20,210 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573035287] [2021-06-05 19:45:20,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:45:20,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:45:20,821 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:45:20,821 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:45:20,821 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573035287] [2021-06-05 19:45:20,822 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573035287] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:45:20,822 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:45:20,822 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 19:45:20,822 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645917917] [2021-06-05 19:45:20,822 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 19:45:20,822 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:45:20,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 19:45:20,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-06-05 19:45:20,823 INFO L87 Difference]: Start difference. First operand 40174 states and 168367 transitions. Second operand has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 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:45:21,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:45:21,208 INFO L93 Difference]: Finished difference Result 46216 states and 193325 transitions. [2021-06-05 19:45:21,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 19:45:21,209 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 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 84 [2021-06-05 19:45:21,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:45:21,321 INFO L225 Difference]: With dead ends: 46216 [2021-06-05 19:45:21,321 INFO L226 Difference]: Without dead ends: 41056 [2021-06-05 19:45:21,321 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 121.1ms TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2021-06-05 19:45:21,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41056 states. [2021-06-05 19:45:22,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41056 to 40272. [2021-06-05 19:45:22,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40272 states, 40271 states have (on average 4.189540860668968) internal successors, (168717), 40271 states have internal predecessors, (168717), 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:45:22,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40272 states to 40272 states and 168717 transitions. [2021-06-05 19:45:22,541 INFO L78 Accepts]: Start accepts. Automaton has 40272 states and 168717 transitions. Word has length 84 [2021-06-05 19:45:22,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:45:22,541 INFO L482 AbstractCegarLoop]: Abstraction has 40272 states and 168717 transitions. [2021-06-05 19:45:22,541 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 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:45:22,541 INFO L276 IsEmpty]: Start isEmpty. Operand 40272 states and 168717 transitions. [2021-06-05 19:45:22,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-06-05 19:45:22,600 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:45:22,600 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, 1, 1, 1] [2021-06-05 19:45:22,600 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-05 19:45:22,600 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:45:22,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:45:22,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1705417472, now seen corresponding path program 2 times [2021-06-05 19:45:22,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:45:22,601 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140513103] [2021-06-05 19:45:22,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:45:22,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:45:22,753 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:45:22,753 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:45:22,753 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140513103] [2021-06-05 19:45:22,753 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140513103] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:45:22,753 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:45:22,754 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 19:45:22,754 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67981931] [2021-06-05 19:45:22,754 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 19:45:22,754 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:45:22,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 19:45:22,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-06-05 19:45:22,755 INFO L87 Difference]: Start difference. First operand 40272 states and 168717 transitions. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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:45:23,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:45:23,618 INFO L93 Difference]: Finished difference Result 46510 states and 194375 transitions. [2021-06-05 19:45:23,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 19:45:23,618 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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 84 [2021-06-05 19:45:23,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:45:23,810 INFO L225 Difference]: With dead ends: 46510 [2021-06-05 19:45:23,810 INFO L226 Difference]: Without dead ends: 41350 [2021-06-05 19:45:23,811 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 168.2ms TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2021-06-05 19:45:23,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41350 states. [2021-06-05 19:45:24,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41350 to 41056. [2021-06-05 19:45:24,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41056 states, 41055 states have (on average 4.196833516015102) internal successors, (172301), 41055 states have internal predecessors, (172301), 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:45:25,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41056 states to 41056 states and 172301 transitions. [2021-06-05 19:45:25,157 INFO L78 Accepts]: Start accepts. Automaton has 41056 states and 172301 transitions. Word has length 84 [2021-06-05 19:45:25,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:45:25,157 INFO L482 AbstractCegarLoop]: Abstraction has 41056 states and 172301 transitions. [2021-06-05 19:45:25,157 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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:45:25,157 INFO L276 IsEmpty]: Start isEmpty. Operand 41056 states and 172301 transitions. [2021-06-05 19:45:25,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-06-05 19:45:25,224 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:45:25,224 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, 1, 1, 1] [2021-06-05 19:45:25,224 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-05 19:45:25,224 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:45:25,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:45:25,224 INFO L82 PathProgramCache]: Analyzing trace with hash -458379468, now seen corresponding path program 3 times [2021-06-05 19:45:25,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:45:25,225 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120217975] [2021-06-05 19:45:25,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:45:25,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:45:25,372 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:45:25,372 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:45:25,372 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120217975] [2021-06-05 19:45:25,372 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120217975] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:45:25,372 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:45:25,373 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 19:45:25,373 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011129952] [2021-06-05 19:45:25,373 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 19:45:25,373 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:45:25,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 19:45:25,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 19:45:25,375 INFO L87 Difference]: Start difference. First operand 41056 states and 172301 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 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:45:25,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:45:25,837 INFO L93 Difference]: Finished difference Result 49306 states and 206368 transitions. [2021-06-05 19:45:25,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 19:45:25,838 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 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 84 [2021-06-05 19:45:25,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:45:25,967 INFO L225 Difference]: With dead ends: 49306 [2021-06-05 19:45:25,967 INFO L226 Difference]: Without dead ends: 44146 [2021-06-05 19:45:25,968 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 139.2ms TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2021-06-05 19:45:26,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44146 states. [2021-06-05 19:45:27,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44146 to 41252. [2021-06-05 19:45:27,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41252 states, 41251 states have (on average 4.192674116991103) internal successors, (172952), 41251 states have internal predecessors, (172952), 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:45:27,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41252 states to 41252 states and 172952 transitions. [2021-06-05 19:45:27,469 INFO L78 Accepts]: Start accepts. Automaton has 41252 states and 172952 transitions. Word has length 84 [2021-06-05 19:45:27,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:45:27,469 INFO L482 AbstractCegarLoop]: Abstraction has 41252 states and 172952 transitions. [2021-06-05 19:45:27,469 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 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:45:27,469 INFO L276 IsEmpty]: Start isEmpty. Operand 41252 states and 172952 transitions. [2021-06-05 19:45:27,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-06-05 19:45:27,528 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:45:27,528 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, 1, 1, 1] [2021-06-05 19:45:27,528 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-05 19:45:27,528 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:45:27,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:45:27,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1886868052, now seen corresponding path program 4 times [2021-06-05 19:45:27,529 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:45:27,529 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382916281] [2021-06-05 19:45:27,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:45:27,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:45:27,695 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:45:27,695 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:45:27,695 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382916281] [2021-06-05 19:45:27,695 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382916281] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:45:27,696 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:45:27,696 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 19:45:27,696 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190175762] [2021-06-05 19:45:27,697 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 19:45:27,698 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:45:27,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 19:45:27,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-06-05 19:45:27,699 INFO L87 Difference]: Start difference. First operand 41252 states and 172952 transitions. Second operand has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 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:45:28,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:45:28,696 INFO L93 Difference]: Finished difference Result 49478 states and 206779 transitions. [2021-06-05 19:45:28,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 19:45:28,697 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 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 84 [2021-06-05 19:45:28,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:45:28,819 INFO L225 Difference]: With dead ends: 49478 [2021-06-05 19:45:28,819 INFO L226 Difference]: Without dead ends: 43630 [2021-06-05 19:45:28,820 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 243.0ms TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2021-06-05 19:45:28,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43630 states. [2021-06-05 19:45:29,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43630 to 41422. [2021-06-05 19:45:30,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41422 states, 41421 states have (on average 4.185847758383429) internal successors, (173382), 41421 states have internal predecessors, (173382), 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:45:30,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41422 states to 41422 states and 173382 transitions. [2021-06-05 19:45:30,166 INFO L78 Accepts]: Start accepts. Automaton has 41422 states and 173382 transitions. Word has length 84 [2021-06-05 19:45:30,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:45:30,166 INFO L482 AbstractCegarLoop]: Abstraction has 41422 states and 173382 transitions. [2021-06-05 19:45:30,166 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 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:45:30,166 INFO L276 IsEmpty]: Start isEmpty. Operand 41422 states and 173382 transitions. [2021-06-05 19:45:30,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-06-05 19:45:30,230 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:45:30,230 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, 1, 1, 1, 1] [2021-06-05 19:45:30,230 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-05 19:45:30,230 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:45:30,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:45:30,230 INFO L82 PathProgramCache]: Analyzing trace with hash -307423747, now seen corresponding path program 1 times [2021-06-05 19:45:30,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:45:30,231 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135117051] [2021-06-05 19:45:30,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:45:30,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:45:30,457 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:45:30,458 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:45:30,458 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135117051] [2021-06-05 19:45:30,458 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135117051] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:45:30,458 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:45:30,458 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-06-05 19:45:30,458 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017419781] [2021-06-05 19:45:30,458 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 19:45:30,458 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:45:30,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 19:45:30,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2021-06-05 19:45:30,459 INFO L87 Difference]: Start difference. First operand 41422 states and 173382 transitions. Second operand has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 14 states have internal predecessors, (85), 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:45:30,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:45:30,950 INFO L93 Difference]: Finished difference Result 49960 states and 209058 transitions. [2021-06-05 19:45:30,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 19:45:30,951 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 14 states have internal predecessors, (85), 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 85 [2021-06-05 19:45:30,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:45:31,076 INFO L225 Difference]: With dead ends: 49960 [2021-06-05 19:45:31,076 INFO L226 Difference]: Without dead ends: 45832 [2021-06-05 19:45:31,076 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 262.1ms TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2021-06-05 19:45:31,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45832 states. [2021-06-05 19:45:32,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45832 to 45832. [2021-06-05 19:45:32,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45832 states, 45831 states have (on average 4.193013462503545) internal successors, (192170), 45831 states have internal predecessors, (192170), 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:45:33,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45832 states to 45832 states and 192170 transitions. [2021-06-05 19:45:33,035 INFO L78 Accepts]: Start accepts. Automaton has 45832 states and 192170 transitions. Word has length 85 [2021-06-05 19:45:33,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:45:33,035 INFO L482 AbstractCegarLoop]: Abstraction has 45832 states and 192170 transitions. [2021-06-05 19:45:33,035 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 14 states have internal predecessors, (85), 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:45:33,035 INFO L276 IsEmpty]: Start isEmpty. Operand 45832 states and 192170 transitions. [2021-06-05 19:45:33,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-06-05 19:45:33,177 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:45:33,178 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, 1, 1, 1, 1] [2021-06-05 19:45:33,178 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-05 19:45:33,178 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:45:33,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:45:33,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1156020575, now seen corresponding path program 1 times [2021-06-05 19:45:33,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:45:33,178 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136209067] [2021-06-05 19:45:33,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:45:33,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:45:33,257 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:45:33,257 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:45:33,257 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136209067] [2021-06-05 19:45:33,258 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136209067] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:45:33,258 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:45:33,258 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 19:45:33,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000254320] [2021-06-05 19:45:33,258 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 19:45:33,258 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:45:33,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 19:45:33,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 19:45:33,259 INFO L87 Difference]: Start difference. First operand 45832 states and 192170 transitions. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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:45:33,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:45:33,669 INFO L93 Difference]: Finished difference Result 57940 states and 240020 transitions. [2021-06-05 19:45:33,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 19:45:33,669 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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 85 [2021-06-05 19:45:33,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:45:33,791 INFO L225 Difference]: With dead ends: 57940 [2021-06-05 19:45:33,791 INFO L226 Difference]: Without dead ends: 42652 [2021-06-05 19:45:33,792 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 79.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 19:45:33,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42652 states. [2021-06-05 19:45:34,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42652 to 42652. [2021-06-05 19:45:34,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42652 states, 42651 states have (on average 4.144099786640407) internal successors, (176750), 42651 states have internal predecessors, (176750), 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:45:35,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42652 states to 42652 states and 176750 transitions. [2021-06-05 19:45:35,099 INFO L78 Accepts]: Start accepts. Automaton has 42652 states and 176750 transitions. Word has length 85 [2021-06-05 19:45:35,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:45:35,099 INFO L482 AbstractCegarLoop]: Abstraction has 42652 states and 176750 transitions. [2021-06-05 19:45:35,099 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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:45:35,099 INFO L276 IsEmpty]: Start isEmpty. Operand 42652 states and 176750 transitions. [2021-06-05 19:45:35,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-05 19:45:35,167 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:45:35,167 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, 1, 1, 1, 1, 1] [2021-06-05 19:45:35,167 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-05 19:45:35,167 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:45:35,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:45:35,168 INFO L82 PathProgramCache]: Analyzing trace with hash -262332207, now seen corresponding path program 1 times [2021-06-05 19:45:35,168 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:45:35,168 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931018500] [2021-06-05 19:45:35,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:45:35,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:45:35,248 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:45:35,248 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:45:35,248 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931018500] [2021-06-05 19:45:35,248 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931018500] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:45:35,248 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:45:35,249 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 19:45:35,249 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718630336] [2021-06-05 19:45:35,249 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 19:45:35,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:45:35,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 19:45:35,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 19:45:35,250 INFO L87 Difference]: Start difference. First operand 42652 states and 176750 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 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:45:35,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:45:35,583 INFO L93 Difference]: Finished difference Result 46156 states and 187204 transitions. [2021-06-05 19:45:35,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 19:45:35,583 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 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 86 [2021-06-05 19:45:35,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:45:35,673 INFO L225 Difference]: With dead ends: 46156 [2021-06-05 19:45:35,673 INFO L226 Difference]: Without dead ends: 32788 [2021-06-05 19:45:35,673 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 89.8ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-06-05 19:45:36,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32788 states. [2021-06-05 19:45:36,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32788 to 32788. [2021-06-05 19:45:36,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32788 states, 32787 states have (on average 4.02202092292677) internal successors, (131870), 32787 states have internal predecessors, (131870), 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:45:36,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32788 states to 32788 states and 131870 transitions. [2021-06-05 19:45:36,834 INFO L78 Accepts]: Start accepts. Automaton has 32788 states and 131870 transitions. Word has length 86 [2021-06-05 19:45:36,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:45:36,835 INFO L482 AbstractCegarLoop]: Abstraction has 32788 states and 131870 transitions. [2021-06-05 19:45:36,835 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 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:45:36,835 INFO L276 IsEmpty]: Start isEmpty. Operand 32788 states and 131870 transitions. [2021-06-05 19:45:36,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-06-05 19:45:36,887 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:45:36,888 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, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 19:45:36,888 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-05 19:45:36,888 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:45:36,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:45:36,888 INFO L82 PathProgramCache]: Analyzing trace with hash 397022798, now seen corresponding path program 1 times [2021-06-05 19:45:36,888 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:45:36,888 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550645511] [2021-06-05 19:45:36,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:45:36,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:45:36,983 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:45:36,983 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:45:36,983 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550645511] [2021-06-05 19:45:36,983 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550645511] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:45:36,983 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:45:36,984 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 19:45:36,984 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614976402] [2021-06-05 19:45:36,984 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 19:45:36,984 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:45:36,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 19:45:36,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 19:45:36,985 INFO L87 Difference]: Start difference. First operand 32788 states and 131870 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 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:45:37,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:45:37,904 INFO L93 Difference]: Finished difference Result 51652 states and 205051 transitions. [2021-06-05 19:45:37,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 19:45:37,905 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 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 88 [2021-06-05 19:45:37,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:45:38,044 INFO L225 Difference]: With dead ends: 51652 [2021-06-05 19:45:38,044 INFO L226 Difference]: Without dead ends: 34084 [2021-06-05 19:45:38,045 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 97.1ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 19:45:38,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34084 states. [2021-06-05 19:45:38,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34084 to 31582. [2021-06-05 19:45:38,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31582 states, 31581 states have (on average 3.9405971945156897) internal successors, (124448), 31581 states have internal predecessors, (124448), 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:45:38,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31582 states to 31582 states and 124448 transitions. [2021-06-05 19:45:38,828 INFO L78 Accepts]: Start accepts. Automaton has 31582 states and 124448 transitions. Word has length 88 [2021-06-05 19:45:38,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:45:38,828 INFO L482 AbstractCegarLoop]: Abstraction has 31582 states and 124448 transitions. [2021-06-05 19:45:38,828 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 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:45:38,828 INFO L276 IsEmpty]: Start isEmpty. Operand 31582 states and 124448 transitions. [2021-06-05 19:45:38,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-06-05 19:45:38,879 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:45:38,880 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, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 19:45:38,880 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-05 19:45:38,880 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:45:38,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:45:38,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1655762774, now seen corresponding path program 1 times [2021-06-05 19:45:38,880 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:45:38,881 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817176201] [2021-06-05 19:45:38,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:45:38,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:45:38,971 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:45:38,972 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:45:38,972 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817176201] [2021-06-05 19:45:38,972 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817176201] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:45:38,972 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:45:38,972 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 19:45:38,972 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040878693] [2021-06-05 19:45:38,972 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 19:45:38,972 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:45:38,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 19:45:38,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 19:45:38,973 INFO L87 Difference]: Start difference. First operand 31582 states and 124448 transitions. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 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:45:39,445 WARN L205 SmtUtils]: Spent 306.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2021-06-05 19:45:39,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:45:39,579 INFO L93 Difference]: Finished difference Result 28828 states and 111218 transitions. [2021-06-05 19:45:39,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 19:45:39,579 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 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 88 [2021-06-05 19:45:39,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:45:39,667 INFO L225 Difference]: With dead ends: 28828 [2021-06-05 19:45:39,667 INFO L226 Difference]: Without dead ends: 20278 [2021-06-05 19:45:39,667 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 412.0ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-06-05 19:45:39,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20278 states. [2021-06-05 19:45:40,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20278 to 19018. [2021-06-05 19:45:40,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19018 states, 19017 states have (on average 3.7966030393858126) internal successors, (72200), 19017 states have internal predecessors, (72200), 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:45:40,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19018 states to 19018 states and 72200 transitions. [2021-06-05 19:45:40,122 INFO L78 Accepts]: Start accepts. Automaton has 19018 states and 72200 transitions. Word has length 88 [2021-06-05 19:45:40,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:45:40,122 INFO L482 AbstractCegarLoop]: Abstraction has 19018 states and 72200 transitions. [2021-06-05 19:45:40,122 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 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:45:40,122 INFO L276 IsEmpty]: Start isEmpty. Operand 19018 states and 72200 transitions. [2021-06-05 19:45:40,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-06-05 19:45:40,151 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:45:40,152 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 19:45:40,152 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-05 19:45:40,152 INFO L430 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:45:40,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:45:40,152 INFO L82 PathProgramCache]: Analyzing trace with hash 615457511, now seen corresponding path program 1 times [2021-06-05 19:45:40,152 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:45:40,152 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470241403] [2021-06-05 19:45:40,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:45:40,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:45:40,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 19:45:40,259 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:45:40,260 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470241403] [2021-06-05 19:45:40,261 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470241403] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:45:40,261 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:45:40,262 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 19:45:40,262 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752276594] [2021-06-05 19:45:40,262 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 19:45:40,262 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:45:40,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 19:45:40,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-05 19:45:40,263 INFO L87 Difference]: Start difference. First operand 19018 states and 72200 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 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:45:40,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:45:40,510 INFO L93 Difference]: Finished difference Result 16264 states and 61103 transitions. [2021-06-05 19:45:40,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 19:45:40,510 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 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 91 [2021-06-05 19:45:40,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:45:40,530 INFO L225 Difference]: With dead ends: 16264 [2021-06-05 19:45:40,530 INFO L226 Difference]: Without dead ends: 7057 [2021-06-05 19:45:40,531 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 127.6ms TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2021-06-05 19:45:40,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7057 states. [2021-06-05 19:45:40,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7057 to 6385. [2021-06-05 19:45:40,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6385 states, 6384 states have (on average 3.6608709273182956) internal successors, (23371), 6384 states have internal predecessors, (23371), 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:45:40,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6385 states to 6385 states and 23371 transitions. [2021-06-05 19:45:40,666 INFO L78 Accepts]: Start accepts. Automaton has 6385 states and 23371 transitions. Word has length 91 [2021-06-05 19:45:40,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:45:40,666 INFO L482 AbstractCegarLoop]: Abstraction has 6385 states and 23371 transitions. [2021-06-05 19:45:40,666 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 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:45:40,666 INFO L276 IsEmpty]: Start isEmpty. Operand 6385 states and 23371 transitions. [2021-06-05 19:45:40,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-06-05 19:45:40,678 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:45:40,678 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 19:45:40,678 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-05 19:45:40,678 INFO L430 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:45:40,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:45:40,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1395034089, now seen corresponding path program 1 times [2021-06-05 19:45:40,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:45:40,679 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572404134] [2021-06-05 19:45:40,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:45:40,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:45:40,776 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:45:40,777 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:45:40,777 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572404134] [2021-06-05 19:45:40,777 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572404134] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:45:40,777 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:45:40,777 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 19:45:40,777 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350344467] [2021-06-05 19:45:40,777 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 19:45:40,777 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:45:40,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 19:45:40,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 19:45:40,778 INFO L87 Difference]: Start difference. First operand 6385 states and 23371 transitions. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 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:45:40,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:45:40,892 INFO L93 Difference]: Finished difference Result 9535 states and 35263 transitions. [2021-06-05 19:45:40,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 19:45:40,893 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 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 95 [2021-06-05 19:45:40,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:45:40,902 INFO L225 Difference]: With dead ends: 9535 [2021-06-05 19:45:40,902 INFO L226 Difference]: Without dead ends: 3644 [2021-06-05 19:45:40,902 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 80.0ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 19:45:40,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3644 states. [2021-06-05 19:45:41,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3644 to 3644. [2021-06-05 19:45:41,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3644 states, 3643 states have (on average 3.675267636563272) internal successors, (13389), 3643 states have internal predecessors, (13389), 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:45:41,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3644 states to 3644 states and 13389 transitions. [2021-06-05 19:45:41,174 INFO L78 Accepts]: Start accepts. Automaton has 3644 states and 13389 transitions. Word has length 95 [2021-06-05 19:45:41,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:45:41,175 INFO L482 AbstractCegarLoop]: Abstraction has 3644 states and 13389 transitions. [2021-06-05 19:45:41,175 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 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:45:41,175 INFO L276 IsEmpty]: Start isEmpty. Operand 3644 states and 13389 transitions. [2021-06-05 19:45:41,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-06-05 19:45:41,182 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:45:41,182 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 19:45:41,182 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-05 19:45:41,182 INFO L430 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:45:41,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:45:41,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1621222325, now seen corresponding path program 2 times [2021-06-05 19:45:41,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:45:41,184 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566257396] [2021-06-05 19:45:41,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:45:41,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:45:41,368 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:45:41,368 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:45:41,368 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566257396] [2021-06-05 19:45:41,369 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566257396] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:45:41,369 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:45:41,369 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 19:45:41,369 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102151727] [2021-06-05 19:45:41,369 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 19:45:41,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:45:41,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 19:45:41,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-06-05 19:45:41,370 INFO L87 Difference]: Start difference. First operand 3644 states and 13389 transitions. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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:45:41,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:45:41,526 INFO L93 Difference]: Finished difference Result 5414 states and 19927 transitions. [2021-06-05 19:45:41,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 19:45:41,527 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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 95 [2021-06-05 19:45:41,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:45:41,533 INFO L225 Difference]: With dead ends: 5414 [2021-06-05 19:45:41,534 INFO L226 Difference]: Without dead ends: 2636 [2021-06-05 19:45:41,534 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 132.9ms TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-06-05 19:45:41,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2021-06-05 19:45:41,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2636. [2021-06-05 19:45:41,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2636 states, 2635 states have (on average 3.541935483870968) internal successors, (9333), 2635 states have internal predecessors, (9333), 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:45:41,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2636 states to 2636 states and 9333 transitions. [2021-06-05 19:45:41,587 INFO L78 Accepts]: Start accepts. Automaton has 2636 states and 9333 transitions. Word has length 95 [2021-06-05 19:45:41,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:45:41,587 INFO L482 AbstractCegarLoop]: Abstraction has 2636 states and 9333 transitions. [2021-06-05 19:45:41,587 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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:45:41,588 INFO L276 IsEmpty]: Start isEmpty. Operand 2636 states and 9333 transitions. [2021-06-05 19:45:41,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-06-05 19:45:41,592 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:45:41,592 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 19:45:41,592 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-05 19:45:41,592 INFO L430 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:45:41,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:45:41,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1807411347, now seen corresponding path program 3 times [2021-06-05 19:45:41,593 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:45:41,594 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550152854] [2021-06-05 19:45:41,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:45:41,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 19:45:41,637 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 19:45:41,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 19:45:41,690 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 19:45:41,742 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 19:45:41,743 INFO L655 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 19:45:41,743 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-05 19:45:41,744 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/3) [2021-06-05 19:45:41,745 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 19:45:41,746 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 19:45:41,746 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 19:45:41,746 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 19:45:41,746 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 19:45:41,746 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 19:45:41,746 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 19:45:41,746 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 19:45:41,746 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P3Thread1of1ForFork0======== [2021-06-05 19:45:41,751 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 135 places, 124 transitions, 268 flow [2021-06-05 19:45:59,311 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 105490 states, 105486 states have (on average 4.4803291432038375) internal successors, (472612), 105489 states have internal predecessors, (472612), 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:45:59,462 INFO L276 IsEmpty]: Start isEmpty. Operand has 105490 states, 105486 states have (on average 4.4803291432038375) internal successors, (472612), 105489 states have internal predecessors, (472612), 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:45:59,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-06-05 19:45:59,465 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:45:59,465 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] [2021-06-05 19:45:59,465 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:45:59,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:45:59,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1183912701, now seen corresponding path program 1 times [2021-06-05 19:45:59,466 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:45:59,466 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912077580] [2021-06-05 19:45:59,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:45:59,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:45:59,491 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:45:59,491 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:45:59,491 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912077580] [2021-06-05 19:45:59,491 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912077580] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:45:59,491 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:45:59,491 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 19:45:59,491 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730256108] [2021-06-05 19:45:59,492 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 19:45:59,492 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:45:59,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 19:45:59,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 19:45:59,630 INFO L87 Difference]: Start difference. First operand has 105490 states, 105486 states have (on average 4.4803291432038375) internal successors, (472612), 105489 states have internal predecessors, (472612), 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 32.5) internal successors, (65), 3 states have internal predecessors, (65), 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:46:00,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:46:00,128 INFO L93 Difference]: Finished difference Result 90986 states and 399777 transitions. [2021-06-05 19:46:00,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 19:46:00,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 32.5) internal successors, (65), 3 states have internal predecessors, (65), 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 65 [2021-06-05 19:46:00,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:46:00,129 INFO L225 Difference]: With dead ends: 90986 [2021-06-05 19:46:00,129 INFO L226 Difference]: Without dead ends: 0 [2021-06-05 19:46:00,129 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 19:46:00,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-05 19:46:00,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-05 19:46:00,130 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:46:00,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-05 19:46:00,130 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65 [2021-06-05 19:46:00,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:46:00,130 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-05 19:46:00,130 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 32.5) internal successors, (65), 3 states have internal predecessors, (65), 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:46:00,130 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-05 19:46:00,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-05 19:46:00,130 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-05 19:46:00,131 INFO L301 ceAbstractionStarter]: Result for error location P3Thread1of1ForFork0 was SAFE (3/3) [2021-06-05 19:46:00,131 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-05 19:46:00,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 07:46:00 BasicIcfg [2021-06-05 19:46:00,530 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 19:46:00,530 INFO L168 Benchmark]: Toolchain (without parser) took 101243.35 ms. Allocated memory was 350.2 MB in the beginning and 15.2 GB in the end (delta: 14.9 GB). Free memory was 312.5 MB in the beginning and 9.3 GB in the end (delta: -9.0 GB). Peak memory consumption was 6.6 GB. Max. memory is 16.0 GB. [2021-06-05 19:46:00,530 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 350.2 MB. Free memory was 331.0 MB in the beginning and 330.9 MB in the end (delta: 70.1 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 19:46:00,531 INFO L168 Benchmark]: CACSL2BoogieTranslator took 643.99 ms. Allocated memory is still 350.2 MB. Free memory was 312.3 MB in the beginning and 308.7 MB in the end (delta: 3.7 MB). Peak memory consumption was 7.5 MB. Max. memory is 16.0 GB. [2021-06-05 19:46:00,531 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.90 ms. Allocated memory is still 350.2 MB. Free memory was 308.7 MB in the beginning and 305.5 MB in the end (delta: 3.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 19:46:00,531 INFO L168 Benchmark]: Boogie Preprocessor took 45.18 ms. Allocated memory is still 350.2 MB. Free memory was 305.5 MB in the beginning and 303.4 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:46:00,531 INFO L168 Benchmark]: RCFGBuilder took 1877.88 ms. Allocated memory was 350.2 MB in the beginning and 446.7 MB in the end (delta: 96.5 MB). Free memory was 303.4 MB in the beginning and 422.2 MB in the end (delta: -118.8 MB). Peak memory consumption was 113.5 MB. Max. memory is 16.0 GB. [2021-06-05 19:46:00,531 INFO L168 Benchmark]: TraceAbstraction took 98622.46 ms. Allocated memory was 446.7 MB in the beginning and 15.2 GB in the end (delta: 14.8 GB). Free memory was 421.4 MB in the beginning and 9.3 GB in the end (delta: -8.9 GB). Peak memory consumption was 6.6 GB. Max. memory is 16.0 GB. [2021-06-05 19:46:00,532 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.17 ms. Allocated memory is still 350.2 MB. Free memory was 331.0 MB in the beginning and 330.9 MB in the end (delta: 70.1 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 643.99 ms. Allocated memory is still 350.2 MB. Free memory was 312.3 MB in the beginning and 308.7 MB in the end (delta: 3.7 MB). Peak memory consumption was 7.5 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 47.90 ms. Allocated memory is still 350.2 MB. Free memory was 308.7 MB in the beginning and 305.5 MB in the end (delta: 3.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 45.18 ms. Allocated memory is still 350.2 MB. Free memory was 305.5 MB in the beginning and 303.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1877.88 ms. Allocated memory was 350.2 MB in the beginning and 446.7 MB in the end (delta: 96.5 MB). Free memory was 303.4 MB in the beginning and 422.2 MB in the end (delta: -118.8 MB). Peak memory consumption was 113.5 MB. Max. memory is 16.0 GB. * TraceAbstraction took 98622.46 ms. Allocated memory was 446.7 MB in the beginning and 15.2 GB in the end (delta: 14.8 GB). Free memory was 421.4 MB in the beginning and 9.3 GB in the end (delta: -8.9 GB). Peak memory consumption was 6.6 GB. 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: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0] [L714] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0] [L715] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0] [L716] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L718] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L720] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L722] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L723] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L724] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L725] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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] [L726] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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] [L727] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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] [L728] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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] [L729] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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_buff0_thd4=0] [L730] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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_buff0_thd4=0, z$r_buff1_thd0=0] [L731] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L732] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L733] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L734] 0 _Bool z$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L735] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0] [L736] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L737] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L738] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L739] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L740] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L741] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L742] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L834] 0 pthread_t t1517; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L835] FCALL, FORK 0 pthread_create(&t1517, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0: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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L836] 0 pthread_t t1518; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0: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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L837] FCALL, FORK 0 pthread_create(&t1518, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L838] 0 pthread_t t1519; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L839] FCALL, FORK 0 pthread_create(&t1519, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0: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=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L840] 0 pthread_t t1520; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0: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=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L841] FCALL, FORK 0 pthread_create(&t1520, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0: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=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L796] 4 z$w_buff1 = z$w_buff0 [L797] 4 z$w_buff0 = 2 [L798] 4 z$w_buff1_used = z$w_buff0_used [L799] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L801] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L802] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L803] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L804] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L805] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0: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=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L809] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0: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=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L746] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L749] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L761] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L764] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L776] 3 y = 2 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L779] 3 z = 1 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L812] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L812] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L813] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L813] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L814] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L815] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L816] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L819] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L782] 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) [L782] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L782] 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) [L782] 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) [L783] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L783] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L784] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L784] 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 [L785] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L785] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L786] 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 [L789] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L847] 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) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] 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) [L847] 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) [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L849] 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 [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L851] 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 [L854] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L855] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L856] 0 z$flush_delayed = weak$$choice2 [L857] 0 z$mem_tmp = z [L858] 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) [L858] 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) [L859] 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)) [L859] 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)) [L860] 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)) [L860] 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)) [L861] 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)) [L861] 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)) [L862] 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)) [L862] 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)) [L863] 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)) [L863] 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)) [L864] 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)) [L864] 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)) [L865] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L866] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L866] 0 z = z$flush_delayed ? z$mem_tmp : z [L867] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, 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=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, 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=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, 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=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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: P3 with 1 thread instances CFG has 9 procedures, 158 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 19088.3ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 879.6ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 18205.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=105490occurred 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 9 procedures, 158 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 60647.0ms, OverallIterations: 19, TraceHistogramMax: 1, EmptinessCheckTime: 1666.2ms, AutomataDifference: 14882.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 16943.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 3199 SDtfs, 5801 SDslu, 12802 SDs, 0 SdLazy, 1288 SolverSat, 312 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1309.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 269 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 3019.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=105490occurred in iteration=0, InterpolantAutomatonStates: 204, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 23258.1ms AutomataMinimizationTime, 18 MinimizatonAttempts, 19686 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 73.1ms SsaConstructionTime, 740.5ms SatisfiabilityAnalysisTime, 2691.7ms InterpolantComputationTime, 1626 NumberOfCodeBlocks, 1626 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1513 ConstructedInterpolants, 0 QuantifiedInterpolants, 8312 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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: P3Thread1of1ForFork0 with 1 thread instances CFG has 9 procedures, 158 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 18384.6ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 153.5ms, AutomataDifference: 637.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 17565.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 112 SDtfs, 43 SDslu, 77 SDs, 0 SdLazy, 9 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=105490occurred 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.4ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.4ms SsaConstructionTime, 3.7ms SatisfiabilityAnalysisTime, 16.8ms InterpolantComputationTime, 65 NumberOfCodeBlocks, 65 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 64 ConstructedInterpolants, 0 QuantifiedInterpolants, 132 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...