/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/safe010_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-29289db [2021-06-05 10:05:49,271 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 10:05:49,274 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 10:05:49,316 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 10:05:49,317 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 10:05:49,320 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 10:05:49,323 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 10:05:49,329 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 10:05:49,332 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 10:05:49,343 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 10:05:49,344 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 10:05:49,346 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 10:05:49,346 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 10:05:49,348 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 10:05:49,349 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 10:05:49,351 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 10:05:49,354 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 10:05:49,355 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 10:05:49,357 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 10:05:49,364 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 10:05:49,366 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 10:05:49,367 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 10:05:49,368 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 10:05:49,370 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 10:05:49,372 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 10:05:49,372 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 10:05:49,372 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 10:05:49,374 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 10:05:49,374 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 10:05:49,375 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 10:05:49,375 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 10:05:49,375 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 10:05:49,377 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 10:05:49,377 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 10:05:49,378 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 10:05:49,378 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 10:05:49,379 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 10:05:49,379 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 10:05:49,379 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 10:05:49,380 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 10:05:49,380 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 10:05:49,384 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 10:05:49,420 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 10:05:49,420 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 10:05:49,420 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 10:05:49,421 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 10:05:49,423 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 10:05:49,423 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 10:05:49,423 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 10:05:49,423 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 10:05:49,424 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 10:05:49,424 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 10:05:49,425 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 10:05:49,425 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 10:05:49,425 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 10:05:49,425 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 10:05:49,425 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 10:05:49,425 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 10:05:49,425 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 10:05:49,425 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 10:05:49,426 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 10:05:49,426 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 10:05:49,426 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 10:05:49,426 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 10:05:49,426 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 10:05:49,426 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 10:05:49,426 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 10:05:49,426 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 10:05:49,427 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 10:05:49,427 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 10:05:49,427 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 10:05:49,427 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 10:05:49,427 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 10:05:49,427 INFO L138 SettingsManager]: * Check the insufficient thread errors last=true [2021-06-05 10:05:49,427 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 10:05:49,716 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 10:05:49,731 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 10:05:49,733 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 10:05:49,734 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-05 10:05:49,744 INFO L275 PluginConnector]: CDTParser initialized [2021-06-05 10:05:49,745 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_power.oepc.i [2021-06-05 10:05:49,796 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b3d36944/ee05ebeebe5240a8acab4928b8b12428/FLAGfb8cc2a7c [2021-06-05 10:05:50,290 INFO L306 CDTParser]: Found 1 translation units. [2021-06-05 10:05:50,291 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_power.oepc.i [2021-06-05 10:05:50,305 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b3d36944/ee05ebeebe5240a8acab4928b8b12428/FLAGfb8cc2a7c [2021-06-05 10:05:50,778 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b3d36944/ee05ebeebe5240a8acab4928b8b12428 [2021-06-05 10:05:50,780 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 10:05:50,782 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-05 10:05:50,783 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-05 10:05:50,783 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-05 10:05:50,786 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-05 10:05:50,786 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 10:05:50" (1/1) ... [2021-06-05 10:05:50,787 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@adb7af9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:05:50, skipping insertion in model container [2021-06-05 10:05:50,788 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 10:05:50" (1/1) ... [2021-06-05 10:05:50,808 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-05 10:05:50,873 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-05 10:05:51,087 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/safe010_power.oepc.i[952,965] [2021-06-05 10:05:51,286 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 10:05:51,292 INFO L203 MainTranslator]: Completed pre-run [2021-06-05 10:05:51,305 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/safe010_power.oepc.i[952,965] [2021-06-05 10:05:51,364 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 10:05:51,445 INFO L208 MainTranslator]: Completed translation [2021-06-05 10:05:51,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:05:51 WrapperNode [2021-06-05 10:05:51,446 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-05 10:05:51,447 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 10:05:51,447 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 10:05:51,447 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 10:05:51,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:05:51" (1/1) ... [2021-06-05 10:05:51,486 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:05:51" (1/1) ... [2021-06-05 10:05:51,524 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 10:05:51,525 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 10:05:51,525 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 10:05:51,525 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 10:05:51,531 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:05:51" (1/1) ... [2021-06-05 10:05:51,532 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:05:51" (1/1) ... [2021-06-05 10:05:51,534 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:05:51" (1/1) ... [2021-06-05 10:05:51,534 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:05:51" (1/1) ... [2021-06-05 10:05:51,541 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:05:51" (1/1) ... [2021-06-05 10:05:51,544 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:05:51" (1/1) ... [2021-06-05 10:05:51,547 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:05:51" (1/1) ... [2021-06-05 10:05:51,551 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 10:05:51,551 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 10:05:51,552 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 10:05:51,552 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 10:05:51,552 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:05:51" (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 10:05:51,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-05 10:05:51,618 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-05 10:05:51,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-05 10:05:51,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-05 10:05:51,619 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-05 10:05:51,619 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-05 10:05:51,619 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-05 10:05:51,619 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-05 10:05:51,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-05 10:05:51,619 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-05 10:05:51,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 10:05:51,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 10:05:51,621 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 10:05:53,310 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 10:05:53,311 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-05 10:05:53,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 10:05:53 BoogieIcfgContainer [2021-06-05 10:05:53,312 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 10:05:53,314 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 10:05:53,314 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 10:05:53,316 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 10:05:53,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.06 10:05:50" (1/3) ... [2021-06-05 10:05:53,317 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@380d0dba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 10:05:53, skipping insertion in model container [2021-06-05 10:05:53,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:05:51" (2/3) ... [2021-06-05 10:05:53,317 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@380d0dba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 10:05:53, skipping insertion in model container [2021-06-05 10:05:53,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 10:05:53" (3/3) ... [2021-06-05 10:05:53,318 INFO L111 eAbstractionObserver]: Analyzing ICFG safe010_power.oepc.i [2021-06-05 10:05:53,323 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 10:05:53,323 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 10:05:53,323 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-05 10:05:53,324 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 10:05:53,347 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,347 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,347 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,347 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,347 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,347 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,348 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,348 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,348 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,348 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,348 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,348 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,348 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,348 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,349 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,349 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,349 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,349 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,349 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,349 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,349 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,349 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,350 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,350 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,350 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,350 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,350 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,350 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,351 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,351 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,351 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,351 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,351 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,351 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,352 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,352 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,352 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,352 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,352 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,352 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,353 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,353 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,354 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,354 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,354 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,354 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,354 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,354 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,354 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,357 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,357 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,357 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,357 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,357 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,357 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,358 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,358 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,358 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,358 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,360 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,360 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,360 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,360 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,360 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,360 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,361 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,361 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,361 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:05:53,362 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 10:05:53,379 INFO L255 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-06-05 10:05:53,395 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 10:05:53,395 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 10:05:53,395 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 10:05:53,395 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 10:05:53,395 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 10:05:53,395 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 10:05:53,395 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 10:05:53,395 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 10:05:53,403 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 91 places, 86 transitions, 182 flow [2021-06-05 10:05:53,462 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1899 states, 1895 states have (on average 2.745118733509235) internal successors, (5202), 1898 states have internal predecessors, (5202), 0 states have call successors, (0), 0 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:05:53,468 INFO L276 IsEmpty]: Start isEmpty. Operand has 1899 states, 1895 states have (on average 2.745118733509235) internal successors, (5202), 1898 states have internal predecessors, (5202), 0 states have call successors, (0), 0 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:05:53,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-06-05 10:05:53,474 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:05:53,474 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] [2021-06-05 10:05:53,475 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:05:53,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:05:53,479 INFO L82 PathProgramCache]: Analyzing trace with hash -23040913, now seen corresponding path program 1 times [2021-06-05 10:05:53,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:05:53,486 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107653461] [2021-06-05 10:05:53,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:05:53,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:05:53,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:05:53,753 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:05:53,754 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107653461] [2021-06-05 10:05:53,754 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107653461] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:05:53,755 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:05:53,755 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 10:05:53,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359221103] [2021-06-05 10:05:53,759 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 10:05:53,759 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:05:53,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 10:05:53,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 10:05:53,776 INFO L87 Difference]: Start difference. First operand has 1899 states, 1895 states have (on average 2.745118733509235) internal successors, (5202), 1898 states have internal predecessors, (5202), 0 states have call successors, (0), 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 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 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:05:53,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:05:53,857 INFO L93 Difference]: Finished difference Result 1628 states and 4301 transitions. [2021-06-05 10:05:53,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 10:05:53,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2021-06-05 10:05:53,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:05:53,879 INFO L225 Difference]: With dead ends: 1628 [2021-06-05 10:05:53,879 INFO L226 Difference]: Without dead ends: 1052 [2021-06-05 10:05:53,880 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:05:53,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2021-06-05 10:05:53,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1052. [2021-06-05 10:05:53,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 1051 states have (on average 2.5851569933396763) internal successors, (2717), 1051 states have internal predecessors, (2717), 0 states have call successors, (0), 0 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:05:53,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 2717 transitions. [2021-06-05 10:05:53,996 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 2717 transitions. Word has length 38 [2021-06-05 10:05:53,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:05:53,996 INFO L482 AbstractCegarLoop]: Abstraction has 1052 states and 2717 transitions. [2021-06-05 10:05:53,996 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 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:05:53,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 2717 transitions. [2021-06-05 10:05:54,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-06-05 10:05:54,006 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:05:54,006 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] [2021-06-05 10:05:54,007 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 10:05:54,007 INFO L430 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:05:54,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:05:54,011 INFO L82 PathProgramCache]: Analyzing trace with hash -580539508, now seen corresponding path program 1 times [2021-06-05 10:05:54,012 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:05:54,012 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930126006] [2021-06-05 10:05:54,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:05:54,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:05:54,258 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:05:54,259 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:05:54,259 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930126006] [2021-06-05 10:05:54,259 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930126006] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:05:54,260 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:05:54,260 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 10:05:54,260 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581260052] [2021-06-05 10:05:54,262 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 10:05:54,262 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:05:54,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 10:05:54,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 10:05:54,266 INFO L87 Difference]: Start difference. First operand 1052 states and 2717 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 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:05:54,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:05:54,401 INFO L93 Difference]: Finished difference Result 1212 states and 3097 transitions. [2021-06-05 10:05:54,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 10:05:54,401 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2021-06-05 10:05:54,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:05:54,408 INFO L225 Difference]: With dead ends: 1212 [2021-06-05 10:05:54,408 INFO L226 Difference]: Without dead ends: 956 [2021-06-05 10:05:54,409 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 97.3ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 10:05:54,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2021-06-05 10:05:54,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 956. [2021-06-05 10:05:54,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 956 states, 955 states have (on average 2.556020942408377) internal successors, (2441), 955 states have internal predecessors, (2441), 0 states have call successors, (0), 0 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:05:54,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 2441 transitions. [2021-06-05 10:05:54,437 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 2441 transitions. Word has length 57 [2021-06-05 10:05:54,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:05:54,438 INFO L482 AbstractCegarLoop]: Abstraction has 956 states and 2441 transitions. [2021-06-05 10:05:54,438 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 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:05:54,438 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 2441 transitions. [2021-06-05 10:05:54,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-06-05 10:05:54,444 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:05:54,444 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:05:54,444 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 10:05:54,444 INFO L430 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:05:54,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:05:54,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1979180659, now seen corresponding path program 1 times [2021-06-05 10:05:54,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:05:54,446 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950677584] [2021-06-05 10:05:54,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:05:54,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:05:54,680 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:05:54,681 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:05:54,681 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950677584] [2021-06-05 10:05:54,681 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950677584] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:05:54,682 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:05:54,682 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 10:05:54,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537299577] [2021-06-05 10:05:54,682 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 10:05:54,682 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:05:54,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 10:05:54,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 10:05:54,683 INFO L87 Difference]: Start difference. First operand 956 states and 2441 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:05:54,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:05:54,836 INFO L93 Difference]: Finished difference Result 1310 states and 3336 transitions. [2021-06-05 10:05:54,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 10:05:54,837 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-06-05 10:05:54,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:05:54,840 INFO L225 Difference]: With dead ends: 1310 [2021-06-05 10:05:54,840 INFO L226 Difference]: Without dead ends: 686 [2021-06-05 10:05:54,841 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 140.6ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-06-05 10:05:54,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2021-06-05 10:05:54,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 686. [2021-06-05 10:05:54,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 685 states have (on average 2.4335766423357663) internal successors, (1667), 685 states have internal predecessors, (1667), 0 states have call successors, (0), 0 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:05:54,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 1667 transitions. [2021-06-05 10:05:54,860 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 1667 transitions. Word has length 59 [2021-06-05 10:05:54,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:05:54,862 INFO L482 AbstractCegarLoop]: Abstraction has 686 states and 1667 transitions. [2021-06-05 10:05:54,862 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:05:54,862 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 1667 transitions. [2021-06-05 10:05:54,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-06-05 10:05:54,864 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:05:54,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] [2021-06-05 10:05:54,864 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 10:05:54,864 INFO L430 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:05:54,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:05:54,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1039376616, now seen corresponding path program 1 times [2021-06-05 10:05:54,865 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:05:54,865 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778010492] [2021-06-05 10:05:54,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:05:54,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:05:55,174 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:05:55,176 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:05:55,176 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778010492] [2021-06-05 10:05:55,176 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778010492] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:05:55,177 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:05:55,179 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 10:05:55,179 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182471808] [2021-06-05 10:05:55,179 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 10:05:55,180 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:05:55,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 10:05:55,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-05 10:05:55,181 INFO L87 Difference]: Start difference. First operand 686 states and 1667 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 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:05:55,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:05:55,405 INFO L93 Difference]: Finished difference Result 800 states and 1936 transitions. [2021-06-05 10:05:55,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 10:05:55,406 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2021-06-05 10:05:55,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:05:55,409 INFO L225 Difference]: With dead ends: 800 [2021-06-05 10:05:55,409 INFO L226 Difference]: Without dead ends: 680 [2021-06-05 10:05:55,413 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 194.1ms TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2021-06-05 10:05:55,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2021-06-05 10:05:55,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 680. [2021-06-05 10:05:55,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 679 states have (on average 2.4285714285714284) internal successors, (1649), 679 states have internal predecessors, (1649), 0 states have call successors, (0), 0 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:05:55,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 1649 transitions. [2021-06-05 10:05:55,429 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 1649 transitions. Word has length 62 [2021-06-05 10:05:55,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:05:55,429 INFO L482 AbstractCegarLoop]: Abstraction has 680 states and 1649 transitions. [2021-06-05 10:05:55,429 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 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:05:55,430 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 1649 transitions. [2021-06-05 10:05:55,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 10:05:55,431 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:05:55,432 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:05:55,432 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-05 10:05:55,432 INFO L430 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:05:55,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:05:55,432 INFO L82 PathProgramCache]: Analyzing trace with hash -2082759350, now seen corresponding path program 1 times [2021-06-05 10:05:55,432 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:05:55,433 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919709357] [2021-06-05 10:05:55,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:05:55,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:05:55,527 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:05:55,527 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:05:55,528 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919709357] [2021-06-05 10:05:55,528 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919709357] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:05:55,528 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:05:55,528 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 10:05:55,528 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568124709] [2021-06-05 10:05:55,528 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 10:05:55,529 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:05:55,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 10:05:55,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 10:05:55,529 INFO L87 Difference]: Start difference. First operand 680 states and 1649 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 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:05:55,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:05:55,628 INFO L93 Difference]: Finished difference Result 738 states and 1747 transitions. [2021-06-05 10:05:55,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 10:05:55,628 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2021-06-05 10:05:55,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:05:55,630 INFO L225 Difference]: With dead ends: 738 [2021-06-05 10:05:55,631 INFO L226 Difference]: Without dead ends: 554 [2021-06-05 10:05:55,631 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 89.3ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 10:05:55,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2021-06-05 10:05:55,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2021-06-05 10:05:55,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 553 states have (on average 2.330922242314647) internal successors, (1289), 553 states have internal predecessors, (1289), 0 states have call successors, (0), 0 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:05:55,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 1289 transitions. [2021-06-05 10:05:55,643 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 1289 transitions. Word has length 63 [2021-06-05 10:05:55,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:05:55,643 INFO L482 AbstractCegarLoop]: Abstraction has 554 states and 1289 transitions. [2021-06-05 10:05:55,643 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 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:05:55,643 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 1289 transitions. [2021-06-05 10:05:55,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-06-05 10:05:55,644 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:05:55,645 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] [2021-06-05 10:05:55,645 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-05 10:05:55,645 INFO L430 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:05:55,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:05:55,645 INFO L82 PathProgramCache]: Analyzing trace with hash -134892489, now seen corresponding path program 1 times [2021-06-05 10:05:55,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:05:55,646 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203172993] [2021-06-05 10:05:55,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:05:55,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:05:55,738 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:05:55,738 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:05:55,738 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203172993] [2021-06-05 10:05:55,739 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203172993] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:05:55,739 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:05:55,739 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 10:05:55,739 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800292483] [2021-06-05 10:05:55,739 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 10:05:55,739 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:05:55,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 10:05:55,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 10:05:55,740 INFO L87 Difference]: Start difference. First operand 554 states and 1289 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:05:55,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:05:55,848 INFO L93 Difference]: Finished difference Result 458 states and 1012 transitions. [2021-06-05 10:05:55,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 10:05:55,849 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2021-06-05 10:05:55,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:05:55,850 INFO L225 Difference]: With dead ends: 458 [2021-06-05 10:05:55,850 INFO L226 Difference]: Without dead ends: 338 [2021-06-05 10:05:55,850 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 99.0ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-06-05 10:05:55,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2021-06-05 10:05:55,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2021-06-05 10:05:55,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 337 states have (on average 2.115727002967359) internal successors, (713), 337 states have internal predecessors, (713), 0 states have call successors, (0), 0 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:05:55,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 713 transitions. [2021-06-05 10:05:55,859 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 713 transitions. Word has length 64 [2021-06-05 10:05:55,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:05:55,860 INFO L482 AbstractCegarLoop]: Abstraction has 338 states and 713 transitions. [2021-06-05 10:05:55,860 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:05:55,860 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 713 transitions. [2021-06-05 10:05:55,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-06-05 10:05:55,861 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:05:55,861 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] [2021-06-05 10:05:55,861 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-05 10:05:55,861 INFO L430 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:05:55,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:05:55,862 INFO L82 PathProgramCache]: Analyzing trace with hash 190925568, now seen corresponding path program 1 times [2021-06-05 10:05:55,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:05:55,864 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324788280] [2021-06-05 10:05:55,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:05:55,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:05:56,172 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:05:56,173 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:05:56,173 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324788280] [2021-06-05 10:05:56,173 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324788280] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:05:56,173 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:05:56,173 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-06-05 10:05:56,173 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701923783] [2021-06-05 10:05:56,174 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 10:05:56,176 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:05:56,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 10:05:56,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2021-06-05 10:05:56,176 INFO L87 Difference]: Start difference. First operand 338 states and 713 transitions. Second operand has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 0 states have call successors, (0), 0 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:05:56,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:05:56,378 INFO L93 Difference]: Finished difference Result 488 states and 1056 transitions. [2021-06-05 10:05:56,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 10:05:56,378 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2021-06-05 10:05:56,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:05:56,379 INFO L225 Difference]: With dead ends: 488 [2021-06-05 10:05:56,379 INFO L226 Difference]: Without dead ends: 274 [2021-06-05 10:05:56,380 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 231.2ms TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2021-06-05 10:05:56,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2021-06-05 10:05:56,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2021-06-05 10:05:56,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 273 states have (on average 2.0549450549450547) internal successors, (561), 273 states have internal predecessors, (561), 0 states have call successors, (0), 0 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:05:56,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 561 transitions. [2021-06-05 10:05:56,385 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 561 transitions. Word has length 67 [2021-06-05 10:05:56,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:05:56,386 INFO L482 AbstractCegarLoop]: Abstraction has 274 states and 561 transitions. [2021-06-05 10:05:56,386 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 0 states have call successors, (0), 0 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:05:56,386 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 561 transitions. [2021-06-05 10:05:56,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-06-05 10:05:56,387 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:05:56,387 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] [2021-06-05 10:05:56,387 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-05 10:05:56,387 INFO L430 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:05:56,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:05:56,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1019315392, now seen corresponding path program 2 times [2021-06-05 10:05:56,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:05:56,389 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624045252] [2021-06-05 10:05:56,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:05:56,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 10:05:56,429 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 10:05:56,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 10:05:56,484 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 10:05:56,524 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 10:05:56,524 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 10:05:56,525 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-05 10:05:56,527 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-05 10:05:56,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 10:05:56 BasicIcfg [2021-06-05 10:05:56,636 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 10:05:56,641 INFO L168 Benchmark]: Toolchain (without parser) took 5855.33 ms. Allocated memory was 427.8 MB in the beginning and 513.8 MB in the end (delta: 86.0 MB). Free memory was 389.9 MB in the beginning and 429.7 MB in the end (delta: -39.8 MB). Peak memory consumption was 45.7 MB. Max. memory is 16.0 GB. [2021-06-05 10:05:56,641 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 427.8 MB. Free memory was 408.3 MB in the beginning and 408.3 MB in the end (delta: 70.4 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 10:05:56,641 INFO L168 Benchmark]: CACSL2BoogieTranslator took 663.44 ms. Allocated memory is still 427.8 MB. Free memory was 389.7 MB in the beginning and 386.1 MB in the end (delta: 3.6 MB). Peak memory consumption was 5.4 MB. Max. memory is 16.0 GB. [2021-06-05 10:05:56,642 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.77 ms. Allocated memory is still 427.8 MB. Free memory was 386.1 MB in the beginning and 382.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 10:05:56,644 INFO L168 Benchmark]: Boogie Preprocessor took 26.26 ms. Allocated memory is still 427.8 MB. Free memory was 382.9 MB in the beginning and 380.8 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:05:56,644 INFO L168 Benchmark]: RCFGBuilder took 1760.98 ms. Allocated memory is still 427.8 MB. Free memory was 380.8 MB in the beginning and 339.8 MB in the end (delta: 41.1 MB). Peak memory consumption was 139.6 MB. Max. memory is 16.0 GB. [2021-06-05 10:05:56,644 INFO L168 Benchmark]: TraceAbstraction took 3322.68 ms. Allocated memory was 427.8 MB in the beginning and 513.8 MB in the end (delta: 86.0 MB). Free memory was 338.7 MB in the beginning and 429.7 MB in the end (delta: -91.0 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 10:05:56,650 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 427.8 MB. Free memory was 408.3 MB in the beginning and 408.3 MB in the end (delta: 70.4 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 663.44 ms. Allocated memory is still 427.8 MB. Free memory was 389.7 MB in the beginning and 386.1 MB in the end (delta: 3.6 MB). Peak memory consumption was 5.4 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 76.77 ms. Allocated memory is still 427.8 MB. Free memory was 386.1 MB in the beginning and 382.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 26.26 ms. Allocated memory is still 427.8 MB. Free memory was 382.9 MB in the beginning and 380.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1760.98 ms. Allocated memory is still 427.8 MB. Free memory was 380.8 MB in the beginning and 339.8 MB in the end (delta: 41.1 MB). Peak memory consumption was 139.6 MB. Max. memory is 16.0 GB. * TraceAbstraction took 3322.68 ms. Allocated memory was 427.8 MB in the beginning and 513.8 MB in the end (delta: 86.0 MB). Free memory was 338.7 MB in the beginning and 429.7 MB in the end (delta: -91.0 MB). There was no memory consumed. 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: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L711] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L712] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L714] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L716] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L717] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L718] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L719] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L720] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L721] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L722] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L723] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L724] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L725] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L726] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L727] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L728] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L729] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L730] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L731] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L732] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L792] 0 pthread_t t2009; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L793] FCALL, FORK 0 pthread_create(&t2009, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y$w_buff1 = y$w_buff0 [L737] 1 y$w_buff0 = 2 [L738] 1 y$w_buff1_used = y$w_buff0_used [L739] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L741] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L742] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L743] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L744] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L794] 0 pthread_t t2010; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L795] FCALL, FORK 0 pthread_create(&t2010, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L767] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L750] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L751] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L752] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L753] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L753] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L754] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L774] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L802] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L803] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L804] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L804] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L805] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L805] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 y$flush_delayed = weak$$choice2 [L811] 0 y$mem_tmp = y [L812] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L812] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L813] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L813] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L813] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L813] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L814] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L814] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L814] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L814] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L815] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L815] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L815] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L815] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L816] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L816] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L817] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L817] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L817] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L818] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L818] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L818] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L818] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) [L820] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L820] 0 y = y$flush_delayed ? y$mem_tmp : y [L821] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] 0 reach_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 104 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 3132.4ms, OverallIterations: 8, TraceHistogramMax: 1, EmptinessCheckTime: 33.1ms, AutomataDifference: 1072.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 67.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 673 SDtfs, 888 SDslu, 2232 SDs, 0 SdLazy, 277 SolverSat, 62 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 293.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 858.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1899occurred in iteration=0, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 190.5ms AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 34.2ms SsaConstructionTime, 445.8ms SatisfiabilityAnalysisTime, 990.5ms InterpolantComputationTime, 477 NumberOfCodeBlocks, 477 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 403 ConstructedInterpolants, 0 QuantifiedInterpolants, 1961 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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...