/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe010_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-8a14012e553caa636f65c1137831746b6d9875cd-8a14012 [2021-08-06 13:48:32,003 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-06 13:48:32,005 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-06 13:48:32,028 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-06 13:48:32,029 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-06 13:48:32,029 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-06 13:48:32,030 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-06 13:48:32,032 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-06 13:48:32,033 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-06 13:48:32,034 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-06 13:48:32,034 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-06 13:48:32,035 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-06 13:48:32,035 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-06 13:48:32,036 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-06 13:48:32,037 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-06 13:48:32,037 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-06 13:48:32,038 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-06 13:48:32,039 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-06 13:48:32,040 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-06 13:48:32,041 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-06 13:48:32,042 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-06 13:48:32,042 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-06 13:48:32,043 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-06 13:48:32,044 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-06 13:48:32,045 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-06 13:48:32,046 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-06 13:48:32,046 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-06 13:48:32,046 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-06 13:48:32,047 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-06 13:48:32,047 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-06 13:48:32,047 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-06 13:48:32,048 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-06 13:48:32,048 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-06 13:48:32,049 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-06 13:48:32,049 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-06 13:48:32,050 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-06 13:48:32,050 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-06 13:48:32,050 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-06 13:48:32,050 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-06 13:48:32,051 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-06 13:48:32,051 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-06 13:48:32,052 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2021-08-06 13:48:32,068 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-06 13:48:32,068 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-06 13:48:32,068 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-06 13:48:32,068 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-06 13:48:32,069 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-06 13:48:32,069 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-06 13:48:32,069 INFO L138 SettingsManager]: * Use SBE=true [2021-08-06 13:48:32,069 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-06 13:48:32,070 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-06 13:48:32,070 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-06 13:48:32,070 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-06 13:48:32,070 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-06 13:48:32,070 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-06 13:48:32,070 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-06 13:48:32,070 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-06 13:48:32,070 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-06 13:48:32,070 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-06 13:48:32,071 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-06 13:48:32,071 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-06 13:48:32,071 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-06 13:48:32,071 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-06 13:48:32,071 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-06 13:48:32,071 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-06 13:48:32,071 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-06 13:48:32,071 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-06 13:48:32,071 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-06 13:48:32,072 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-06 13:48:32,072 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-06 13:48:32,072 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-06 13:48:32,072 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-06 13:48:32,072 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-06 13:48:32,072 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-08-06 13:48:32,314 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-06 13:48:32,328 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-06 13:48:32,329 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-06 13:48:32,330 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-06 13:48:32,330 INFO L275 PluginConnector]: CDTParser initialized [2021-08-06 13:48:32,331 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_pso.oepc.i [2021-08-06 13:48:32,367 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8aac447fe/bf689662d6a24dcc92ca10d02560e681/FLAG5b51a419b [2021-08-06 13:48:32,770 INFO L306 CDTParser]: Found 1 translation units. [2021-08-06 13:48:32,770 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_pso.oepc.i [2021-08-06 13:48:32,785 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8aac447fe/bf689662d6a24dcc92ca10d02560e681/FLAG5b51a419b [2021-08-06 13:48:33,127 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8aac447fe/bf689662d6a24dcc92ca10d02560e681 [2021-08-06 13:48:33,129 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-06 13:48:33,131 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-06 13:48:33,133 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-06 13:48:33,133 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-06 13:48:33,136 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-06 13:48:33,137 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.08 01:48:33" (1/1) ... [2021-08-06 13:48:33,138 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69b78441 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:48:33, skipping insertion in model container [2021-08-06 13:48:33,138 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.08 01:48:33" (1/1) ... [2021-08-06 13:48:33,143 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-06 13:48:33,186 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-06 13:48:33,290 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_pso.oepc.i[950,963] [2021-08-06 13:48:33,425 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-06 13:48:33,434 INFO L203 MainTranslator]: Completed pre-run [2021-08-06 13:48:33,455 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_pso.oepc.i[950,963] [2021-08-06 13:48:33,531 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-06 13:48:33,555 INFO L208 MainTranslator]: Completed translation [2021-08-06 13:48:33,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:48:33 WrapperNode [2021-08-06 13:48:33,555 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-06 13:48:33,556 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-06 13:48:33,558 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-06 13:48:33,558 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-06 13:48:33,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:48:33" (1/1) ... [2021-08-06 13:48:33,577 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:48:33" (1/1) ... [2021-08-06 13:48:33,601 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-06 13:48:33,601 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-06 13:48:33,601 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-06 13:48:33,602 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-06 13:48:33,607 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:48:33" (1/1) ... [2021-08-06 13:48:33,607 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:48:33" (1/1) ... [2021-08-06 13:48:33,611 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:48:33" (1/1) ... [2021-08-06 13:48:33,611 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:48:33" (1/1) ... [2021-08-06 13:48:33,617 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:48:33" (1/1) ... [2021-08-06 13:48:33,619 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:48:33" (1/1) ... [2021-08-06 13:48:33,621 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:48:33" (1/1) ... [2021-08-06 13:48:33,624 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-06 13:48:33,625 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-06 13:48:33,625 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-06 13:48:33,625 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-06 13:48:33,626 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:48:33" (1/1) ... [2021-08-06 13:48:33,630 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-06 13:48:33,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-06 13:48:33,644 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-06 13:48:33,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-06 13:48:33,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-06 13:48:33,701 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-06 13:48:33,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-06 13:48:33,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-06 13:48:33,702 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-06 13:48:33,702 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-06 13:48:33,702 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-06 13:48:33,702 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-06 13:48:33,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-06 13:48:33,702 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-06 13:48:33,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-06 13:48:33,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-06 13:48:33,703 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-06 13:48:35,456 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-06 13:48:35,456 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-06 13:48:35,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.08 01:48:35 BoogieIcfgContainer [2021-08-06 13:48:35,458 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-06 13:48:35,459 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-06 13:48:35,459 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-06 13:48:35,461 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-06 13:48:35,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.08 01:48:33" (1/3) ... [2021-08-06 13:48:35,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@730c34fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.08 01:48:35, skipping insertion in model container [2021-08-06 13:48:35,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:48:33" (2/3) ... [2021-08-06 13:48:35,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@730c34fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.08 01:48:35, skipping insertion in model container [2021-08-06 13:48:35,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.08 01:48:35" (3/3) ... [2021-08-06 13:48:35,463 INFO L111 eAbstractionObserver]: Analyzing ICFG safe010_pso.oepc.i [2021-08-06 13:48:35,466 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-08-06 13:48:35,466 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-06 13:48:35,467 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-06 13:48:35,467 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-06 13:48:35,493 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,493 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,493 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,493 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,493 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,494 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,494 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,494 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,494 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,494 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,494 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,494 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,494 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,494 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,495 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,495 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,495 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,495 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,495 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,495 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,495 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,495 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,495 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,497 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,497 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,497 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,497 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,497 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,497 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,497 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,497 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,497 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,498 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,498 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,502 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,502 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,503 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,509 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,509 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,510 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,510 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:35,513 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-06 13:48:35,540 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2021-08-06 13:48:35,544 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-06 13:48:35,544 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-08-06 13:48:35,551 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 91 places, 86 transitions, 182 flow [2021-08-06 13:48:35,598 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1251 states, 1249 states have (on average 2.6733386709367495) internal successors, (3339), 1250 states have internal predecessors, (3339), 0 states have call successors, (0), 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-08-06 13:48:35,604 INFO L276 IsEmpty]: Start isEmpty. Operand has 1251 states, 1249 states have (on average 2.6733386709367495) internal successors, (3339), 1250 states have internal predecessors, (3339), 0 states have call successors, (0), 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-08-06 13:48:35,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-08-06 13:48:35,625 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:48:35,625 INFO L512 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-08-06 13:48:35,626 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-08-06 13:48:35,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:48:35,629 INFO L82 PathProgramCache]: Analyzing trace with hash 2113332174, now seen corresponding path program 1 times [2021-08-06 13:48:35,638 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:48:35,639 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19652945] [2021-08-06 13:48:35,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:48:35,642 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:48:35,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:48:36,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:48:36,212 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:48:36,212 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19652945] [2021-08-06 13:48:36,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19652945] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:48:36,213 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:48:36,213 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-06 13:48:36,215 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317934760] [2021-08-06 13:48:36,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-06 13:48:36,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:48:36,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-06 13:48:36,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-08-06 13:48:36,235 INFO L87 Difference]: Start difference. First operand has 1251 states, 1249 states have (on average 2.6733386709367495) internal successors, (3339), 1250 states have internal predecessors, (3339), 0 states have call successors, (0), 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 10 states, 10 states have (on average 5.7) internal successors, (57), 10 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-08-06 13:48:36,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:48:36,631 INFO L93 Difference]: Finished difference Result 1442 states and 3719 transitions. [2021-08-06 13:48:36,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-06 13:48:36,633 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 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-08-06 13:48:36,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:48:36,647 INFO L225 Difference]: With dead ends: 1442 [2021-08-06 13:48:36,647 INFO L226 Difference]: Without dead ends: 1097 [2021-08-06 13:48:36,648 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 304.3ms TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2021-08-06 13:48:36,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2021-08-06 13:48:36,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 1091. [2021-08-06 13:48:36,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1091 states, 1089 states have (on average 2.5840220385674932) internal successors, (2814), 1090 states have internal predecessors, (2814), 0 states have call successors, (0), 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-08-06 13:48:36,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 2814 transitions. [2021-08-06 13:48:36,736 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 2814 transitions. Word has length 57 [2021-08-06 13:48:36,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:48:36,737 INFO L470 AbstractCegarLoop]: Abstraction has 1091 states and 2814 transitions. [2021-08-06 13:48:36,737 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 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-08-06 13:48:36,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 2814 transitions. [2021-08-06 13:48:36,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-08-06 13:48:36,740 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:48:36,740 INFO L512 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-08-06 13:48:36,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-06 13:48:36,741 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-08-06 13:48:36,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:48:36,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1220045194, now seen corresponding path program 1 times [2021-08-06 13:48:36,742 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:48:36,742 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411082704] [2021-08-06 13:48:36,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:48:36,742 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:48:36,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:48:36,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:48:36,899 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:48:36,899 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411082704] [2021-08-06 13:48:36,900 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411082704] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:48:36,900 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:48:36,900 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-06 13:48:36,900 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157398166] [2021-08-06 13:48:36,901 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-06 13:48:36,901 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:48:36,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-06 13:48:36,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-06 13:48:36,902 INFO L87 Difference]: Start difference. First operand 1091 states and 2814 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 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-08-06 13:48:37,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:48:37,022 INFO L93 Difference]: Finished difference Result 1211 states and 3094 transitions. [2021-08-06 13:48:37,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-06 13:48:37,023 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 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-08-06 13:48:37,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:48:37,027 INFO L225 Difference]: With dead ends: 1211 [2021-08-06 13:48:37,027 INFO L226 Difference]: Without dead ends: 1019 [2021-08-06 13:48:37,028 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 115.7ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-06 13:48:37,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2021-08-06 13:48:37,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 1019. [2021-08-06 13:48:37,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 1017 states have (on average 2.566371681415929) internal successors, (2610), 1018 states have internal predecessors, (2610), 0 states have call successors, (0), 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-08-06 13:48:37,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 2610 transitions. [2021-08-06 13:48:37,055 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 2610 transitions. Word has length 59 [2021-08-06 13:48:37,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:48:37,056 INFO L470 AbstractCegarLoop]: Abstraction has 1019 states and 2610 transitions. [2021-08-06 13:48:37,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 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-08-06 13:48:37,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 2610 transitions. [2021-08-06 13:48:37,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-08-06 13:48:37,058 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:48:37,059 INFO L512 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] [2021-08-06 13:48:37,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-06 13:48:37,059 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-08-06 13:48:37,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:48:37,060 INFO L82 PathProgramCache]: Analyzing trace with hash -662806256, now seen corresponding path program 1 times [2021-08-06 13:48:37,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:48:37,060 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851526842] [2021-08-06 13:48:37,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:48:37,060 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:48:37,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:48:37,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:48:37,380 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:48:37,381 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851526842] [2021-08-06 13:48:37,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851526842] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:48:37,381 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:48:37,381 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-06 13:48:37,381 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513923700] [2021-08-06 13:48:37,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-06 13:48:37,381 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:48:37,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-06 13:48:37,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-08-06 13:48:37,382 INFO L87 Difference]: Start difference. First operand 1019 states and 2610 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 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-08-06 13:48:37,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:48:37,773 INFO L93 Difference]: Finished difference Result 1092 states and 2759 transitions. [2021-08-06 13:48:37,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-06 13:48:37,774 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2021-08-06 13:48:37,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:48:37,779 INFO L225 Difference]: With dead ends: 1092 [2021-08-06 13:48:37,779 INFO L226 Difference]: Without dead ends: 932 [2021-08-06 13:48:37,780 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 259.2ms TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2021-08-06 13:48:37,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2021-08-06 13:48:37,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 932. [2021-08-06 13:48:37,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 931 states have (on average 2.544575725026853) internal successors, (2369), 931 states have internal predecessors, (2369), 0 states have call successors, (0), 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-08-06 13:48:37,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 2369 transitions. [2021-08-06 13:48:37,797 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 2369 transitions. Word has length 60 [2021-08-06 13:48:37,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:48:37,797 INFO L470 AbstractCegarLoop]: Abstraction has 932 states and 2369 transitions. [2021-08-06 13:48:37,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 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-08-06 13:48:37,797 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 2369 transitions. [2021-08-06 13:48:37,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-08-06 13:48:37,799 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:48:37,799 INFO L512 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] [2021-08-06 13:48:37,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-06 13:48:37,799 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-08-06 13:48:37,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:48:37,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1469193515, now seen corresponding path program 1 times [2021-08-06 13:48:37,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:48:37,801 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104355130] [2021-08-06 13:48:37,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:48:37,801 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:48:37,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:48:37,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:48:37,981 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:48:37,984 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104355130] [2021-08-06 13:48:37,985 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104355130] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:48:37,985 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:48:37,985 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-06 13:48:37,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263149323] [2021-08-06 13:48:37,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-06 13:48:37,986 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:48:37,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-06 13:48:37,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-06 13:48:37,987 INFO L87 Difference]: Start difference. First operand 932 states and 2369 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 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-08-06 13:48:38,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:48:38,126 INFO L93 Difference]: Finished difference Result 1294 states and 3288 transitions. [2021-08-06 13:48:38,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-06 13:48:38,127 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2021-08-06 13:48:38,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:48:38,131 INFO L225 Difference]: With dead ends: 1294 [2021-08-06 13:48:38,131 INFO L226 Difference]: Without dead ends: 686 [2021-08-06 13:48:38,131 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 130.3ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-08-06 13:48:38,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2021-08-06 13:48:38,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 686. [2021-08-06 13:48:38,167 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-08-06 13:48:38,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 1667 transitions. [2021-08-06 13:48:38,169 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 1667 transitions. Word has length 61 [2021-08-06 13:48:38,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:48:38,169 INFO L470 AbstractCegarLoop]: Abstraction has 686 states and 1667 transitions. [2021-08-06 13:48:38,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 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-08-06 13:48:38,169 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 1667 transitions. [2021-08-06 13:48:38,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-08-06 13:48:38,171 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:48:38,171 INFO L512 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-08-06 13:48:38,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-06 13:48:38,171 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-08-06 13:48:38,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:48:38,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1750354577, now seen corresponding path program 1 times [2021-08-06 13:48:38,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:48:38,172 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986296521] [2021-08-06 13:48:38,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:48:38,172 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:48:38,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:48:38,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:48:38,410 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:48:38,411 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986296521] [2021-08-06 13:48:38,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986296521] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:48:38,411 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:48:38,411 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-06 13:48:38,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408853273] [2021-08-06 13:48:38,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-06 13:48:38,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:48:38,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-06 13:48:38,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-08-06 13:48:38,412 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-08-06 13:48:38,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:48:38,699 INFO L93 Difference]: Finished difference Result 800 states and 1936 transitions. [2021-08-06 13:48:38,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-06 13:48:38,699 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-08-06 13:48:38,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:48:38,702 INFO L225 Difference]: With dead ends: 800 [2021-08-06 13:48:38,702 INFO L226 Difference]: Without dead ends: 680 [2021-08-06 13:48:38,702 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 218.2ms TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2021-08-06 13:48:38,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2021-08-06 13:48:38,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 680. [2021-08-06 13:48:38,713 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-08-06 13:48:38,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 1649 transitions. [2021-08-06 13:48:38,715 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 1649 transitions. Word has length 62 [2021-08-06 13:48:38,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:48:38,715 INFO L470 AbstractCegarLoop]: Abstraction has 680 states and 1649 transitions. [2021-08-06 13:48:38,715 INFO L471 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-08-06 13:48:38,715 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 1649 transitions. [2021-08-06 13:48:38,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-08-06 13:48:38,716 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:48:38,716 INFO L512 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-08-06 13:48:38,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-06 13:48:38,717 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-08-06 13:48:38,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:48:38,717 INFO L82 PathProgramCache]: Analyzing trace with hash -161643382, now seen corresponding path program 1 times [2021-08-06 13:48:38,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:48:38,717 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044904130] [2021-08-06 13:48:38,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:48:38,717 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:48:38,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:48:38,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:48:38,821 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:48:38,822 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044904130] [2021-08-06 13:48:38,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044904130] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:48:38,823 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:48:38,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-06 13:48:38,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361016459] [2021-08-06 13:48:38,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-06 13:48:38,823 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:48:38,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-06 13:48:38,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-06 13:48:38,824 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-08-06 13:48:38,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:48:38,938 INFO L93 Difference]: Finished difference Result 738 states and 1747 transitions. [2021-08-06 13:48:38,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-06 13:48:38,939 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-08-06 13:48:38,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:48:38,941 INFO L225 Difference]: With dead ends: 738 [2021-08-06 13:48:38,941 INFO L226 Difference]: Without dead ends: 554 [2021-08-06 13:48:38,941 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 102.5ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-06 13:48:38,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2021-08-06 13:48:38,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2021-08-06 13:48:38,949 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-08-06 13:48:38,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 1289 transitions. [2021-08-06 13:48:38,951 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 1289 transitions. Word has length 63 [2021-08-06 13:48:38,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:48:38,951 INFO L470 AbstractCegarLoop]: Abstraction has 554 states and 1289 transitions. [2021-08-06 13:48:38,951 INFO L471 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-08-06 13:48:38,951 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 1289 transitions. [2021-08-06 13:48:38,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-08-06 13:48:38,952 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:48:38,952 INFO L512 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-08-06 13:48:38,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-06 13:48:38,953 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-08-06 13:48:38,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:48:38,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1342094256, now seen corresponding path program 1 times [2021-08-06 13:48:38,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:48:38,953 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200813377] [2021-08-06 13:48:38,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:48:38,953 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:48:38,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:48:39,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:48:39,060 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:48:39,060 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200813377] [2021-08-06 13:48:39,061 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200813377] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:48:39,061 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:48:39,061 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-06 13:48:39,061 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104769654] [2021-08-06 13:48:39,061 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-06 13:48:39,061 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:48:39,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-06 13:48:39,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-06 13:48:39,062 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-08-06 13:48:39,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:48:39,180 INFO L93 Difference]: Finished difference Result 458 states and 1012 transitions. [2021-08-06 13:48:39,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-06 13:48:39,181 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-08-06 13:48:39,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:48:39,182 INFO L225 Difference]: With dead ends: 458 [2021-08-06 13:48:39,182 INFO L226 Difference]: Without dead ends: 338 [2021-08-06 13:48:39,183 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 102.9ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-08-06 13:48:39,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2021-08-06 13:48:39,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2021-08-06 13:48:39,188 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-08-06 13:48:39,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 713 transitions. [2021-08-06 13:48:39,190 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 713 transitions. Word has length 64 [2021-08-06 13:48:39,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:48:39,190 INFO L470 AbstractCegarLoop]: Abstraction has 338 states and 713 transitions. [2021-08-06 13:48:39,190 INFO L471 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-08-06 13:48:39,190 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 713 transitions. [2021-08-06 13:48:39,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-08-06 13:48:39,191 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:48:39,191 INFO L512 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-08-06 13:48:39,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-06 13:48:39,192 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-08-06 13:48:39,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:48:39,192 INFO L82 PathProgramCache]: Analyzing trace with hash -2129950482, now seen corresponding path program 1 times [2021-08-06 13:48:39,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:48:39,192 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143839972] [2021-08-06 13:48:39,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:48:39,192 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:48:39,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:48:39,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:48:39,455 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:48:39,455 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143839972] [2021-08-06 13:48:39,455 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143839972] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:48:39,455 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:48:39,455 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-06 13:48:39,455 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669255847] [2021-08-06 13:48:39,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-06 13:48:39,455 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:48:39,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-06 13:48:39,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-08-06 13:48:39,456 INFO L87 Difference]: Start difference. First operand 338 states and 713 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 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-08-06 13:48:39,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:48:39,588 INFO L93 Difference]: Finished difference Result 488 states and 1056 transitions. [2021-08-06 13:48:39,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-06 13:48:39,588 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 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-08-06 13:48:39,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:48:39,589 INFO L225 Difference]: With dead ends: 488 [2021-08-06 13:48:39,590 INFO L226 Difference]: Without dead ends: 274 [2021-08-06 13:48:39,590 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 135.9ms TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-08-06 13:48:39,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2021-08-06 13:48:39,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2021-08-06 13:48:39,594 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-08-06 13:48:39,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 561 transitions. [2021-08-06 13:48:39,594 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 561 transitions. Word has length 67 [2021-08-06 13:48:39,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:48:39,595 INFO L470 AbstractCegarLoop]: Abstraction has 274 states and 561 transitions. [2021-08-06 13:48:39,595 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 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-08-06 13:48:39,595 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 561 transitions. [2021-08-06 13:48:39,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-08-06 13:48:39,598 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:48:39,599 INFO L512 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-08-06 13:48:39,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-06 13:48:39,599 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-08-06 13:48:39,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:48:39,599 INFO L82 PathProgramCache]: Analyzing trace with hash -526201332, now seen corresponding path program 2 times [2021-08-06 13:48:39,599 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:48:39,599 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333009931] [2021-08-06 13:48:39,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:48:39,600 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:48:39,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-06 13:48:39,632 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-06 13:48:39,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-06 13:48:39,708 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-06 13:48:39,709 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-06 13:48:39,710 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-06 13:48:39,711 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-08-06 13:48:39,712 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-08-06 13:48:39,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-06 13:48:39,715 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN (1/2) [2021-08-06 13:48:39,722 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-06 13:48:39,722 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-06 13:48:39,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.08 01:48:39 BasicIcfg [2021-08-06 13:48:39,794 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-06 13:48:39,794 INFO L168 Benchmark]: Toolchain (without parser) took 6663.71 ms. Allocated memory was 127.9 MB in the beginning and 310.4 MB in the end (delta: 182.5 MB). Free memory was 91.2 MB in the beginning and 273.7 MB in the end (delta: -182.5 MB). Peak memory consumption was 172.4 MB. Max. memory is 8.0 GB. [2021-08-06 13:48:39,794 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 127.9 MB. Free memory was 109.2 MB in the beginning and 109.1 MB in the end (delta: 89.2 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-08-06 13:48:39,794 INFO L168 Benchmark]: CACSL2BoogieTranslator took 422.45 ms. Allocated memory was 127.9 MB in the beginning and 204.5 MB in the end (delta: 76.5 MB). Free memory was 91.0 MB in the beginning and 179.1 MB in the end (delta: -88.1 MB). Peak memory consumption was 7.0 MB. Max. memory is 8.0 GB. [2021-08-06 13:48:39,794 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.71 ms. Allocated memory is still 204.5 MB. Free memory was 179.1 MB in the beginning and 176.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-06 13:48:39,795 INFO L168 Benchmark]: Boogie Preprocessor took 23.02 ms. Allocated memory is still 204.5 MB. Free memory was 176.3 MB in the beginning and 174.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-06 13:48:39,795 INFO L168 Benchmark]: RCFGBuilder took 1832.86 ms. Allocated memory was 204.5 MB in the beginning and 252.7 MB in the end (delta: 48.2 MB). Free memory was 174.2 MB in the beginning and 187.5 MB in the end (delta: -13.3 MB). Peak memory consumption was 70.7 MB. Max. memory is 8.0 GB. [2021-08-06 13:48:39,795 INFO L168 Benchmark]: TraceAbstraction took 4334.84 ms. Allocated memory was 252.7 MB in the beginning and 310.4 MB in the end (delta: 57.7 MB). Free memory was 187.5 MB in the beginning and 273.7 MB in the end (delta: -86.2 MB). Peak memory consumption was 142.9 MB. Max. memory is 8.0 GB. [2021-08-06 13:48:39,795 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 127.9 MB. Free memory was 109.2 MB in the beginning and 109.1 MB in the end (delta: 89.2 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 422.45 ms. Allocated memory was 127.9 MB in the beginning and 204.5 MB in the end (delta: 76.5 MB). Free memory was 91.0 MB in the beginning and 179.1 MB in the end (delta: -88.1 MB). Peak memory consumption was 7.0 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 44.71 ms. Allocated memory is still 204.5 MB. Free memory was 179.1 MB in the beginning and 176.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 23.02 ms. Allocated memory is still 204.5 MB. Free memory was 176.3 MB in the beginning and 174.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1832.86 ms. Allocated memory was 204.5 MB in the beginning and 252.7 MB in the end (delta: 48.2 MB). Free memory was 174.2 MB in the beginning and 187.5 MB in the end (delta: -13.3 MB). Peak memory consumption was 70.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 4334.84 ms. Allocated memory was 252.7 MB in the beginning and 310.4 MB in the end (delta: 57.7 MB). Free memory was 187.5 MB in the beginning and 273.7 MB in the end (delta: -86.2 MB). Peak memory consumption was 142.9 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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 t2013; 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(&t2013, ((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 t2014; 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(&t2014, ((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] - UnprovableResult [Line: 795]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 793]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 104 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 4175.9ms, OverallIterations: 9, TraceHistogramMax: 1, EmptinessCheckTime: 40.9ms, AutomataDifference: 1760.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 53.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 770 SDtfs, 1076 SDslu, 2934 SDs, 0 SdLazy, 481 SolverSat, 84 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 527.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 118 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 1369.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1251occurred in iteration=0, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 194.2ms AutomataMinimizationTime, 8 MinimizatonAttempts, 6 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 29.6ms SsaConstructionTime, 332.4ms SatisfiabilityAnalysisTime, 1527.8ms InterpolantComputationTime, 560 NumberOfCodeBlocks, 560 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 485 ConstructedInterpolants, 0 QuantifiedInterpolants, 2639 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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! [2021-08-06 13:48:39,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...