/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-Separate.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix053_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-29289db [2021-06-05 09:57:29,266 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 09:57:29,268 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 09:57:29,302 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 09:57:29,303 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 09:57:29,305 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 09:57:29,307 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 09:57:29,311 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 09:57:29,312 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 09:57:29,317 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 09:57:29,317 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 09:57:29,318 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 09:57:29,318 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 09:57:29,320 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 09:57:29,321 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 09:57:29,322 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 09:57:29,325 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 09:57:29,325 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 09:57:29,327 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 09:57:29,332 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 09:57:29,333 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 09:57:29,334 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 09:57:29,335 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 09:57:29,336 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 09:57:29,340 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 09:57:29,340 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 09:57:29,341 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 09:57:29,342 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 09:57:29,342 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 09:57:29,342 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 09:57:29,343 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 09:57:29,343 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 09:57:29,344 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 09:57:29,344 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 09:57:29,345 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 09:57:29,345 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 09:57:29,346 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 09:57:29,346 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 09:57:29,346 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 09:57:29,346 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 09:57:29,347 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 09:57:29,350 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-Separate.epf [2021-06-05 09:57:29,375 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 09:57:29,375 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 09:57:29,375 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 09:57:29,375 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 09:57:29,377 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 09:57:29,377 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 09:57:29,377 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 09:57:29,378 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 09:57:29,378 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 09:57:29,378 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 09:57:29,378 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 09:57:29,378 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 09:57:29,378 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 09:57:29,379 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 09:57:29,379 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 09:57:29,379 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 09:57:29,379 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 09:57:29,379 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 09:57:29,379 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 09:57:29,379 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 09:57:29,379 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 09:57:29,379 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 09:57:29,379 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 09:57:29,379 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 09:57:29,380 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 09:57:29,380 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 09:57:29,380 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 09:57:29,380 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 09:57:29,380 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 09:57:29,380 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 09:57:29,380 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 09:57:29,380 INFO L138 SettingsManager]: * Check the insufficient thread errors last=true [2021-06-05 09:57:29,380 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 09:57:29,626 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 09:57:29,639 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 09:57:29,640 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 09:57:29,641 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-05 09:57:29,642 INFO L275 PluginConnector]: CDTParser initialized [2021-06-05 09:57:29,642 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix053_tso.oepc.i [2021-06-05 09:57:29,696 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f86b6eae7/0de539615ef748479a47f271c8f283eb/FLAGf34c1e44d [2021-06-05 09:57:30,153 INFO L306 CDTParser]: Found 1 translation units. [2021-06-05 09:57:30,154 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix053_tso.oepc.i [2021-06-05 09:57:30,167 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f86b6eae7/0de539615ef748479a47f271c8f283eb/FLAGf34c1e44d [2021-06-05 09:57:30,184 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f86b6eae7/0de539615ef748479a47f271c8f283eb [2021-06-05 09:57:30,186 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 09:57:30,187 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-05 09:57:30,189 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-05 09:57:30,190 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-05 09:57:30,192 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-05 09:57:30,193 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 09:57:30" (1/1) ... [2021-06-05 09:57:30,194 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@448e1f3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:57:30, skipping insertion in model container [2021-06-05 09:57:30,194 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 09:57:30" (1/1) ... [2021-06-05 09:57:30,198 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-05 09:57:30,236 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-05 09:57:30,390 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/mix053_tso.oepc.i[949,962] [2021-06-05 09:57:30,557 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 09:57:30,562 INFO L203 MainTranslator]: Completed pre-run [2021-06-05 09:57:30,569 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/mix053_tso.oepc.i[949,962] [2021-06-05 09:57:30,594 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 09:57:30,648 INFO L208 MainTranslator]: Completed translation [2021-06-05 09:57:30,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:57:30 WrapperNode [2021-06-05 09:57:30,649 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-05 09:57:30,650 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 09:57:30,650 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 09:57:30,650 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 09:57:30,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:57:30" (1/1) ... [2021-06-05 09:57:30,665 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:57:30" (1/1) ... [2021-06-05 09:57:30,685 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 09:57:30,686 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 09:57:30,686 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 09:57:30,686 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 09:57:30,697 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:57:30" (1/1) ... [2021-06-05 09:57:30,697 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:57:30" (1/1) ... [2021-06-05 09:57:30,710 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:57:30" (1/1) ... [2021-06-05 09:57:30,711 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:57:30" (1/1) ... [2021-06-05 09:57:30,717 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:57:30" (1/1) ... [2021-06-05 09:57:30,720 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:57:30" (1/1) ... [2021-06-05 09:57:30,722 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:57:30" (1/1) ... [2021-06-05 09:57:30,725 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 09:57:30,726 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 09:57:30,726 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 09:57:30,726 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 09:57:30,727 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:57:30" (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 09:57:30,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-05 09:57:30,779 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-05 09:57:30,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-05 09:57:30,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-05 09:57:30,779 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-05 09:57:30,780 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-05 09:57:30,780 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-05 09:57:30,780 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-05 09:57:30,780 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-05 09:57:30,780 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-05 09:57:30,780 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-06-05 09:57:30,780 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-06-05 09:57:30,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-05 09:57:30,780 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-05 09:57:30,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 09:57:30,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 09:57:30,781 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 09:57:32,212 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 09:57:32,212 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-05 09:57:32,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 09:57:32 BoogieIcfgContainer [2021-06-05 09:57:32,215 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 09:57:32,217 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 09:57:32,217 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 09:57:32,219 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 09:57:32,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.06 09:57:30" (1/3) ... [2021-06-05 09:57:32,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45773ccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 09:57:32, skipping insertion in model container [2021-06-05 09:57:32,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:57:30" (2/3) ... [2021-06-05 09:57:32,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45773ccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 09:57:32, skipping insertion in model container [2021-06-05 09:57:32,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 09:57:32" (3/3) ... [2021-06-05 09:57:32,221 INFO L111 eAbstractionObserver]: Analyzing ICFG mix053_tso.oepc.i [2021-06-05 09:57:32,225 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 09:57:32,226 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 09:57:32,226 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-05 09:57:32,226 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 09:57:32,254 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,254 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,254 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,255 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,255 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,255 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,255 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,255 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,255 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,255 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,255 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,256 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,256 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,256 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,257 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,257 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,257 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,257 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,258 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,258 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,258 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,258 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,258 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,258 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,259 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,259 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,259 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,259 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,260 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,260 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,260 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,260 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,260 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,260 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,261 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,261 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,261 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,261 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,261 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,261 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,261 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,262 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,262 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,262 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,262 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,262 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,262 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,262 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,262 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,262 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,263 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,263 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,263 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,263 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,263 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,265 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,266 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,266 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,266 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,266 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,266 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,266 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,266 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,266 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,266 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,267 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,267 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,267 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,267 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,267 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,267 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,267 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,267 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,267 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,268 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,268 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,269 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,276 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,276 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,276 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,276 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,277 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,277 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,278 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,278 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,278 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,278 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,278 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,278 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,278 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,278 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,279 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,279 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,280 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,280 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,280 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,280 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,280 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,280 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,281 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,281 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,282 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,282 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,282 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,282 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,282 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,282 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,282 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,282 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,282 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,282 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,282 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,283 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,284 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,284 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,285 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,285 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:57:32,286 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 09:57:32,300 INFO L255 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-06-05 09:57:32,320 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 09:57:32,321 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 09:57:32,321 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 09:57:32,321 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 09:57:32,321 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 09:57:32,321 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 09:57:32,321 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 09:57:32,321 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 09:57:32,332 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 137 places, 126 transitions, 272 flow [2021-06-05 09:57:53,510 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 120940 states, 120936 states have (on average 4.495964807832242) internal successors, (543724), 120939 states have internal predecessors, (543724), 0 states have call successors, (0), 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 09:57:53,686 INFO L276 IsEmpty]: Start isEmpty. Operand has 120940 states, 120936 states have (on average 4.495964807832242) internal successors, (543724), 120939 states have internal predecessors, (543724), 0 states have call successors, (0), 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 09:57:53,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-06-05 09:57:53,695 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:57:53,696 INFO L521 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] [2021-06-05 09:57:53,696 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:57:53,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:57:53,700 INFO L82 PathProgramCache]: Analyzing trace with hash 141610343, now seen corresponding path program 1 times [2021-06-05 09:57:53,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:57:53,706 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449693252] [2021-06-05 09:57:53,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:57:53,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:57:53,879 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 09:57:53,879 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:57:53,880 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449693252] [2021-06-05 09:57:53,880 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449693252] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:57:53,881 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:57:53,881 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 09:57:53,882 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005935984] [2021-06-05 09:57:53,885 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 09:57:53,885 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:57:53,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 09:57:53,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 09:57:54,033 INFO L87 Difference]: Start difference. First operand has 120940 states, 120936 states have (on average 4.495964807832242) internal successors, (543724), 120939 states have internal predecessors, (543724), 0 states have call successors, (0), 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 29.5) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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 09:57:55,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:57:55,529 INFO L93 Difference]: Finished difference Result 103972 states and 458725 transitions. [2021-06-05 09:57:55,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 09:57:55,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 29.5) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2021-06-05 09:57:55,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:57:55,927 INFO L225 Difference]: With dead ends: 103972 [2021-06-05 09:57:55,927 INFO L226 Difference]: Without dead ends: 57380 [2021-06-05 09:57:55,928 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 09:57:56,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57380 states. [2021-06-05 09:57:57,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57380 to 57380. [2021-06-05 09:57:57,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57380 states, 57379 states have (on average 4.35512992558253) internal successors, (249893), 57379 states have internal predecessors, (249893), 0 states have call successors, (0), 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 09:57:58,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57380 states to 57380 states and 249893 transitions. [2021-06-05 09:57:58,514 INFO L78 Accepts]: Start accepts. Automaton has 57380 states and 249893 transitions. Word has length 59 [2021-06-05 09:57:58,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:57:58,516 INFO L482 AbstractCegarLoop]: Abstraction has 57380 states and 249893 transitions. [2021-06-05 09:57:58,517 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 29.5) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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 09:57:58,517 INFO L276 IsEmpty]: Start isEmpty. Operand 57380 states and 249893 transitions. [2021-06-05 09:57:58,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-06-05 09:57:58,574 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:57:58,574 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:57:58,574 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 09:57:58,574 INFO L430 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:57:58,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:57:58,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1715132353, now seen corresponding path program 1 times [2021-06-05 09:57:58,577 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:57:58,577 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473804569] [2021-06-05 09:57:58,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:57:58,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:57:58,879 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 09:57:58,879 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:57:58,879 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473804569] [2021-06-05 09:57:58,879 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473804569] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:57:58,879 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:57:58,879 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 09:57:58,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274397619] [2021-06-05 09:57:58,880 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 09:57:58,880 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:57:58,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 09:57:58,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 09:57:58,881 INFO L87 Difference]: Start difference. First operand 57380 states and 249893 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:57:59,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:57:59,709 INFO L93 Difference]: Finished difference Result 69700 states and 301109 transitions. [2021-06-05 09:57:59,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 09:57:59,709 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2021-06-05 09:57:59,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:58:00,148 INFO L225 Difference]: With dead ends: 69700 [2021-06-05 09:58:00,168 INFO L226 Difference]: Without dead ends: 55364 [2021-06-05 09:58:00,169 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 104.7ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:58:00,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55364 states. [2021-06-05 09:58:01,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55364 to 55364. [2021-06-05 09:58:01,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55364 states, 55363 states have (on average 4.336849520437838) internal successors, (240101), 55363 states have internal predecessors, (240101), 0 states have call successors, (0), 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 09:58:02,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55364 states to 55364 states and 240101 transitions. [2021-06-05 09:58:02,023 INFO L78 Accepts]: Start accepts. Automaton has 55364 states and 240101 transitions. Word has length 78 [2021-06-05 09:58:02,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:58:02,023 INFO L482 AbstractCegarLoop]: Abstraction has 55364 states and 240101 transitions. [2021-06-05 09:58:02,023 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:58:02,023 INFO L276 IsEmpty]: Start isEmpty. Operand 55364 states and 240101 transitions. [2021-06-05 09:58:02,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-06-05 09:58:02,070 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:58:02,071 INFO L521 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 09:58:02,071 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 09:58:02,071 INFO L430 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:58:02,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:58:02,071 INFO L82 PathProgramCache]: Analyzing trace with hash -164143458, now seen corresponding path program 1 times [2021-06-05 09:58:02,071 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:58:02,071 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555433927] [2021-06-05 09:58:02,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:58:02,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:58:02,214 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 09:58:02,214 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:58:02,214 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555433927] [2021-06-05 09:58:02,214 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555433927] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:58:02,214 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:58:02,214 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:58:02,215 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165775307] [2021-06-05 09:58:02,215 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:58:02,215 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:58:02,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:58:02,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:58:02,216 INFO L87 Difference]: Start difference. First operand 55364 states and 240101 transitions. Second operand has 10 states, 10 states have (on average 8.1) internal successors, (81), 10 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 09:58:03,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:58:03,175 INFO L93 Difference]: Finished difference Result 65052 states and 280563 transitions. [2021-06-05 09:58:03,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 09:58:03,176 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.1) internal successors, (81), 10 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 09:58:03,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:58:03,352 INFO L225 Difference]: With dead ends: 65052 [2021-06-05 09:58:03,352 INFO L226 Difference]: Without dead ends: 55868 [2021-06-05 09:58:03,353 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 213.4ms TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2021-06-05 09:58:03,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55868 states. [2021-06-05 09:58:04,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55868 to 55532. [2021-06-05 09:58:04,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55532 states, 55531 states have (on average 4.335146134591489) internal successors, (240735), 55531 states have internal predecessors, (240735), 0 states have call successors, (0), 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 09:58:05,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55532 states to 55532 states and 240735 transitions. [2021-06-05 09:58:05,500 INFO L78 Accepts]: Start accepts. Automaton has 55532 states and 240735 transitions. Word has length 81 [2021-06-05 09:58:05,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:58:05,502 INFO L482 AbstractCegarLoop]: Abstraction has 55532 states and 240735 transitions. [2021-06-05 09:58:05,502 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.1) internal successors, (81), 10 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 09:58:05,502 INFO L276 IsEmpty]: Start isEmpty. Operand 55532 states and 240735 transitions. [2021-06-05 09:58:05,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-06-05 09:58:05,600 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:58:05,600 INFO L521 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 09:58:05,600 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 09:58:05,600 INFO L430 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:58:05,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:58:05,601 INFO L82 PathProgramCache]: Analyzing trace with hash -630645313, now seen corresponding path program 1 times [2021-06-05 09:58:05,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:58:05,601 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263052220] [2021-06-05 09:58:05,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:58:05,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:58:05,891 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 09:58:05,891 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:58:05,891 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263052220] [2021-06-05 09:58:05,891 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263052220] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:58:05,891 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:58:05,891 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-05 09:58:05,892 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211879034] [2021-06-05 09:58:05,892 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 09:58:05,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:58:05,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 09:58:05,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-06-05 09:58:05,893 INFO L87 Difference]: Start difference. First operand 55532 states and 240735 transitions. Second operand has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 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 09:58:06,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:58:06,525 INFO L93 Difference]: Finished difference Result 64604 states and 278233 transitions. [2021-06-05 09:58:06,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 09:58:06,525 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 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 09:58:06,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:58:07,066 INFO L225 Difference]: With dead ends: 64604 [2021-06-05 09:58:07,067 INFO L226 Difference]: Without dead ends: 56540 [2021-06-05 09:58:07,067 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 200.9ms TimeCoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2021-06-05 09:58:07,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56540 states. [2021-06-05 09:58:08,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56540 to 53684. [2021-06-05 09:58:08,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53684 states, 53683 states have (on average 4.321610193171023) internal successors, (231997), 53683 states have internal predecessors, (231997), 0 states have call successors, (0), 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 09:58:08,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53684 states to 53684 states and 231997 transitions. [2021-06-05 09:58:08,498 INFO L78 Accepts]: Start accepts. Automaton has 53684 states and 231997 transitions. Word has length 82 [2021-06-05 09:58:08,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:58:08,501 INFO L482 AbstractCegarLoop]: Abstraction has 53684 states and 231997 transitions. [2021-06-05 09:58:08,501 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 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 09:58:08,501 INFO L276 IsEmpty]: Start isEmpty. Operand 53684 states and 231997 transitions. [2021-06-05 09:58:08,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-06-05 09:58:08,561 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:58:08,561 INFO L521 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 09:58:08,561 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-05 09:58:08,561 INFO L430 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:58:08,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:58:08,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1550239140, now seen corresponding path program 1 times [2021-06-05 09:58:08,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:58:08,562 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191021887] [2021-06-05 09:58:08,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:58:08,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:58:08,773 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 09:58:08,773 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:58:08,773 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191021887] [2021-06-05 09:58:08,773 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191021887] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:58:08,773 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:58:08,774 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 09:58:08,774 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569708255] [2021-06-05 09:58:08,774 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 09:58:08,774 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:58:08,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 09:58:08,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 09:58:08,775 INFO L87 Difference]: Start difference. First operand 53684 states and 231997 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 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 09:58:09,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:58:09,941 INFO L93 Difference]: Finished difference Result 62708 states and 268829 transitions. [2021-06-05 09:58:09,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 09:58:09,942 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 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 09:58:09,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:58:10,132 INFO L225 Difference]: With dead ends: 62708 [2021-06-05 09:58:10,132 INFO L226 Difference]: Without dead ends: 51956 [2021-06-05 09:58:10,132 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 97.3ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 09:58:10,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51956 states. [2021-06-05 09:58:11,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51956 to 51956. [2021-06-05 09:58:11,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51956 states, 51955 states have (on average 4.310133769608315) internal successors, (223933), 51955 states have internal predecessors, (223933), 0 states have call successors, (0), 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 09:58:12,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51956 states to 51956 states and 223933 transitions. [2021-06-05 09:58:12,105 INFO L78 Accepts]: Start accepts. Automaton has 51956 states and 223933 transitions. Word has length 82 [2021-06-05 09:58:12,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:58:12,106 INFO L482 AbstractCegarLoop]: Abstraction has 51956 states and 223933 transitions. [2021-06-05 09:58:12,106 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 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 09:58:12,106 INFO L276 IsEmpty]: Start isEmpty. Operand 51956 states and 223933 transitions. [2021-06-05 09:58:12,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-06-05 09:58:12,181 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:58:12,181 INFO L521 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 09:58:12,181 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-05 09:58:12,181 INFO L430 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:58:12,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:58:12,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1764597122, now seen corresponding path program 1 times [2021-06-05 09:58:12,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:58:12,182 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376598583] [2021-06-05 09:58:12,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:58:12,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:58:12,335 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 09:58:12,335 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:58:12,335 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376598583] [2021-06-05 09:58:12,335 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376598583] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:58:12,336 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:58:12,336 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 09:58:12,336 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211341947] [2021-06-05 09:58:12,337 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 09:58:12,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:58:12,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 09:58:12,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 09:58:12,337 INFO L87 Difference]: Start difference. First operand 51956 states and 223933 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 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 09:58:12,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:58:12,881 INFO L93 Difference]: Finished difference Result 60902 states and 261687 transitions. [2021-06-05 09:58:12,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 09:58:12,881 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 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 09:58:12,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:58:13,038 INFO L225 Difference]: With dead ends: 60902 [2021-06-05 09:58:13,038 INFO L226 Difference]: Without dead ends: 53958 [2021-06-05 09:58:13,038 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 119.9ms TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2021-06-05 09:58:13,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53958 states. [2021-06-05 09:58:14,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53958 to 53622. [2021-06-05 09:58:14,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53622 states, 53621 states have (on average 4.3164245351634625) internal successors, (231451), 53621 states have internal predecessors, (231451), 0 states have call successors, (0), 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 09:58:14,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53622 states to 53622 states and 231451 transitions. [2021-06-05 09:58:14,969 INFO L78 Accepts]: Start accepts. Automaton has 53622 states and 231451 transitions. Word has length 83 [2021-06-05 09:58:14,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:58:14,969 INFO L482 AbstractCegarLoop]: Abstraction has 53622 states and 231451 transitions. [2021-06-05 09:58:14,969 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 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 09:58:14,970 INFO L276 IsEmpty]: Start isEmpty. Operand 53622 states and 231451 transitions. [2021-06-05 09:58:15,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-06-05 09:58:15,038 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:58:15,038 INFO L521 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 09:58:15,038 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-05 09:58:15,038 INFO L430 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:58:15,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:58:15,039 INFO L82 PathProgramCache]: Analyzing trace with hash 2013187108, now seen corresponding path program 2 times [2021-06-05 09:58:15,039 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:58:15,039 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851856555] [2021-06-05 09:58:15,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:58:15,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:58:15,198 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 09:58:15,198 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:58:15,199 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851856555] [2021-06-05 09:58:15,199 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851856555] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:58:15,199 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:58:15,199 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 09:58:15,199 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333444861] [2021-06-05 09:58:15,200 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 09:58:15,200 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:58:15,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 09:58:15,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-06-05 09:58:15,200 INFO L87 Difference]: Start difference. First operand 53622 states and 231451 transitions. Second operand has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 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 09:58:15,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:58:15,845 INFO L93 Difference]: Finished difference Result 61070 states and 262307 transitions. [2021-06-05 09:58:15,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 09:58:15,845 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 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 09:58:15,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:58:16,384 INFO L225 Difference]: With dead ends: 61070 [2021-06-05 09:58:16,385 INFO L226 Difference]: Without dead ends: 54126 [2021-06-05 09:58:16,385 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 182.1ms TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2021-06-05 09:58:16,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54126 states. [2021-06-05 09:58:17,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54126 to 53566. [2021-06-05 09:58:17,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53566 states, 53565 states have (on average 4.316904695230094) internal successors, (231235), 53565 states have internal predecessors, (231235), 0 states have call successors, (0), 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 09:58:17,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53566 states to 53566 states and 231235 transitions. [2021-06-05 09:58:17,840 INFO L78 Accepts]: Start accepts. Automaton has 53566 states and 231235 transitions. Word has length 83 [2021-06-05 09:58:17,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:58:17,840 INFO L482 AbstractCegarLoop]: Abstraction has 53566 states and 231235 transitions. [2021-06-05 09:58:17,840 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 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 09:58:17,840 INFO L276 IsEmpty]: Start isEmpty. Operand 53566 states and 231235 transitions. [2021-06-05 09:58:17,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-06-05 09:58:17,899 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:58:17,899 INFO L521 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 09:58:17,899 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-05 09:58:17,900 INFO L430 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:58:17,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:58:17,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1183946752, now seen corresponding path program 3 times [2021-06-05 09:58:17,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:58:17,900 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615824352] [2021-06-05 09:58:17,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:58:17,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:58:18,017 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 09:58:18,017 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:58:18,017 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615824352] [2021-06-05 09:58:18,017 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615824352] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:58:18,018 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:58:18,018 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:58:18,018 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727786945] [2021-06-05 09:58:18,018 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:58:18,018 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:58:18,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:58:18,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:58:18,019 INFO L87 Difference]: Start difference. First operand 53566 states and 231235 transitions. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 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 09:58:18,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:58:18,957 INFO L93 Difference]: Finished difference Result 65466 states and 281440 transitions. [2021-06-05 09:58:18,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 09:58:18,958 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 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 09:58:18,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:58:19,142 INFO L225 Difference]: With dead ends: 65466 [2021-06-05 09:58:19,142 INFO L226 Difference]: Without dead ends: 57626 [2021-06-05 09:58:19,142 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 146.3ms TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2021-06-05 09:58:19,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57626 states. [2021-06-05 09:58:20,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57626 to 54840. [2021-06-05 09:58:20,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54840 states, 54839 states have (on average 4.309925418041905) internal successors, (236352), 54839 states have internal predecessors, (236352), 0 states have call successors, (0), 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 09:58:20,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54840 states to 54840 states and 236352 transitions. [2021-06-05 09:58:20,738 INFO L78 Accepts]: Start accepts. Automaton has 54840 states and 236352 transitions. Word has length 83 [2021-06-05 09:58:20,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:58:20,738 INFO L482 AbstractCegarLoop]: Abstraction has 54840 states and 236352 transitions. [2021-06-05 09:58:20,738 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 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 09:58:20,738 INFO L276 IsEmpty]: Start isEmpty. Operand 54840 states and 236352 transitions. [2021-06-05 09:58:20,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-06-05 09:58:20,810 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:58:20,810 INFO L521 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 09:58:20,810 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-05 09:58:20,810 INFO L430 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:58:20,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:58:20,811 INFO L82 PathProgramCache]: Analyzing trace with hash 132913251, now seen corresponding path program 1 times [2021-06-05 09:58:20,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:58:20,811 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393525031] [2021-06-05 09:58:20,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:58:20,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:58:20,964 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 09:58:20,965 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:58:20,965 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393525031] [2021-06-05 09:58:20,965 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393525031] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:58:20,965 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:58:20,965 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-05 09:58:20,965 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706041136] [2021-06-05 09:58:20,965 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 09:58:20,965 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:58:20,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 09:58:20,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-06-05 09:58:20,966 INFO L87 Difference]: Start difference. First operand 54840 states and 236352 transitions. Second operand has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 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 09:58:22,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:58:22,010 INFO L93 Difference]: Finished difference Result 90498 states and 385874 transitions. [2021-06-05 09:58:22,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 09:58:22,010 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 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 09:58:22,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:58:22,284 INFO L225 Difference]: With dead ends: 90498 [2021-06-05 09:58:22,284 INFO L226 Difference]: Without dead ends: 84226 [2021-06-05 09:58:22,284 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 170.9ms TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2021-06-05 09:58:22,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84226 states. [2021-06-05 09:58:24,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84226 to 62722. [2021-06-05 09:58:24,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62722 states, 62721 states have (on average 4.308158352067091) internal successors, (270212), 62721 states have internal predecessors, (270212), 0 states have call successors, (0), 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 09:58:24,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62722 states to 62722 states and 270212 transitions. [2021-06-05 09:58:24,702 INFO L78 Accepts]: Start accepts. Automaton has 62722 states and 270212 transitions. Word has length 84 [2021-06-05 09:58:24,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:58:24,702 INFO L482 AbstractCegarLoop]: Abstraction has 62722 states and 270212 transitions. [2021-06-05 09:58:24,702 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 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 09:58:24,703 INFO L276 IsEmpty]: Start isEmpty. Operand 62722 states and 270212 transitions. [2021-06-05 09:58:24,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-06-05 09:58:24,788 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:58:24,788 INFO L521 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 09:58:24,788 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-05 09:58:24,789 INFO L430 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:58:24,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:58:24,789 INFO L82 PathProgramCache]: Analyzing trace with hash 381503237, now seen corresponding path program 2 times [2021-06-05 09:58:24,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:58:24,789 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834466764] [2021-06-05 09:58:24,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:58:24,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:58:25,004 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 09:58:25,004 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:58:25,004 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834466764] [2021-06-05 09:58:25,004 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834466764] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:58:25,006 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:58:25,006 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-06-05 09:58:25,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466067539] [2021-06-05 09:58:25,006 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 09:58:25,007 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:58:25,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 09:58:25,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2021-06-05 09:58:25,007 INFO L87 Difference]: Start difference. First operand 62722 states and 270212 transitions. Second operand has 15 states, 15 states have (on average 5.6) internal successors, (84), 15 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 09:58:25,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:58:25,676 INFO L93 Difference]: Finished difference Result 71458 states and 306050 transitions. [2021-06-05 09:58:25,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 09:58:25,677 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.6) internal successors, (84), 15 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 09:58:25,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:58:25,872 INFO L225 Difference]: With dead ends: 71458 [2021-06-05 09:58:25,873 INFO L226 Difference]: Without dead ends: 65186 [2021-06-05 09:58:25,873 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 249.3ms TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2021-06-05 09:58:26,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65186 states. [2021-06-05 09:58:27,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65186 to 62386. [2021-06-05 09:58:27,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62386 states, 62385 states have (on average 4.311709545563837) internal successors, (268986), 62385 states have internal predecessors, (268986), 0 states have call successors, (0), 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 09:58:27,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62386 states to 62386 states and 268986 transitions. [2021-06-05 09:58:27,994 INFO L78 Accepts]: Start accepts. Automaton has 62386 states and 268986 transitions. Word has length 84 [2021-06-05 09:58:27,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:58:27,994 INFO L482 AbstractCegarLoop]: Abstraction has 62386 states and 268986 transitions. [2021-06-05 09:58:27,994 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 5.6) internal successors, (84), 15 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 09:58:27,994 INFO L276 IsEmpty]: Start isEmpty. Operand 62386 states and 268986 transitions. [2021-06-05 09:58:28,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-06-05 09:58:28,071 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:58:28,071 INFO L521 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 09:58:28,072 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-05 09:58:28,072 INFO L430 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:58:28,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:58:28,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1610783365, now seen corresponding path program 3 times [2021-06-05 09:58:28,072 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:58:28,072 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171684923] [2021-06-05 09:58:28,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:58:28,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:58:28,233 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 09:58:28,233 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:58:28,233 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171684923] [2021-06-05 09:58:28,233 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171684923] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:58:28,234 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:58:28,234 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-05 09:58:28,234 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208607113] [2021-06-05 09:58:28,234 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 09:58:28,234 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:58:28,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 09:58:28,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-06-05 09:58:28,235 INFO L87 Difference]: Start difference. First operand 62386 states and 268986 transitions. Second operand has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 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 09:58:29,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:58:29,331 INFO L93 Difference]: Finished difference Result 90162 states and 383150 transitions. [2021-06-05 09:58:29,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 09:58:29,331 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 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 09:58:29,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:58:29,577 INFO L225 Difference]: With dead ends: 90162 [2021-06-05 09:58:29,577 INFO L226 Difference]: Without dead ends: 75266 [2021-06-05 09:58:29,577 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 186.5ms TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2021-06-05 09:58:29,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75266 states. [2021-06-05 09:58:31,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75266 to 61336. [2021-06-05 09:58:31,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61336 states, 61335 states have (on average 4.2674492540963564) internal successors, (261744), 61335 states have internal predecessors, (261744), 0 states have call successors, (0), 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 09:58:31,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61336 states to 61336 states and 261744 transitions. [2021-06-05 09:58:31,356 INFO L78 Accepts]: Start accepts. Automaton has 61336 states and 261744 transitions. Word has length 84 [2021-06-05 09:58:31,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:58:31,357 INFO L482 AbstractCegarLoop]: Abstraction has 61336 states and 261744 transitions. [2021-06-05 09:58:31,357 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 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 09:58:31,357 INFO L276 IsEmpty]: Start isEmpty. Operand 61336 states and 261744 transitions. [2021-06-05 09:58:31,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-06-05 09:58:31,431 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:58:31,432 INFO L521 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 09:58:31,432 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-05 09:58:31,432 INFO L430 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:58:31,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:58:31,432 INFO L82 PathProgramCache]: Analyzing trace with hash 165714821, now seen corresponding path program 1 times [2021-06-05 09:58:31,433 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:58:31,433 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611897508] [2021-06-05 09:58:31,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:58:31,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:58:31,490 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 09:58:31,491 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:58:31,491 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611897508] [2021-06-05 09:58:31,491 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611897508] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:58:31,491 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:58:31,491 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 09:58:31,491 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035379839] [2021-06-05 09:58:31,491 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 09:58:31,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:58:31,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 09:58:31,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 09:58:31,492 INFO L87 Difference]: Start difference. First operand 61336 states and 261744 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 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 09:58:32,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:58:32,408 INFO L93 Difference]: Finished difference Result 75868 states and 319848 transitions. [2021-06-05 09:58:32,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 09:58:32,408 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 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 09:58:32,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:58:32,588 INFO L225 Difference]: With dead ends: 75868 [2021-06-05 09:58:32,588 INFO L226 Difference]: Without dead ends: 57052 [2021-06-05 09:58:32,588 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 60.0ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 09:58:32,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57052 states. [2021-06-05 09:58:33,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57052 to 57052. [2021-06-05 09:58:34,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57052 states, 57051 states have (on average 4.21440465548369) internal successors, (240436), 57051 states have internal predecessors, (240436), 0 states have call successors, (0), 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 09:58:34,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57052 states to 57052 states and 240436 transitions. [2021-06-05 09:58:34,198 INFO L78 Accepts]: Start accepts. Automaton has 57052 states and 240436 transitions. Word has length 84 [2021-06-05 09:58:34,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:58:34,198 INFO L482 AbstractCegarLoop]: Abstraction has 57052 states and 240436 transitions. [2021-06-05 09:58:34,198 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 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 09:58:34,198 INFO L276 IsEmpty]: Start isEmpty. Operand 57052 states and 240436 transitions. [2021-06-05 09:58:34,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-06-05 09:58:34,271 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:58:34,271 INFO L521 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 09:58:34,271 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-05 09:58:34,271 INFO L430 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:58:34,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:58:34,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1819372335, now seen corresponding path program 1 times [2021-06-05 09:58:34,273 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:58:34,273 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082497930] [2021-06-05 09:58:34,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:58:34,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:58:34,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:58:34,347 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:58:34,347 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082497930] [2021-06-05 09:58:34,347 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082497930] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:58:34,347 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:58:34,347 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 09:58:34,347 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695107070] [2021-06-05 09:58:34,347 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 09:58:34,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:58:34,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 09:58:34,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 09:58:34,348 INFO L87 Difference]: Start difference. First operand 57052 states and 240436 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 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 09:58:35,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:58:35,144 INFO L93 Difference]: Finished difference Result 59572 states and 245167 transitions. [2021-06-05 09:58:35,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 09:58:35,145 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 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 09:58:35,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:58:35,257 INFO L225 Difference]: With dead ends: 59572 [2021-06-05 09:58:35,257 INFO L226 Difference]: Without dead ends: 43012 [2021-06-05 09:58:35,257 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 64.3ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:58:35,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43012 states. [2021-06-05 09:58:36,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43012 to 43012. [2021-06-05 09:58:36,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43012 states, 43011 states have (on average 4.0782125502778355) internal successors, (175408), 43011 states have internal predecessors, (175408), 0 states have call successors, (0), 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 09:58:36,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43012 states to 43012 states and 175408 transitions. [2021-06-05 09:58:36,532 INFO L78 Accepts]: Start accepts. Automaton has 43012 states and 175408 transitions. Word has length 85 [2021-06-05 09:58:36,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:58:36,533 INFO L482 AbstractCegarLoop]: Abstraction has 43012 states and 175408 transitions. [2021-06-05 09:58:36,533 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 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 09:58:36,533 INFO L276 IsEmpty]: Start isEmpty. Operand 43012 states and 175408 transitions. [2021-06-05 09:58:36,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-06-05 09:58:36,595 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:58:36,595 INFO L521 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] [2021-06-05 09:58:36,595 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-05 09:58:36,595 INFO L430 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:58:36,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:58:36,595 INFO L82 PathProgramCache]: Analyzing trace with hash 522558086, now seen corresponding path program 1 times [2021-06-05 09:58:36,595 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:58:36,595 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477519871] [2021-06-05 09:58:36,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:58:36,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:58:36,651 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 09:58:36,651 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:58:36,651 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477519871] [2021-06-05 09:58:36,651 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477519871] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:58:36,651 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:58:36,651 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 09:58:36,652 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076619473] [2021-06-05 09:58:36,652 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 09:58:36,652 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:58:36,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 09:58:36,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 09:58:36,652 INFO L87 Difference]: Start difference. First operand 43012 states and 175408 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 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 09:58:37,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:58:37,028 INFO L93 Difference]: Finished difference Result 70170 states and 283050 transitions. [2021-06-05 09:58:37,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 09:58:37,028 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2021-06-05 09:58:37,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:58:37,140 INFO L225 Difference]: With dead ends: 70170 [2021-06-05 09:58:37,140 INFO L226 Difference]: Without dead ends: 44524 [2021-06-05 09:58:37,140 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 65.0ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 09:58:37,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44524 states. [2021-06-05 09:58:38,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44524 to 41500. [2021-06-05 09:58:38,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41500 states, 41499 states have (on average 3.988481650160245) internal successors, (165518), 41499 states have internal predecessors, (165518), 0 states have call successors, (0), 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 09:58:38,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41500 states to 41500 states and 165518 transitions. [2021-06-05 09:58:38,432 INFO L78 Accepts]: Start accepts. Automaton has 41500 states and 165518 transitions. Word has length 87 [2021-06-05 09:58:38,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:58:38,432 INFO L482 AbstractCegarLoop]: Abstraction has 41500 states and 165518 transitions. [2021-06-05 09:58:38,432 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 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 09:58:38,432 INFO L276 IsEmpty]: Start isEmpty. Operand 41500 states and 165518 transitions. [2021-06-05 09:58:38,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-06-05 09:58:38,491 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:58:38,491 INFO L521 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 09:58:38,491 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-05 09:58:38,491 INFO L430 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:58:38,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:58:38,491 INFO L82 PathProgramCache]: Analyzing trace with hash 2113079156, now seen corresponding path program 1 times [2021-06-05 09:58:38,491 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:58:38,491 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243055201] [2021-06-05 09:58:38,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:58:38,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:58:38,559 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 09:58:38,560 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:58:38,560 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243055201] [2021-06-05 09:58:38,560 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243055201] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:58:38,560 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:58:38,560 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 09:58:38,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524237612] [2021-06-05 09:58:38,560 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 09:58:38,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:58:38,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 09:58:38,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 09:58:38,561 INFO L87 Difference]: Start difference. First operand 41500 states and 165518 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 09:58:39,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:58:39,180 INFO L93 Difference]: Finished difference Result 36604 states and 142772 transitions. [2021-06-05 09:58:39,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 09:58:39,181 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 09:58:39,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:58:39,253 INFO L225 Difference]: With dead ends: 36604 [2021-06-05 09:58:39,253 INFO L226 Difference]: Without dead ends: 26344 [2021-06-05 09:58:39,254 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 76.7ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-06-05 09:58:39,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26344 states. [2021-06-05 09:58:39,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26344 to 24484. [2021-06-05 09:58:39,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24484 states, 24483 states have (on average 3.8620675570804233) internal successors, (94555), 24483 states have internal predecessors, (94555), 0 states have call successors, (0), 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 09:58:39,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24484 states to 24484 states and 94555 transitions. [2021-06-05 09:58:39,722 INFO L78 Accepts]: Start accepts. Automaton has 24484 states and 94555 transitions. Word has length 88 [2021-06-05 09:58:39,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:58:39,722 INFO L482 AbstractCegarLoop]: Abstraction has 24484 states and 94555 transitions. [2021-06-05 09:58:39,722 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 09:58:39,722 INFO L276 IsEmpty]: Start isEmpty. Operand 24484 states and 94555 transitions. [2021-06-05 09:58:39,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-06-05 09:58:39,763 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:58:39,763 INFO L521 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] [2021-06-05 09:58:39,763 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-05 09:58:39,763 INFO L430 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:58:39,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:58:39,764 INFO L82 PathProgramCache]: Analyzing trace with hash -471331336, now seen corresponding path program 1 times [2021-06-05 09:58:39,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:58:39,764 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823542269] [2021-06-05 09:58:39,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:58:39,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:58:39,843 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 09:58:39,843 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:58:39,843 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823542269] [2021-06-05 09:58:39,845 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823542269] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:58:39,845 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:58:39,845 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 09:58:39,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251899046] [2021-06-05 09:58:39,845 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 09:58:39,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:58:39,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 09:58:39,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-05 09:58:39,846 INFO L87 Difference]: Start difference. First operand 24484 states and 94555 transitions. Second operand has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 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 09:58:40,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:58:40,052 INFO L93 Difference]: Finished difference Result 20920 states and 80218 transitions. [2021-06-05 09:58:40,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 09:58:40,052 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2021-06-05 09:58:40,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:58:40,080 INFO L225 Difference]: With dead ends: 20920 [2021-06-05 09:58:40,080 INFO L226 Difference]: Without dead ends: 12370 [2021-06-05 09:58:40,080 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 96.3ms TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2021-06-05 09:58:40,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12370 states. [2021-06-05 09:58:40,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12370 to 9890. [2021-06-05 09:58:40,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9890 states, 9889 states have (on average 3.7816766103751642) internal successors, (37397), 9889 states have internal predecessors, (37397), 0 states have call successors, (0), 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 09:58:40,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9890 states to 9890 states and 37397 transitions. [2021-06-05 09:58:40,608 INFO L78 Accepts]: Start accepts. Automaton has 9890 states and 37397 transitions. Word has length 92 [2021-06-05 09:58:40,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:58:40,609 INFO L482 AbstractCegarLoop]: Abstraction has 9890 states and 37397 transitions. [2021-06-05 09:58:40,610 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 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 09:58:40,610 INFO L276 IsEmpty]: Start isEmpty. Operand 9890 states and 37397 transitions. [2021-06-05 09:58:40,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-06-05 09:58:40,627 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:58:40,627 INFO L521 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, 1, 1] [2021-06-05 09:58:40,627 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-05 09:58:40,627 INFO L430 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:58:40,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:58:40,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1010555787, now seen corresponding path program 1 times [2021-06-05 09:58:40,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:58:40,628 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61732845] [2021-06-05 09:58:40,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:58:40,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:58:40,710 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 09:58:40,710 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:58:40,710 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61732845] [2021-06-05 09:58:40,710 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61732845] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:58:40,710 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:58:40,710 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 09:58:40,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842242428] [2021-06-05 09:58:40,711 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 09:58:40,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:58:40,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 09:58:40,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 09:58:40,711 INFO L87 Difference]: Start difference. First operand 9890 states and 37397 transitions. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 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 09:58:40,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:58:40,815 INFO L93 Difference]: Finished difference Result 14108 states and 53577 transitions. [2021-06-05 09:58:40,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 09:58:40,815 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2021-06-05 09:58:40,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:58:40,826 INFO L225 Difference]: With dead ends: 14108 [2021-06-05 09:58:40,826 INFO L226 Difference]: Without dead ends: 5265 [2021-06-05 09:58:40,826 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 55.7ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 09:58:40,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5265 states. [2021-06-05 09:58:40,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5265 to 5265. [2021-06-05 09:58:40,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5265 states, 5264 states have (on average 3.7237841945288754) internal successors, (19602), 5264 states have internal predecessors, (19602), 0 states have call successors, (0), 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 09:58:40,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5265 states to 5265 states and 19602 transitions. [2021-06-05 09:58:40,909 INFO L78 Accepts]: Start accepts. Automaton has 5265 states and 19602 transitions. Word has length 97 [2021-06-05 09:58:40,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:58:40,910 INFO L482 AbstractCegarLoop]: Abstraction has 5265 states and 19602 transitions. [2021-06-05 09:58:40,910 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 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 09:58:40,910 INFO L276 IsEmpty]: Start isEmpty. Operand 5265 states and 19602 transitions. [2021-06-05 09:58:40,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-06-05 09:58:40,917 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:58:40,917 INFO L521 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, 1, 1] [2021-06-05 09:58:40,917 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-05 09:58:40,918 INFO L430 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:58:40,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:58:40,918 INFO L82 PathProgramCache]: Analyzing trace with hash -532793765, now seen corresponding path program 2 times [2021-06-05 09:58:40,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:58:40,918 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419267274] [2021-06-05 09:58:40,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:58:40,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:58:41,094 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 09:58:41,094 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:58:41,094 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419267274] [2021-06-05 09:58:41,094 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419267274] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:58:41,094 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:58:41,094 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-06-05 09:58:41,094 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564090609] [2021-06-05 09:58:41,095 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 09:58:41,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:58:41,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 09:58:41,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2021-06-05 09:58:41,096 INFO L87 Difference]: Start difference. First operand 5265 states and 19602 transitions. Second operand has 14 states, 14 states have (on average 6.928571428571429) internal successors, (97), 14 states have internal predecessors, (97), 0 states have call successors, (0), 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 09:58:41,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:58:41,305 INFO L93 Difference]: Finished difference Result 7875 states and 29502 transitions. [2021-06-05 09:58:41,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 09:58:41,305 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.928571428571429) internal successors, (97), 14 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2021-06-05 09:58:41,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:58:41,316 INFO L225 Difference]: With dead ends: 7875 [2021-06-05 09:58:41,316 INFO L226 Difference]: Without dead ends: 5393 [2021-06-05 09:58:41,317 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 163.5ms TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2021-06-05 09:58:41,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5393 states. [2021-06-05 09:58:41,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5393 to 4793. [2021-06-05 09:58:41,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4793 states, 4792 states have (on average 3.760016694490818) internal successors, (18018), 4792 states have internal predecessors, (18018), 0 states have call successors, (0), 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 09:58:41,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4793 states to 4793 states and 18018 transitions. [2021-06-05 09:58:41,399 INFO L78 Accepts]: Start accepts. Automaton has 4793 states and 18018 transitions. Word has length 97 [2021-06-05 09:58:41,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:58:41,399 INFO L482 AbstractCegarLoop]: Abstraction has 4793 states and 18018 transitions. [2021-06-05 09:58:41,400 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 6.928571428571429) internal successors, (97), 14 states have internal predecessors, (97), 0 states have call successors, (0), 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 09:58:41,400 INFO L276 IsEmpty]: Start isEmpty. Operand 4793 states and 18018 transitions. [2021-06-05 09:58:41,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-06-05 09:58:41,407 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:58:41,407 INFO L521 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, 1, 1] [2021-06-05 09:58:41,407 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-05 09:58:41,407 INFO L430 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:58:41,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:58:41,407 INFO L82 PathProgramCache]: Analyzing trace with hash 2127511041, now seen corresponding path program 3 times [2021-06-05 09:58:41,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:58:41,407 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526605418] [2021-06-05 09:58:41,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:58:41,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 09:58:41,439 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 09:58:41,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 09:58:41,478 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 09:58:41,520 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 09:58:41,520 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 09:58:41,521 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-05 09:58:41,523 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-05 09:58:41,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 09:58:41 BasicIcfg [2021-06-05 09:58:41,644 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 09:58:41,645 INFO L168 Benchmark]: Toolchain (without parser) took 71457.35 ms. Allocated memory was 343.9 MB in the beginning and 15.3 GB in the end (delta: 14.9 GB). Free memory was 306.1 MB in the beginning and 7.8 GB in the end (delta: -7.5 GB). Peak memory consumption was 7.4 GB. Max. memory is 16.0 GB. [2021-06-05 09:58:41,645 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 343.9 MB. Free memory is still 324.5 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 09:58:41,645 INFO L168 Benchmark]: CACSL2BoogieTranslator took 459.78 ms. Allocated memory is still 343.9 MB. Free memory was 305.9 MB in the beginning and 301.4 MB in the end (delta: 4.6 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.0 GB. [2021-06-05 09:58:41,645 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.83 ms. Allocated memory is still 343.9 MB. Free memory was 301.4 MB in the beginning and 299.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 09:58:41,646 INFO L168 Benchmark]: Boogie Preprocessor took 39.39 ms. Allocated memory is still 343.9 MB. Free memory was 299.3 MB in the beginning and 296.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-06-05 09:58:41,646 INFO L168 Benchmark]: RCFGBuilder took 1488.74 ms. Allocated memory is still 343.9 MB. Free memory was 296.1 MB in the beginning and 231.9 MB in the end (delta: 64.2 MB). Peak memory consumption was 139.7 MB. Max. memory is 16.0 GB. [2021-06-05 09:58:41,646 INFO L168 Benchmark]: TraceAbstraction took 69427.48 ms. Allocated memory was 343.9 MB in the beginning and 15.3 GB in the end (delta: 14.9 GB). Free memory was 230.9 MB in the beginning and 7.8 GB in the end (delta: -7.6 GB). Peak memory consumption was 7.3 GB. Max. memory is 16.0 GB. [2021-06-05 09:58:41,650 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09 ms. Allocated memory is still 343.9 MB. Free memory is still 324.5 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 459.78 ms. Allocated memory is still 343.9 MB. Free memory was 305.9 MB in the beginning and 301.4 MB in the end (delta: 4.6 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 35.83 ms. Allocated memory is still 343.9 MB. Free memory was 301.4 MB in the beginning and 299.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 39.39 ms. Allocated memory is still 343.9 MB. Free memory was 299.3 MB in the beginning and 296.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1488.74 ms. Allocated memory is still 343.9 MB. Free memory was 296.1 MB in the beginning and 231.9 MB in the end (delta: 64.2 MB). Peak memory consumption was 139.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 69427.48 ms. Allocated memory was 343.9 MB in the beginning and 15.3 GB in the end (delta: 14.9 GB). Free memory was 230.9 MB in the beginning and 7.8 GB in the end (delta: -7.6 GB). Peak memory consumption was 7.3 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L714] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0] [L716] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0] [L717] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0] [L718] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L720] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L722] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L723] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L724] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L725] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L726] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L727] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L728] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L729] 0 _Bool y$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0] [L730] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0] [L731] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L732] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L733] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L734] 0 _Bool y$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0] [L735] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0] [L736] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L737] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L738] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L739] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L740] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L742] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L743] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L744] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L841] 0 pthread_t t1433; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L842] FCALL, FORK 0 pthread_create(&t1433, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L843] 0 pthread_t t1434; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t1434, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L845] 0 pthread_t t1435; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L846] FCALL, FORK 0 pthread_create(&t1435, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L847] 0 pthread_t t1436; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L783] 3 y$w_buff1 = y$w_buff0 [L784] 3 y$w_buff0 = 2 [L785] 3 y$w_buff1_used = y$w_buff0_used [L786] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L788] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L789] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L790] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L791] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L792] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L793] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L796] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L848] FCALL, FORK 0 pthread_create(&t1436, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L819] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L819] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L819] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L819] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L820] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L820] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L821] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L821] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L822] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L822] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L823] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L823] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L826] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 a = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L751] 1 x = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L763] 2 x = 2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L773] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L776] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L799] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L800] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L800] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L801] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L802] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L803] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L806] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=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=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=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=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L854] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L854] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L854] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L854] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L855] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L856] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L856] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L857] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L857] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L858] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L861] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L862] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L863] 0 y$flush_delayed = weak$$choice2 [L864] 0 y$mem_tmp = y [L865] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L865] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L866] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L866] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L867] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L867] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L868] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L868] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L869] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L869] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L870] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L870] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L871] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L871] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L873] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L873] 0 y = y$flush_delayed ? y$mem_tmp : y [L874] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=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=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=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=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=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=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 161 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 69202.8ms, OverallIterations: 19, TraceHistogramMax: 1, EmptinessCheckTime: 1221.9ms, AutomataDifference: 17300.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 21189.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 3447 SDtfs, 5828 SDslu, 14674 SDs, 0 SdLazy, 1912 SolverSat, 407 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1935.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 270 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 2263.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=120940occurred in iteration=0, InterpolantAutomatonStates: 200, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 26616.1ms AutomataMinimizationTime, 18 MinimizatonAttempts, 53072 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 52.1ms SsaConstructionTime, 548.3ms SatisfiabilityAnalysisTime, 1969.9ms InterpolantComputationTime, 1610 NumberOfCodeBlocks, 1610 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1495 ConstructedInterpolants, 0 QuantifiedInterpolants, 8759 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 RESULT: Ultimate proved your program to be incorrect! Received shutdown request...