/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/mix057_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-29289db [2021-06-05 09:59:41,273 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 09:59:41,274 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 09:59:41,297 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 09:59:41,297 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 09:59:41,300 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 09:59:41,304 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 09:59:41,309 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 09:59:41,311 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 09:59:41,315 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 09:59:41,316 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 09:59:41,316 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 09:59:41,317 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 09:59:41,317 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 09:59:41,318 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 09:59:41,319 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 09:59:41,319 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 09:59:41,320 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 09:59:41,321 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 09:59:41,322 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 09:59:41,323 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 09:59:41,326 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 09:59:41,327 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 09:59:41,329 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 09:59:41,340 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 09:59:41,340 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 09:59:41,340 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 09:59:41,341 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 09:59:41,341 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 09:59:41,342 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 09:59:41,342 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 09:59:41,343 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 09:59:41,343 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 09:59:41,344 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 09:59:41,345 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 09:59:41,345 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 09:59:41,361 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 09:59:41,361 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 09:59:41,361 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 09:59:41,362 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 09:59:41,362 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 09:59:41,363 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:59:41,384 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 09:59:41,384 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 09:59:41,384 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 09:59:41,384 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 09:59:41,385 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 09:59:41,385 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 09:59:41,386 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 09:59:41,386 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 09:59:41,386 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 09:59:41,386 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 09:59:41,386 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 09:59:41,386 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 09:59:41,386 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 09:59:41,386 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 09:59:41,387 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 09:59:41,387 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 09:59:41,387 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 09:59:41,387 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 09:59:41,387 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 09:59:41,387 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 09:59:41,387 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 09:59:41,387 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 09:59:41,387 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 09:59:41,388 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 09:59:41,388 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 09:59:41,388 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 09:59:41,388 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 09:59:41,388 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 09:59:41,389 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 09:59:41,389 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 09:59:41,390 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 09:59:41,390 INFO L138 SettingsManager]: * Check the insufficient thread errors last=true [2021-06-05 09:59:41,390 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:59:41,682 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 09:59:41,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 09:59:41,701 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 09:59:41,703 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-05 09:59:41,704 INFO L275 PluginConnector]: CDTParser initialized [2021-06-05 09:59:41,704 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix057_pso.opt.i [2021-06-05 09:59:41,774 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b30ea08b8/c3d6810efc714db9a4be6f9f58b65fce/FLAGdff6c309f [2021-06-05 09:59:42,348 INFO L306 CDTParser]: Found 1 translation units. [2021-06-05 09:59:42,349 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_pso.opt.i [2021-06-05 09:59:42,362 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b30ea08b8/c3d6810efc714db9a4be6f9f58b65fce/FLAGdff6c309f [2021-06-05 09:59:42,761 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b30ea08b8/c3d6810efc714db9a4be6f9f58b65fce [2021-06-05 09:59:42,764 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 09:59:42,765 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-05 09:59:42,769 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-05 09:59:42,770 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-05 09:59:42,773 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-05 09:59:42,773 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 09:59:42" (1/1) ... [2021-06-05 09:59:42,774 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ccbb162 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:59:42, skipping insertion in model container [2021-06-05 09:59:42,774 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 09:59:42" (1/1) ... [2021-06-05 09:59:42,781 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-05 09:59:42,821 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-05 09:59:43,001 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_pso.opt.i[948,961] [2021-06-05 09:59:43,217 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 09:59:43,223 INFO L203 MainTranslator]: Completed pre-run [2021-06-05 09:59:43,235 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_pso.opt.i[948,961] [2021-06-05 09:59:43,296 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 09:59:43,369 INFO L208 MainTranslator]: Completed translation [2021-06-05 09:59:43,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:59:43 WrapperNode [2021-06-05 09:59:43,370 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-05 09:59:43,371 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 09:59:43,371 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 09:59:43,371 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 09:59:43,377 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:59:43" (1/1) ... [2021-06-05 09:59:43,410 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:59:43" (1/1) ... [2021-06-05 09:59:43,450 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 09:59:43,451 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 09:59:43,451 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 09:59:43,451 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 09:59:43,458 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:59:43" (1/1) ... [2021-06-05 09:59:43,458 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:59:43" (1/1) ... [2021-06-05 09:59:43,475 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:59:43" (1/1) ... [2021-06-05 09:59:43,475 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:59:43" (1/1) ... [2021-06-05 09:59:43,482 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:59:43" (1/1) ... [2021-06-05 09:59:43,485 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:59:43" (1/1) ... [2021-06-05 09:59:43,487 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:59:43" (1/1) ... [2021-06-05 09:59:43,507 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 09:59:43,508 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 09:59:43,509 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 09:59:43,509 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 09:59:43,509 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:59:43" (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:59:43,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-05 09:59:43,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-05 09:59:43,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-05 09:59:43,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-05 09:59:43,586 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-05 09:59:43,586 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-05 09:59:43,586 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-05 09:59:43,586 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-05 09:59:43,586 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-05 09:59:43,586 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-05 09:59:43,586 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-06-05 09:59:43,587 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-06-05 09:59:43,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-05 09:59:43,587 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-05 09:59:43,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 09:59:43,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 09:59:43,589 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:59:45,282 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 09:59:45,283 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-05 09:59:45,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 09:59:45 BoogieIcfgContainer [2021-06-05 09:59:45,285 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 09:59:45,286 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 09:59:45,286 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 09:59:45,289 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 09:59:45,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.06 09:59:42" (1/3) ... [2021-06-05 09:59:45,290 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78692387 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 09:59:45, skipping insertion in model container [2021-06-05 09:59:45,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:59:43" (2/3) ... [2021-06-05 09:59:45,290 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78692387 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 09:59:45, skipping insertion in model container [2021-06-05 09:59:45,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 09:59:45" (3/3) ... [2021-06-05 09:59:45,292 INFO L111 eAbstractionObserver]: Analyzing ICFG mix057_pso.opt.i [2021-06-05 09:59:45,297 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 09:59:45,298 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 09:59:45,298 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-05 09:59:45,298 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 09:59:45,330 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,330 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,330 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,331 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,331 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,331 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,331 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,331 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,331 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,332 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,332 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,332 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,332 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,332 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,332 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,332 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,332 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,333 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,333 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,333 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,334 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,334 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,334 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,334 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,335 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,335 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,335 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,335 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,335 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,336 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,336 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,336 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,336 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,336 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,336 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,336 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,336 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,336 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,337 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,337 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,337 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,337 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,337 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,337 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,338 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,338 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,338 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,338 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,338 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,338 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,339 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,339 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,339 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,339 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,340 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,340 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,340 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,340 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,340 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,340 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,340 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,340 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,341 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,341 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,341 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,341 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,341 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,341 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,341 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,341 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,342 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,342 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,342 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,342 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,342 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,342 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,342 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,343 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,343 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,343 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,344 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,345 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,345 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,345 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,346 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,347 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,347 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,347 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,347 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,348 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,348 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,348 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,349 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,350 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,352 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,352 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,354 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,361 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,362 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,364 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,364 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,364 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,364 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,364 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,364 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,364 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,364 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,364 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,366 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,366 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,366 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,366 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:59:45,367 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 09:59:45,387 INFO L255 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-06-05 09:59:45,416 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 09:59:45,416 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 09:59:45,417 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 09:59:45,417 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 09:59:45,417 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 09:59:45,417 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 09:59:45,417 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 09:59:45,417 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 09:59:45,430 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 135 places, 124 transitions, 268 flow [2021-06-05 10:00:02,865 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 105490 states, 105486 states have (on average 4.4803291432038375) internal successors, (472612), 105489 states have internal predecessors, (472612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:00:03,186 INFO L276 IsEmpty]: Start isEmpty. Operand has 105490 states, 105486 states have (on average 4.4803291432038375) internal successors, (472612), 105489 states have internal predecessors, (472612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:00:03,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-06-05 10:00:03,252 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:00:03,252 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] [2021-06-05 10:00:03,253 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:00:03,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:00:03,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1183912701, now seen corresponding path program 1 times [2021-06-05 10:00:03,271 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:00:03,272 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608313448] [2021-06-05 10:00:03,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:00:03,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:00:03,624 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 10:00:03,625 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:00:03,625 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608313448] [2021-06-05 10:00:03,626 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608313448] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:00:03,626 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:00:03,626 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 10:00:03,627 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130931618] [2021-06-05 10:00:03,630 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 10:00:03,630 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:00:03,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 10:00:03,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 10:00:03,825 INFO L87 Difference]: Start difference. First operand has 105490 states, 105486 states have (on average 4.4803291432038375) internal successors, (472612), 105489 states have internal predecessors, (472612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 32.5) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:00:05,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:00:05,518 INFO L93 Difference]: Finished difference Result 90986 states and 399777 transitions. [2021-06-05 10:00:05,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 10:00:05,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 32.5) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-06-05 10:00:05,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:00:06,068 INFO L225 Difference]: With dead ends: 90986 [2021-06-05 10:00:06,068 INFO L226 Difference]: Without dead ends: 50218 [2021-06-05 10:00:06,069 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 10:00:06,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50218 states. [2021-06-05 10:00:08,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50218 to 50218. [2021-06-05 10:00:08,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50218 states, 50217 states have (on average 4.336718641097637) internal successors, (217777), 50217 states have internal predecessors, (217777), 0 states have call successors, (0), 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 10:00:09,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50218 states to 50218 states and 217777 transitions. [2021-06-05 10:00:09,137 INFO L78 Accepts]: Start accepts. Automaton has 50218 states and 217777 transitions. Word has length 65 [2021-06-05 10:00:09,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:00:09,141 INFO L482 AbstractCegarLoop]: Abstraction has 50218 states and 217777 transitions. [2021-06-05 10:00:09,141 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 32.5) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:00:09,142 INFO L276 IsEmpty]: Start isEmpty. Operand 50218 states and 217777 transitions. [2021-06-05 10:00:09,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-06-05 10:00:09,198 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:00:09,198 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] [2021-06-05 10:00:09,198 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 10:00:09,199 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:00:09,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:00:09,201 INFO L82 PathProgramCache]: Analyzing trace with hash -715615938, now seen corresponding path program 1 times [2021-06-05 10:00:09,202 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:00:09,202 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453534472] [2021-06-05 10:00:09,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:00:09,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:00:09,473 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 10:00:09,473 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:00:09,473 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453534472] [2021-06-05 10:00:09,473 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453534472] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:00:09,474 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:00:09,474 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 10:00:09,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205722550] [2021-06-05 10:00:09,476 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 10:00:09,476 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:00:09,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 10:00:09,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 10:00:09,478 INFO L87 Difference]: Start difference. First operand 50218 states and 217777 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:00:10,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:00:10,368 INFO L93 Difference]: Finished difference Result 60746 states and 261437 transitions. [2021-06-05 10:00:10,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 10:00:10,369 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2021-06-05 10:00:10,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:00:10,577 INFO L225 Difference]: With dead ends: 60746 [2021-06-05 10:00:10,577 INFO L226 Difference]: Without dead ends: 48202 [2021-06-05 10:00:10,578 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 89.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 10:00:11,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48202 states. [2021-06-05 10:00:12,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48202 to 48202. [2021-06-05 10:00:12,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48202 states, 48201 states have (on average 4.320180079251468) internal successors, (208237), 48201 states have internal predecessors, (208237), 0 states have call successors, (0), 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 10:00:12,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48202 states to 48202 states and 208237 transitions. [2021-06-05 10:00:12,901 INFO L78 Accepts]: Start accepts. Automaton has 48202 states and 208237 transitions. Word has length 77 [2021-06-05 10:00:12,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:00:12,903 INFO L482 AbstractCegarLoop]: Abstraction has 48202 states and 208237 transitions. [2021-06-05 10:00:12,903 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:00:12,904 INFO L276 IsEmpty]: Start isEmpty. Operand 48202 states and 208237 transitions. [2021-06-05 10:00:12,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-06-05 10:00:12,993 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:00:12,993 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] [2021-06-05 10:00:12,993 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 10:00:12,994 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:00:12,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:00:12,994 INFO L82 PathProgramCache]: Analyzing trace with hash 114274397, now seen corresponding path program 1 times [2021-06-05 10:00:12,995 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:00:12,995 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351554696] [2021-06-05 10:00:12,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:00:13,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:00:13,228 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 10:00:13,228 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:00:13,228 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351554696] [2021-06-05 10:00:13,228 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351554696] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:00:13,228 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:00:13,229 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 10:00:13,229 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64371379] [2021-06-05 10:00:13,229 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 10:00:13,229 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:00:13,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 10:00:13,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 10:00:13,230 INFO L87 Difference]: Start difference. First operand 48202 states and 208237 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:00:13,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:00:13,737 INFO L93 Difference]: Finished difference Result 55882 states and 239645 transitions. [2021-06-05 10:00:13,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 10:00:13,738 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2021-06-05 10:00:13,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:00:14,443 INFO L225 Difference]: With dead ends: 55882 [2021-06-05 10:00:14,444 INFO L226 Difference]: Without dead ends: 46474 [2021-06-05 10:00:14,444 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 93.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 10:00:14,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46474 states. [2021-06-05 10:00:15,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46474 to 46474. [2021-06-05 10:00:15,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46474 states, 46473 states have (on average 4.305747423234997) internal successors, (200101), 46473 states have internal predecessors, (200101), 0 states have call successors, (0), 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 10:00:15,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46474 states to 46474 states and 200101 transitions. [2021-06-05 10:00:15,922 INFO L78 Accepts]: Start accepts. Automaton has 46474 states and 200101 transitions. Word has length 79 [2021-06-05 10:00:15,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:00:15,923 INFO L482 AbstractCegarLoop]: Abstraction has 46474 states and 200101 transitions. [2021-06-05 10:00:15,923 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:00:15,923 INFO L276 IsEmpty]: Start isEmpty. Operand 46474 states and 200101 transitions. [2021-06-05 10:00:15,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-05 10:00:15,979 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:00:15,979 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] [2021-06-05 10:00:15,979 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 10:00:15,980 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:00:15,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:00:15,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1940160349, now seen corresponding path program 1 times [2021-06-05 10:00:15,980 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:00:15,981 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664123371] [2021-06-05 10:00:15,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:00:16,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:00:16,720 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 10:00:16,720 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:00:16,720 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664123371] [2021-06-05 10:00:16,721 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664123371] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:00:16,721 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:00:16,721 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 10:00:16,721 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888417360] [2021-06-05 10:00:16,722 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 10:00:16,722 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:00:16,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 10:00:16,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-06-05 10:00:16,723 INFO L87 Difference]: Start difference. First operand 46474 states and 200101 transitions. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:00:17,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:00:17,340 INFO L93 Difference]: Finished difference Result 54146 states and 231185 transitions. [2021-06-05 10:00:17,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 10:00:17,341 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-06-05 10:00:17,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:00:17,485 INFO L225 Difference]: With dead ends: 54146 [2021-06-05 10:00:17,486 INFO L226 Difference]: Without dead ends: 44098 [2021-06-05 10:00:17,486 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 285.9ms TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2021-06-05 10:00:18,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44098 states. [2021-06-05 10:00:19,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44098 to 44098. [2021-06-05 10:00:19,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44098 states, 44097 states have (on average 4.287933419506996) internal successors, (189085), 44097 states have internal predecessors, (189085), 0 states have call successors, (0), 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 10:00:19,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44098 states to 44098 states and 189085 transitions. [2021-06-05 10:00:19,647 INFO L78 Accepts]: Start accepts. Automaton has 44098 states and 189085 transitions. Word has length 80 [2021-06-05 10:00:19,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:00:19,647 INFO L482 AbstractCegarLoop]: Abstraction has 44098 states and 189085 transitions. [2021-06-05 10:00:19,648 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:00:19,648 INFO L276 IsEmpty]: Start isEmpty. Operand 44098 states and 189085 transitions. [2021-06-05 10:00:19,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-06-05 10:00:19,708 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:00:19,708 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 10:00:19,708 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-05 10:00:19,708 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:00:19,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:00:19,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1733770590, now seen corresponding path program 1 times [2021-06-05 10:00:19,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:00:19,709 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502496577] [2021-06-05 10:00:19,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:00:19,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:00:19,925 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 10:00:19,925 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:00:19,926 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502496577] [2021-06-05 10:00:19,926 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502496577] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:00:19,926 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:00:19,927 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 10:00:19,927 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357881644] [2021-06-05 10:00:19,927 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 10:00:19,927 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:00:19,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 10:00:19,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-06-05 10:00:19,929 INFO L87 Difference]: Start difference. First operand 44098 states and 189085 transitions. Second operand has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 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 10:00:20,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:00:20,928 INFO L93 Difference]: Finished difference Result 48398 states and 206175 transitions. [2021-06-05 10:00:20,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 10:00:20,945 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 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 10:00:20,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:00:21,170 INFO L225 Difference]: With dead ends: 48398 [2021-06-05 10:00:21,171 INFO L226 Difference]: Without dead ends: 41518 [2021-06-05 10:00:21,171 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 259.3ms TimeCoverageRelationStatistics Valid=131, Invalid=249, Unknown=0, NotChecked=0, Total=380 [2021-06-05 10:00:21,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41518 states. [2021-06-05 10:00:22,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41518 to 41518. [2021-06-05 10:00:22,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41518 states, 41517 states have (on average 4.276344629910639) internal successors, (177541), 41517 states have internal predecessors, (177541), 0 states have call successors, (0), 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 10:00:22,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41518 states to 41518 states and 177541 transitions. [2021-06-05 10:00:22,360 INFO L78 Accepts]: Start accepts. Automaton has 41518 states and 177541 transitions. Word has length 82 [2021-06-05 10:00:22,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:00:22,361 INFO L482 AbstractCegarLoop]: Abstraction has 41518 states and 177541 transitions. [2021-06-05 10:00:22,361 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 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 10:00:22,361 INFO L276 IsEmpty]: Start isEmpty. Operand 41518 states and 177541 transitions. [2021-06-05 10:00:22,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-06-05 10:00:22,423 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:00:22,423 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 10:00:22,423 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-05 10:00:22,423 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:00:22,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:00:22,424 INFO L82 PathProgramCache]: Analyzing trace with hash 386345024, now seen corresponding path program 1 times [2021-06-05 10:00:22,424 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:00:22,424 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719100024] [2021-06-05 10:00:22,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:00:22,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:00:22,525 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 10:00:22,525 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:00:22,525 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719100024] [2021-06-05 10:00:22,525 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719100024] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:00:22,526 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:00:22,526 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 10:00:22,526 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962731655] [2021-06-05 10:00:22,526 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 10:00:22,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:00:22,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 10:00:22,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 10:00:22,527 INFO L87 Difference]: Start difference. First operand 41518 states and 177541 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 10:00:23,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:00:23,379 INFO L93 Difference]: Finished difference Result 66550 states and 280631 transitions. [2021-06-05 10:00:23,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 10:00:23,380 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 10:00:23,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:00:23,543 INFO L225 Difference]: With dead ends: 66550 [2021-06-05 10:00:23,544 INFO L226 Difference]: Without dead ends: 45886 [2021-06-05 10:00:23,544 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 88.1ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 10:00:23,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45886 states. [2021-06-05 10:00:24,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45886 to 40174. [2021-06-05 10:00:24,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40174 states, 40173 states have (on average 4.1910487143106065) internal successors, (168367), 40173 states have internal predecessors, (168367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:00:25,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40174 states to 40174 states and 168367 transitions. [2021-06-05 10:00:25,051 INFO L78 Accepts]: Start accepts. Automaton has 40174 states and 168367 transitions. Word has length 84 [2021-06-05 10:00:25,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:00:25,051 INFO L482 AbstractCegarLoop]: Abstraction has 40174 states and 168367 transitions. [2021-06-05 10:00:25,051 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 10:00:25,051 INFO L276 IsEmpty]: Start isEmpty. Operand 40174 states and 168367 transitions. [2021-06-05 10:00:25,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-06-05 10:00:25,126 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:00:25,127 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 10:00:25,127 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-05 10:00:25,127 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:00:25,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:00:25,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1561535612, now seen corresponding path program 1 times [2021-06-05 10:00:25,128 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:00:25,128 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030439531] [2021-06-05 10:00:25,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:00:25,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:00:25,267 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 10:00:25,267 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:00:25,267 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030439531] [2021-06-05 10:00:25,267 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030439531] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:00:25,267 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:00:25,267 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 10:00:25,267 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271926826] [2021-06-05 10:00:25,268 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 10:00:25,268 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:00:25,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 10:00:25,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-06-05 10:00:25,268 INFO L87 Difference]: Start difference. First operand 40174 states and 168367 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:00:25,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:00:25,728 INFO L93 Difference]: Finished difference Result 48302 states and 201844 transitions. [2021-06-05 10:00:25,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 10:00:25,728 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-06-05 10:00:25,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:00:26,350 INFO L225 Difference]: With dead ends: 48302 [2021-06-05 10:00:26,350 INFO L226 Difference]: Without dead ends: 42454 [2021-06-05 10:00:26,350 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 135.0ms TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2021-06-05 10:00:26,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42454 states. [2021-06-05 10:00:27,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42454 to 41422. [2021-06-05 10:00:27,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41422 states, 41421 states have (on average 4.185847758383429) internal successors, (173382), 41421 states have internal predecessors, (173382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:00:27,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41422 states to 41422 states and 173382 transitions. [2021-06-05 10:00:27,892 INFO L78 Accepts]: Start accepts. Automaton has 41422 states and 173382 transitions. Word has length 84 [2021-06-05 10:00:27,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:00:27,892 INFO L482 AbstractCegarLoop]: Abstraction has 41422 states and 173382 transitions. [2021-06-05 10:00:27,893 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:00:27,893 INFO L276 IsEmpty]: Start isEmpty. Operand 41422 states and 173382 transitions. [2021-06-05 10:00:27,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-06-05 10:00:27,958 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:00:27,958 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 10:00:27,958 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-05 10:00:27,958 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:00:27,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:00:27,959 INFO L82 PathProgramCache]: Analyzing trace with hash -307423747, now seen corresponding path program 1 times [2021-06-05 10:00:27,959 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:00:27,959 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050623239] [2021-06-05 10:00:27,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:00:27,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:00:28,152 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 10:00:28,153 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:00:28,153 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050623239] [2021-06-05 10:00:28,153 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050623239] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:00:28,153 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:00:28,153 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-05 10:00:28,153 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621112134] [2021-06-05 10:00:28,153 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 10:00:28,154 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:00:28,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 10:00:28,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2021-06-05 10:00:28,154 INFO L87 Difference]: Start difference. First operand 41422 states and 173382 transitions. Second operand has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 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 10:00:28,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:00:28,625 INFO L93 Difference]: Finished difference Result 50058 states and 209408 transitions. [2021-06-05 10:00:28,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 10:00:28,625 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 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 10:00:28,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:00:28,755 INFO L225 Difference]: With dead ends: 50058 [2021-06-05 10:00:28,755 INFO L226 Difference]: Without dead ends: 45930 [2021-06-05 10:00:28,755 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 178.3ms TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2021-06-05 10:00:29,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45930 states. [2021-06-05 10:00:30,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45930 to 44950. [2021-06-05 10:00:30,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44950 states, 44949 states have (on average 4.187768359696545) internal successors, (188236), 44949 states have internal predecessors, (188236), 0 states have call successors, (0), 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 10:00:30,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44950 states to 44950 states and 188236 transitions. [2021-06-05 10:00:30,786 INFO L78 Accepts]: Start accepts. Automaton has 44950 states and 188236 transitions. Word has length 85 [2021-06-05 10:00:30,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:00:30,787 INFO L482 AbstractCegarLoop]: Abstraction has 44950 states and 188236 transitions. [2021-06-05 10:00:30,787 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 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 10:00:30,787 INFO L276 IsEmpty]: Start isEmpty. Operand 44950 states and 188236 transitions. [2021-06-05 10:00:30,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-06-05 10:00:30,882 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:00:30,882 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 10:00:30,882 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-05 10:00:30,883 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:00:30,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:00:30,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1750242831, now seen corresponding path program 2 times [2021-06-05 10:00:30,883 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:00:30,884 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581458466] [2021-06-05 10:00:30,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:00:30,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:00:31,203 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 10:00:31,203 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:00:31,204 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581458466] [2021-06-05 10:00:31,204 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581458466] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:00:31,204 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:00:31,204 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-06-05 10:00:31,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128199628] [2021-06-05 10:00:31,204 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 10:00:31,204 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:00:31,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 10:00:31,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2021-06-05 10:00:31,205 INFO L87 Difference]: Start difference. First operand 44950 states and 188236 transitions. Second operand has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 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 10:00:31,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:00:31,794 INFO L93 Difference]: Finished difference Result 53488 states and 223912 transitions. [2021-06-05 10:00:31,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 10:00:31,795 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 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 10:00:31,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:00:31,963 INFO L225 Difference]: With dead ends: 53488 [2021-06-05 10:00:31,963 INFO L226 Difference]: Without dead ends: 49360 [2021-06-05 10:00:31,963 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 267.4ms TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2021-06-05 10:00:32,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49360 states. [2021-06-05 10:00:33,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49360 to 45832. [2021-06-05 10:00:33,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45832 states, 45831 states have (on average 4.193013462503545) internal successors, (192170), 45831 states have internal predecessors, (192170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:00:33,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45832 states to 45832 states and 192170 transitions. [2021-06-05 10:00:33,423 INFO L78 Accepts]: Start accepts. Automaton has 45832 states and 192170 transitions. Word has length 85 [2021-06-05 10:00:33,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:00:33,423 INFO L482 AbstractCegarLoop]: Abstraction has 45832 states and 192170 transitions. [2021-06-05 10:00:33,423 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 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 10:00:33,423 INFO L276 IsEmpty]: Start isEmpty. Operand 45832 states and 192170 transitions. [2021-06-05 10:00:33,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-06-05 10:00:33,504 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:00:33,504 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 10:00:33,504 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-05 10:00:33,504 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:00:33,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:00:33,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1156020575, now seen corresponding path program 1 times [2021-06-05 10:00:33,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:00:33,505 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892052168] [2021-06-05 10:00:33,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:00:33,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:00:33,605 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 10:00:33,606 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:00:33,606 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892052168] [2021-06-05 10:00:33,606 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892052168] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:00:33,606 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:00:33,606 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 10:00:33,606 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677966102] [2021-06-05 10:00:33,606 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 10:00:33,606 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:00:33,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 10:00:33,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 10:00:33,607 INFO L87 Difference]: Start difference. First operand 45832 states and 192170 transitions. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:00:34,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:00:34,603 INFO L93 Difference]: Finished difference Result 57940 states and 240020 transitions. [2021-06-05 10:00:34,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 10:00:34,604 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-06-05 10:00:34,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:00:34,723 INFO L225 Difference]: With dead ends: 57940 [2021-06-05 10:00:34,723 INFO L226 Difference]: Without dead ends: 42652 [2021-06-05 10:00:34,723 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 108.7ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 10:00:34,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42652 states. [2021-06-05 10:00:35,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42652 to 42652. [2021-06-05 10:00:35,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42652 states, 42651 states have (on average 4.144099786640407) internal successors, (176750), 42651 states have internal predecessors, (176750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:00:36,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42652 states to 42652 states and 176750 transitions. [2021-06-05 10:00:36,071 INFO L78 Accepts]: Start accepts. Automaton has 42652 states and 176750 transitions. Word has length 85 [2021-06-05 10:00:36,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:00:36,071 INFO L482 AbstractCegarLoop]: Abstraction has 42652 states and 176750 transitions. [2021-06-05 10:00:36,071 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:00:36,071 INFO L276 IsEmpty]: Start isEmpty. Operand 42652 states and 176750 transitions. [2021-06-05 10:00:36,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-05 10:00:36,142 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:00:36,142 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] [2021-06-05 10:00:36,142 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-05 10:00:36,142 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:00:36,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:00:36,143 INFO L82 PathProgramCache]: Analyzing trace with hash -262332207, now seen corresponding path program 1 times [2021-06-05 10:00:36,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:00:36,143 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517797283] [2021-06-05 10:00:36,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:00:36,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:00:36,235 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 10:00:36,236 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:00:36,236 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517797283] [2021-06-05 10:00:36,236 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517797283] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:00:36,236 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:00:36,236 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 10:00:36,236 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011599698] [2021-06-05 10:00:36,236 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 10:00:36,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:00:36,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 10:00:36,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 10:00:36,237 INFO L87 Difference]: Start difference. First operand 42652 states and 176750 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:00:36,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:00:36,607 INFO L93 Difference]: Finished difference Result 46156 states and 187204 transitions. [2021-06-05 10:00:36,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 10:00:36,607 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2021-06-05 10:00:36,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:00:36,705 INFO L225 Difference]: With dead ends: 46156 [2021-06-05 10:00:36,705 INFO L226 Difference]: Without dead ends: 32788 [2021-06-05 10:00:36,705 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 98.7ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-06-05 10:00:37,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32788 states. [2021-06-05 10:00:37,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32788 to 32788. [2021-06-05 10:00:37,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32788 states, 32787 states have (on average 4.02202092292677) internal successors, (131870), 32787 states have internal predecessors, (131870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:00:37,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32788 states to 32788 states and 131870 transitions. [2021-06-05 10:00:37,939 INFO L78 Accepts]: Start accepts. Automaton has 32788 states and 131870 transitions. Word has length 86 [2021-06-05 10:00:37,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:00:37,939 INFO L482 AbstractCegarLoop]: Abstraction has 32788 states and 131870 transitions. [2021-06-05 10:00:37,940 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:00:37,940 INFO L276 IsEmpty]: Start isEmpty. Operand 32788 states and 131870 transitions. [2021-06-05 10:00:37,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-06-05 10:00:37,993 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:00:37,993 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 10:00:37,993 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-05 10:00:37,993 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:00:37,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:00:37,994 INFO L82 PathProgramCache]: Analyzing trace with hash 397022798, now seen corresponding path program 1 times [2021-06-05 10:00:37,994 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:00:37,994 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455808366] [2021-06-05 10:00:37,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:00:38,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:00:38,073 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 10:00:38,074 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:00:38,074 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455808366] [2021-06-05 10:00:38,074 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455808366] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:00:38,074 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:00:38,074 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 10:00:38,074 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90521465] [2021-06-05 10:00:38,074 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 10:00:38,075 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:00:38,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 10:00:38,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 10:00:38,075 INFO L87 Difference]: Start difference. First operand 32788 states and 131870 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:00:39,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:00:39,013 INFO L93 Difference]: Finished difference Result 51652 states and 205051 transitions. [2021-06-05 10:00:39,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 10:00:39,014 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-06-05 10:00:39,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:00:39,113 INFO L225 Difference]: With dead ends: 51652 [2021-06-05 10:00:39,113 INFO L226 Difference]: Without dead ends: 34084 [2021-06-05 10:00:39,114 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 99.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 10:00:39,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34084 states. [2021-06-05 10:00:39,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34084 to 31582. [2021-06-05 10:00:39,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31582 states, 31581 states have (on average 3.9405971945156897) internal successors, (124448), 31581 states have internal predecessors, (124448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:00:39,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31582 states to 31582 states and 124448 transitions. [2021-06-05 10:00:39,813 INFO L78 Accepts]: Start accepts. Automaton has 31582 states and 124448 transitions. Word has length 88 [2021-06-05 10:00:39,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:00:39,813 INFO L482 AbstractCegarLoop]: Abstraction has 31582 states and 124448 transitions. [2021-06-05 10:00:39,813 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:00:39,814 INFO L276 IsEmpty]: Start isEmpty. Operand 31582 states and 124448 transitions. [2021-06-05 10:00:39,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-06-05 10:00:39,864 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:00:39,864 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 10:00:39,864 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-05 10:00:39,864 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:00:39,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:00:39,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1585346414, now seen corresponding path program 1 times [2021-06-05 10:00:39,865 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:00:39,865 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731903450] [2021-06-05 10:00:39,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:00:39,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:00:39,961 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 10:00:39,961 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:00:39,961 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731903450] [2021-06-05 10:00:39,961 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731903450] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:00:39,962 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:00:39,962 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 10:00:39,962 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078481662] [2021-06-05 10:00:39,962 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 10:00:39,962 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:00:39,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 10:00:39,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 10:00:39,963 INFO L87 Difference]: Start difference. First operand 31582 states and 124448 transitions. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:00:40,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:00:40,576 INFO L93 Difference]: Finished difference Result 28828 states and 111218 transitions. [2021-06-05 10:00:40,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 10:00:40,576 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 10:00:40,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:00:40,644 INFO L225 Difference]: With dead ends: 28828 [2021-06-05 10:00:40,644 INFO L226 Difference]: Without dead ends: 20278 [2021-06-05 10:00:40,644 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 107.5ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-06-05 10:00:40,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20278 states. [2021-06-05 10:00:41,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20278 to 19018. [2021-06-05 10:00:41,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19018 states, 19017 states have (on average 3.7966030393858126) internal successors, (72200), 19017 states have internal predecessors, (72200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:00:41,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19018 states to 19018 states and 72200 transitions. [2021-06-05 10:00:41,123 INFO L78 Accepts]: Start accepts. Automaton has 19018 states and 72200 transitions. Word has length 88 [2021-06-05 10:00:41,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:00:41,124 INFO L482 AbstractCegarLoop]: Abstraction has 19018 states and 72200 transitions. [2021-06-05 10:00:41,124 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 10:00:41,124 INFO L276 IsEmpty]: Start isEmpty. Operand 19018 states and 72200 transitions. [2021-06-05 10:00:41,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-06-05 10:00:41,160 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:00:41,160 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] [2021-06-05 10:00:41,160 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-05 10:00:41,160 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:00:41,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:00:41,161 INFO L82 PathProgramCache]: Analyzing trace with hash -108580821, now seen corresponding path program 1 times [2021-06-05 10:00:41,161 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:00:41,161 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543631591] [2021-06-05 10:00:41,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:00:41,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:00:41,280 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 10:00:41,280 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:00:41,280 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543631591] [2021-06-05 10:00:41,280 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543631591] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:00:41,280 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:00:41,280 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 10:00:41,280 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771605129] [2021-06-05 10:00:41,281 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 10:00:41,281 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:00:41,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 10:00:41,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-05 10:00:41,281 INFO L87 Difference]: Start difference. First operand 19018 states and 72200 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:00:41,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:00:41,533 INFO L93 Difference]: Finished difference Result 16264 states and 61103 transitions. [2021-06-05 10:00:41,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 10:00:41,534 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2021-06-05 10:00:41,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:00:41,553 INFO L225 Difference]: With dead ends: 16264 [2021-06-05 10:00:41,553 INFO L226 Difference]: Without dead ends: 7057 [2021-06-05 10:00:41,554 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 131.2ms TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2021-06-05 10:00:41,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7057 states. [2021-06-05 10:00:41,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7057 to 6385. [2021-06-05 10:00:41,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6385 states, 6384 states have (on average 3.6608709273182956) internal successors, (23371), 6384 states have internal predecessors, (23371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:00:41,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6385 states to 6385 states and 23371 transitions. [2021-06-05 10:00:41,701 INFO L78 Accepts]: Start accepts. Automaton has 6385 states and 23371 transitions. Word has length 91 [2021-06-05 10:00:41,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:00:41,701 INFO L482 AbstractCegarLoop]: Abstraction has 6385 states and 23371 transitions. [2021-06-05 10:00:41,701 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:00:41,702 INFO L276 IsEmpty]: Start isEmpty. Operand 6385 states and 23371 transitions. [2021-06-05 10:00:41,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-06-05 10:00:41,713 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:00:41,713 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] [2021-06-05 10:00:41,713 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-05 10:00:41,713 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:00:41,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:00:41,713 INFO L82 PathProgramCache]: Analyzing trace with hash 670995757, now seen corresponding path program 1 times [2021-06-05 10:00:41,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:00:41,714 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626144567] [2021-06-05 10:00:41,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:00:42,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:00:42,276 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 10:00:42,277 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:00:42,277 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626144567] [2021-06-05 10:00:42,277 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626144567] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:00:42,277 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:00:42,277 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-05 10:00:42,277 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471038529] [2021-06-05 10:00:42,278 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 10:00:42,278 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:00:42,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 10:00:42,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-06-05 10:00:42,279 INFO L87 Difference]: Start difference. First operand 6385 states and 23371 transitions. Second operand has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:00:42,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:00:42,502 INFO L93 Difference]: Finished difference Result 9535 states and 35263 transitions. [2021-06-05 10:00:42,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 10:00:42,503 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-06-05 10:00:42,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:00:42,513 INFO L225 Difference]: With dead ends: 9535 [2021-06-05 10:00:42,513 INFO L226 Difference]: Without dead ends: 3644 [2021-06-05 10:00:42,515 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 181.6ms TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2021-06-05 10:00:42,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3644 states. [2021-06-05 10:00:42,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3644 to 3644. [2021-06-05 10:00:42,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3644 states, 3643 states have (on average 3.675267636563272) internal successors, (13389), 3643 states have internal predecessors, (13389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:00:42,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3644 states to 3644 states and 13389 transitions. [2021-06-05 10:00:42,586 INFO L78 Accepts]: Start accepts. Automaton has 3644 states and 13389 transitions. Word has length 95 [2021-06-05 10:00:42,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:00:42,586 INFO L482 AbstractCegarLoop]: Abstraction has 3644 states and 13389 transitions. [2021-06-05 10:00:42,586 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:00:42,586 INFO L276 IsEmpty]: Start isEmpty. Operand 3644 states and 13389 transitions. [2021-06-05 10:00:42,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-06-05 10:00:42,592 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:00:42,592 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] [2021-06-05 10:00:42,592 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-05 10:00:42,592 INFO L430 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:00:42,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:00:42,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1621222325, now seen corresponding path program 2 times [2021-06-05 10:00:42,593 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:00:42,593 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415074462] [2021-06-05 10:00:42,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:00:42,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:00:42,804 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 10:00:42,804 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:00:42,804 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415074462] [2021-06-05 10:00:42,806 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415074462] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:00:42,806 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:00:42,806 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 10:00:42,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656390872] [2021-06-05 10:00:42,807 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 10:00:42,807 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:00:42,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 10:00:42,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-06-05 10:00:42,807 INFO L87 Difference]: Start difference. First operand 3644 states and 13389 transitions. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:00:42,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:00:42,940 INFO L93 Difference]: Finished difference Result 5414 states and 19927 transitions. [2021-06-05 10:00:42,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 10:00:42,941 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-06-05 10:00:42,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:00:42,948 INFO L225 Difference]: With dead ends: 5414 [2021-06-05 10:00:42,948 INFO L226 Difference]: Without dead ends: 2636 [2021-06-05 10:00:42,948 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 165.8ms TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-06-05 10:00:42,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2021-06-05 10:00:42,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2636. [2021-06-05 10:00:42,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2636 states, 2635 states have (on average 3.541935483870968) internal successors, (9333), 2635 states have internal predecessors, (9333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:00:42,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2636 states to 2636 states and 9333 transitions. [2021-06-05 10:00:42,999 INFO L78 Accepts]: Start accepts. Automaton has 2636 states and 9333 transitions. Word has length 95 [2021-06-05 10:00:42,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:00:42,999 INFO L482 AbstractCegarLoop]: Abstraction has 2636 states and 9333 transitions. [2021-06-05 10:00:42,999 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:00:42,999 INFO L276 IsEmpty]: Start isEmpty. Operand 2636 states and 9333 transitions. [2021-06-05 10:00:43,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-06-05 10:00:43,003 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:00:43,003 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] [2021-06-05 10:00:43,003 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-05 10:00:43,003 INFO L430 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:00:43,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:00:43,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1807411347, now seen corresponding path program 3 times [2021-06-05 10:00:43,004 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:00:43,004 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275205041] [2021-06-05 10:00:43,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:00:43,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 10:00:43,041 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 10:00:43,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 10:00:43,079 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 10:00:43,131 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 10:00:43,131 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 10:00:43,132 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-05 10:00:43,134 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-05 10:00:43,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 10:00:43 BasicIcfg [2021-06-05 10:00:43,304 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 10:00:43,304 INFO L168 Benchmark]: Toolchain (without parser) took 60539.42 ms. Allocated memory was 339.7 MB in the beginning and 14.7 GB in the end (delta: 14.4 GB). Free memory was 301.7 MB in the beginning and 10.0 GB in the end (delta: -9.7 GB). Peak memory consumption was 4.7 GB. Max. memory is 16.0 GB. [2021-06-05 10:00:43,304 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 339.7 MB. Free memory was 320.1 MB in the beginning and 320.1 MB in the end (delta: 70.4 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 10:00:43,305 INFO L168 Benchmark]: CACSL2BoogieTranslator took 600.83 ms. Allocated memory is still 339.7 MB. Free memory was 301.5 MB in the beginning and 297.2 MB in the end (delta: 4.2 MB). Peak memory consumption was 7.0 MB. Max. memory is 16.0 GB. [2021-06-05 10:00:43,305 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.39 ms. Allocated memory is still 339.7 MB. Free memory was 297.2 MB in the beginning and 295.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 10:00:43,305 INFO L168 Benchmark]: Boogie Preprocessor took 56.94 ms. Allocated memory is still 339.7 MB. Free memory was 295.1 MB in the beginning and 292.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-06-05 10:00:43,305 INFO L168 Benchmark]: RCFGBuilder took 1776.62 ms. Allocated memory is still 339.7 MB. Free memory was 292.0 MB in the beginning and 243.2 MB in the end (delta: 48.7 MB). Peak memory consumption was 142.0 MB. Max. memory is 16.0 GB. [2021-06-05 10:00:43,305 INFO L168 Benchmark]: TraceAbstraction took 58017.54 ms. Allocated memory was 339.7 MB in the beginning and 14.7 GB in the end (delta: 14.4 GB). Free memory was 242.2 MB in the beginning and 10.0 GB in the end (delta: -9.7 GB). Peak memory consumption was 4.7 GB. Max. memory is 16.0 GB. [2021-06-05 10:00:43,306 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 339.7 MB. Free memory was 320.1 MB in the beginning and 320.1 MB in the end (delta: 70.4 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 600.83 ms. Allocated memory is still 339.7 MB. Free memory was 301.5 MB in the beginning and 297.2 MB in the end (delta: 4.2 MB). Peak memory consumption was 7.0 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 79.39 ms. Allocated memory is still 339.7 MB. Free memory was 297.2 MB in the beginning and 295.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 56.94 ms. Allocated memory is still 339.7 MB. Free memory was 295.1 MB in the beginning and 292.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1776.62 ms. Allocated memory is still 339.7 MB. Free memory was 292.0 MB in the beginning and 243.2 MB in the end (delta: 48.7 MB). Peak memory consumption was 142.0 MB. Max. memory is 16.0 GB. * TraceAbstraction took 58017.54 ms. Allocated memory was 339.7 MB in the beginning and 14.7 GB in the end (delta: 14.4 GB). Free memory was 242.2 MB in the beginning and 10.0 GB in the end (delta: -9.7 GB). Peak memory consumption was 4.7 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_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0] [L714] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0] [L715] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0] [L716] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L718] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L720] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L722] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L723] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L724] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L725] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L726] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L727] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L728] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L729] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0] [L730] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0] [L731] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L732] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L733] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L734] 0 _Bool z$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L735] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0] [L736] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L737] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L738] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L739] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L740] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L741] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L742] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L834] 0 pthread_t t1525; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] FCALL, FORK 0 pthread_create(&t1525, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 pthread_t t1526; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t1526, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t1527; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] FCALL, FORK 0 pthread_create(&t1527, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t1528; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L841] FCALL, FORK 0 pthread_create(&t1528, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 4 z$w_buff1 = z$w_buff0 [L797] 4 z$w_buff0 = 2 [L798] 4 z$w_buff1_used = z$w_buff0_used [L799] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L801] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L802] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L803] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L804] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L805] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L761] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 y = 2 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z = 1 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L812] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L813] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L813] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L814] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L815] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L816] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L819] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L782] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L782] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L782] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L782] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L783] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L783] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L784] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L784] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L785] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L785] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L786] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L789] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L854] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L855] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L856] 0 z$flush_delayed = weak$$choice2 [L857] 0 z$mem_tmp = z [L858] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L858] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L859] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L859] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L860] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L860] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L861] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L861] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L862] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L863] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L864] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L866] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L866] 0 z = z$flush_delayed ? z$mem_tmp : z [L867] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 158 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 57718.0ms, OverallIterations: 17, TraceHistogramMax: 1, EmptinessCheckTime: 1255.6ms, AutomataDifference: 14179.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 17448.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2699 SDtfs, 4632 SDslu, 9904 SDs, 0 SdLazy, 959 SolverSat, 254 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1025.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 227 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 2297.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=105490occurred in iteration=0, InterpolantAutomatonStates: 174, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 20765.3ms AutomataMinimizationTime, 16 MinimizatonAttempts, 15686 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 69.1ms SsaConstructionTime, 1077.7ms SatisfiabilityAnalysisTime, 2488.8ms InterpolantComputationTime, 1444 NumberOfCodeBlocks, 1444 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1333 ConstructedInterpolants, 0 QuantifiedInterpolants, 6676 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...