/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/safe031_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-87fd7473a0bda1db0ad7f77f2116346063730f21-87fd747 [2021-08-21 11:43:27,239 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-21 11:43:27,241 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-21 11:43:27,303 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-21 11:43:27,303 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-21 11:43:27,306 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-21 11:43:27,308 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-21 11:43:27,312 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-21 11:43:27,314 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-21 11:43:27,319 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-21 11:43:27,319 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-21 11:43:27,320 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-21 11:43:27,321 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-21 11:43:27,323 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-21 11:43:27,324 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-21 11:43:27,327 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-21 11:43:27,328 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-21 11:43:27,328 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-21 11:43:27,331 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-21 11:43:27,335 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-21 11:43:27,336 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-21 11:43:27,337 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-21 11:43:27,338 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-21 11:43:27,339 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-21 11:43:27,343 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-21 11:43:27,343 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-21 11:43:27,344 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-21 11:43:27,344 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-21 11:43:27,344 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-21 11:43:27,345 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-21 11:43:27,345 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-21 11:43:27,346 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-21 11:43:27,346 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-21 11:43:27,347 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-21 11:43:27,347 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-21 11:43:27,348 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-21 11:43:27,348 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-21 11:43:27,348 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-21 11:43:27,348 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-21 11:43:27,349 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-21 11:43:27,349 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-21 11:43:27,352 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-21 11:43:27,384 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-21 11:43:27,384 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-21 11:43:27,385 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-21 11:43:27,385 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-21 11:43:27,387 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-21 11:43:27,387 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-21 11:43:27,387 INFO L138 SettingsManager]: * Use SBE=true [2021-08-21 11:43:27,387 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-21 11:43:27,387 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-21 11:43:27,388 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-21 11:43:27,388 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-21 11:43:27,388 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-21 11:43:27,388 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-21 11:43:27,388 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-21 11:43:27,389 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-21 11:43:27,389 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-21 11:43:27,389 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-21 11:43:27,389 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-21 11:43:27,389 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-21 11:43:27,389 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-21 11:43:27,389 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-21 11:43:27,389 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-21 11:43:27,389 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-21 11:43:27,389 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-21 11:43:27,389 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-21 11:43:27,390 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-21 11:43:27,390 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-21 11:43:27,390 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-21 11:43:27,390 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-21 11:43:27,390 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-21 11:43:27,390 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-21 11:43:27,390 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-08-21 11:43:27,628 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-21 11:43:27,644 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-21 11:43:27,645 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-21 11:43:27,646 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-21 11:43:27,646 INFO L275 PluginConnector]: CDTParser initialized [2021-08-21 11:43:27,647 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_rmo.opt.i [2021-08-21 11:43:27,686 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adffc32ab/fc83d825c2f94f2f95f3fdaa0e27d371/FLAGf0c831f3c [2021-08-21 11:43:28,128 INFO L306 CDTParser]: Found 1 translation units. [2021-08-21 11:43:28,128 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_rmo.opt.i [2021-08-21 11:43:28,145 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adffc32ab/fc83d825c2f94f2f95f3fdaa0e27d371/FLAGf0c831f3c [2021-08-21 11:43:28,485 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adffc32ab/fc83d825c2f94f2f95f3fdaa0e27d371 [2021-08-21 11:43:28,487 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-21 11:43:28,489 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-21 11:43:28,490 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-21 11:43:28,490 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-21 11:43:28,495 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-21 11:43:28,496 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 11:43:28" (1/1) ... [2021-08-21 11:43:28,497 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f9e8c38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:43:28, skipping insertion in model container [2021-08-21 11:43:28,498 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 11:43:28" (1/1) ... [2021-08-21 11:43:28,502 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-21 11:43:28,561 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-21 11:43:28,654 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_rmo.opt.i[949,962] [2021-08-21 11:43:28,856 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-21 11:43:28,861 INFO L203 MainTranslator]: Completed pre-run [2021-08-21 11:43:28,870 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_rmo.opt.i[949,962] [2021-08-21 11:43:28,919 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-21 11:43:28,950 INFO L208 MainTranslator]: Completed translation [2021-08-21 11:43:28,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:43:28 WrapperNode [2021-08-21 11:43:28,950 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-21 11:43:28,951 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-21 11:43:28,951 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-21 11:43:28,951 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-21 11:43:28,956 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:43:28" (1/1) ... [2021-08-21 11:43:28,983 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:43:28" (1/1) ... [2021-08-21 11:43:29,016 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-21 11:43:29,017 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-21 11:43:29,017 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-21 11:43:29,017 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-21 11:43:29,022 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:43:28" (1/1) ... [2021-08-21 11:43:29,022 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:43:28" (1/1) ... [2021-08-21 11:43:29,036 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:43:28" (1/1) ... [2021-08-21 11:43:29,037 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:43:28" (1/1) ... [2021-08-21 11:43:29,051 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:43:28" (1/1) ... [2021-08-21 11:43:29,053 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:43:28" (1/1) ... [2021-08-21 11:43:29,055 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:43:28" (1/1) ... [2021-08-21 11:43:29,057 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-21 11:43:29,057 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-21 11:43:29,057 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-21 11:43:29,057 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-21 11:43:29,058 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:43:28" (1/1) ... [2021-08-21 11:43:29,072 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-21 11:43:29,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-21 11:43:29,086 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-21 11:43:29,105 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-21 11:43:29,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-21 11:43:29,125 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-21 11:43:29,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-21 11:43:29,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-21 11:43:29,126 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-21 11:43:29,126 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-21 11:43:29,126 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-21 11:43:29,126 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-21 11:43:29,126 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-08-21 11:43:29,126 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-08-21 11:43:29,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-21 11:43:29,126 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-21 11:43:29,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-21 11:43:29,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-21 11:43:29,128 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-21 11:43:30,858 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-21 11:43:30,859 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-21 11:43:30,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 11:43:30 BoogieIcfgContainer [2021-08-21 11:43:30,860 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-21 11:43:30,862 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-21 11:43:30,862 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-21 11:43:30,863 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-21 11:43:30,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.08 11:43:28" (1/3) ... [2021-08-21 11:43:30,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25b8cc01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 11:43:30, skipping insertion in model container [2021-08-21 11:43:30,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:43:28" (2/3) ... [2021-08-21 11:43:30,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25b8cc01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 11:43:30, skipping insertion in model container [2021-08-21 11:43:30,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 11:43:30" (3/3) ... [2021-08-21 11:43:30,865 INFO L111 eAbstractionObserver]: Analyzing ICFG safe031_rmo.opt.i [2021-08-21 11:43:30,869 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-08-21 11:43:30,869 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-21 11:43:30,869 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-21 11:43:30,869 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-21 11:43:30,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,896 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,897 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,897 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,897 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,898 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,898 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,898 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,898 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,898 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,898 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,898 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,898 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,898 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,898 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,898 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,899 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,899 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,899 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,899 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,899 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,899 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,899 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,899 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,899 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,900 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,900 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,900 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,900 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,900 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,900 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,900 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,901 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,901 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,901 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,901 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,901 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,901 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,901 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,901 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,901 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,901 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,901 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,902 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,902 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,902 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,902 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,902 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,902 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,902 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,902 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,902 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,902 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,902 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,903 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,903 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,903 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,903 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,903 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,903 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,903 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,904 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,904 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,904 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,904 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,906 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,906 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,906 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,907 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,907 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,907 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,907 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,907 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,907 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,907 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,907 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,907 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,909 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,909 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,909 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,910 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,911 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,911 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,911 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,911 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,911 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,912 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,912 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,912 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,912 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,912 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:43:30,914 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-21 11:43:30,939 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-21 11:43:30,943 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-21 11:43:30,943 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-08-21 11:43:30,950 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 113 places, 105 transitions, 225 flow [2021-08-21 11:43:31,195 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 10392 states, 10389 states have (on average 3.547020887477139) internal successors, (36850), 10391 states have internal predecessors, (36850), 0 states have call successors, (0), 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-21 11:43:31,223 INFO L276 IsEmpty]: Start isEmpty. Operand has 10392 states, 10389 states have (on average 3.547020887477139) internal successors, (36850), 10391 states have internal predecessors, (36850), 0 states have call successors, (0), 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-21 11:43:31,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-08-21 11:43:31,233 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:43:31,233 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] [2021-08-21 11:43:31,233 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:43:31,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:43:31,238 INFO L82 PathProgramCache]: Analyzing trace with hash 656848398, now seen corresponding path program 1 times [2021-08-21 11:43:31,244 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:43:31,244 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309336618] [2021-08-21 11:43:31,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:43:31,245 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:43:31,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:43:31,497 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-21 11:43:31,497 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:43:31,497 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309336618] [2021-08-21 11:43:31,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309336618] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:43:31,498 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:43:31,498 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-21 11:43:31,499 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655060745] [2021-08-21 11:43:31,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-21 11:43:31,502 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:43:31,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-21 11:43:31,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-21 11:43:31,565 INFO L87 Difference]: Start difference. First operand has 10392 states, 10389 states have (on average 3.547020887477139) internal successors, (36850), 10391 states have internal predecessors, (36850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 27.5) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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-21 11:43:31,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:43:31,799 INFO L93 Difference]: Finished difference Result 8768 states and 30229 transitions. [2021-08-21 11:43:31,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-21 11:43:31,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 27.5) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2021-08-21 11:43:31,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:43:31,869 INFO L225 Difference]: With dead ends: 8768 [2021-08-21 11:43:31,869 INFO L226 Difference]: Without dead ends: 7200 [2021-08-21 11:43:31,870 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-21 11:43:31,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7200 states. [2021-08-21 11:43:32,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7200 to 7200. [2021-08-21 11:43:32,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7200 states, 7199 states have (on average 3.471732185025698) internal successors, (24993), 7199 states have internal predecessors, (24993), 0 states have call successors, (0), 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-21 11:43:32,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7200 states to 7200 states and 24993 transitions. [2021-08-21 11:43:32,161 INFO L78 Accepts]: Start accepts. Automaton has 7200 states and 24993 transitions. Word has length 55 [2021-08-21 11:43:32,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:43:32,162 INFO L470 AbstractCegarLoop]: Abstraction has 7200 states and 24993 transitions. [2021-08-21 11:43:32,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 27.5) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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-21 11:43:32,162 INFO L276 IsEmpty]: Start isEmpty. Operand 7200 states and 24993 transitions. [2021-08-21 11:43:32,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-08-21 11:43:32,249 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:43:32,249 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-21 11:43:32,249 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-21 11:43:32,250 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:43:32,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:43:32,250 INFO L82 PathProgramCache]: Analyzing trace with hash 685451183, now seen corresponding path program 1 times [2021-08-21 11:43:32,250 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:43:32,250 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535587976] [2021-08-21 11:43:32,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:43:32,251 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:43:32,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:43:32,480 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-21 11:43:32,481 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:43:32,481 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535587976] [2021-08-21 11:43:32,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535587976] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:43:32,481 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:43:32,481 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-21 11:43:32,481 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577334303] [2021-08-21 11:43:32,497 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-21 11:43:32,497 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:43:32,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-21 11:43:32,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-21 11:43:32,498 INFO L87 Difference]: Start difference. First operand 7200 states and 24993 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 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-21 11:43:32,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:43:32,650 INFO L93 Difference]: Finished difference Result 8704 states and 29941 transitions. [2021-08-21 11:43:32,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-21 11:43:32,650 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 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-21 11:43:32,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:43:32,686 INFO L225 Difference]: With dead ends: 8704 [2021-08-21 11:43:32,687 INFO L226 Difference]: Without dead ends: 6912 [2021-08-21 11:43:32,687 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 65.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-21 11:43:32,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6912 states. [2021-08-21 11:43:32,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6912 to 6912. [2021-08-21 11:43:32,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6912 states, 6911 states have (on average 3.4549269280856607) internal successors, (23877), 6911 states have internal predecessors, (23877), 0 states have call successors, (0), 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-21 11:43:32,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6912 states to 6912 states and 23877 transitions. [2021-08-21 11:43:32,926 INFO L78 Accepts]: Start accepts. Automaton has 6912 states and 23877 transitions. Word has length 67 [2021-08-21 11:43:32,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:43:32,926 INFO L470 AbstractCegarLoop]: Abstraction has 6912 states and 23877 transitions. [2021-08-21 11:43:32,927 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 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-21 11:43:32,927 INFO L276 IsEmpty]: Start isEmpty. Operand 6912 states and 23877 transitions. [2021-08-21 11:43:32,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-08-21 11:43:32,938 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:43:32,938 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, 1, 1] [2021-08-21 11:43:32,938 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-21 11:43:32,939 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:43:32,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:43:32,945 INFO L82 PathProgramCache]: Analyzing trace with hash 426544400, now seen corresponding path program 1 times [2021-08-21 11:43:32,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:43:32,946 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271980405] [2021-08-21 11:43:32,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:43:32,946 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:43:33,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:43:33,308 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-21 11:43:33,308 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:43:33,308 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271980405] [2021-08-21 11:43:33,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271980405] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:43:33,308 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:43:33,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-21 11:43:33,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435960239] [2021-08-21 11:43:33,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-21 11:43:33,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:43:33,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-21 11:43:33,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-08-21 11:43:33,310 INFO L87 Difference]: Start difference. First operand 6912 states and 23877 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 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-21 11:43:33,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:43:33,550 INFO L93 Difference]: Finished difference Result 8054 states and 27603 transitions. [2021-08-21 11:43:33,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-21 11:43:33,550 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2021-08-21 11:43:33,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:43:33,647 INFO L225 Difference]: With dead ends: 8054 [2021-08-21 11:43:33,647 INFO L226 Difference]: Without dead ends: 6774 [2021-08-21 11:43:33,648 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 137.3ms TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2021-08-21 11:43:33,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6774 states. [2021-08-21 11:43:33,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6774 to 6732. [2021-08-21 11:43:33,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6732 states, 6731 states have (on average 3.4456990046055562) internal successors, (23193), 6731 states have internal predecessors, (23193), 0 states have call successors, (0), 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-21 11:43:33,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6732 states to 6732 states and 23193 transitions. [2021-08-21 11:43:33,814 INFO L78 Accepts]: Start accepts. Automaton has 6732 states and 23193 transitions. Word has length 69 [2021-08-21 11:43:33,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:43:33,817 INFO L470 AbstractCegarLoop]: Abstraction has 6732 states and 23193 transitions. [2021-08-21 11:43:33,821 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 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-21 11:43:33,822 INFO L276 IsEmpty]: Start isEmpty. Operand 6732 states and 23193 transitions. [2021-08-21 11:43:33,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-08-21 11:43:33,832 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:43:33,833 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, 1, 1, 1] [2021-08-21 11:43:33,833 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-21 11:43:33,833 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:43:33,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:43:33,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1481738172, now seen corresponding path program 1 times [2021-08-21 11:43:33,834 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:43:33,834 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338194545] [2021-08-21 11:43:33,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:43:33,834 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:43:33,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:43:33,977 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-21 11:43:33,977 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:43:33,978 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338194545] [2021-08-21 11:43:33,980 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338194545] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:43:33,980 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:43:33,980 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-21 11:43:33,980 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183466103] [2021-08-21 11:43:33,981 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-21 11:43:33,981 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:43:33,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-21 11:43:33,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-21 11:43:33,982 INFO L87 Difference]: Start difference. First operand 6732 states and 23193 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 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-21 11:43:34,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:43:34,268 INFO L93 Difference]: Finished difference Result 11172 states and 37990 transitions. [2021-08-21 11:43:34,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-21 11:43:34,270 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2021-08-21 11:43:34,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:43:34,296 INFO L225 Difference]: With dead ends: 11172 [2021-08-21 11:43:34,296 INFO L226 Difference]: Without dead ends: 7452 [2021-08-21 11:43:34,296 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 92.7ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-21 11:43:34,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7452 states. [2021-08-21 11:43:34,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7452 to 6252. [2021-08-21 11:43:34,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6252 states, 6251 states have (on average 3.3705007198848183) internal successors, (21069), 6251 states have internal predecessors, (21069), 0 states have call successors, (0), 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-21 11:43:34,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6252 states to 6252 states and 21069 transitions. [2021-08-21 11:43:34,447 INFO L78 Accepts]: Start accepts. Automaton has 6252 states and 21069 transitions. Word has length 70 [2021-08-21 11:43:34,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:43:34,448 INFO L470 AbstractCegarLoop]: Abstraction has 6252 states and 21069 transitions. [2021-08-21 11:43:34,448 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 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-21 11:43:34,448 INFO L276 IsEmpty]: Start isEmpty. Operand 6252 states and 21069 transitions. [2021-08-21 11:43:34,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-08-21 11:43:34,458 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:43:34,458 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, 1, 1, 1, 1] [2021-08-21 11:43:34,458 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-21 11:43:34,458 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:43:34,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:43:34,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1207230638, now seen corresponding path program 1 times [2021-08-21 11:43:34,459 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:43:34,459 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677810187] [2021-08-21 11:43:34,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:43:34,459 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:43:34,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:43:34,665 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-21 11:43:34,666 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:43:34,666 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677810187] [2021-08-21 11:43:34,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677810187] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:43:34,666 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:43:34,666 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-21 11:43:34,666 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793106969] [2021-08-21 11:43:34,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-21 11:43:34,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:43:34,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-21 11:43:34,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-08-21 11:43:34,667 INFO L87 Difference]: Start difference. First operand 6252 states and 21069 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 0 states have call successors, (0), 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-21 11:43:34,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:43:34,875 INFO L93 Difference]: Finished difference Result 7032 states and 23543 transitions. [2021-08-21 11:43:34,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-21 11:43:34,876 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2021-08-21 11:43:34,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:43:34,895 INFO L225 Difference]: With dead ends: 7032 [2021-08-21 11:43:34,895 INFO L226 Difference]: Without dead ends: 6072 [2021-08-21 11:43:34,895 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 128.5ms TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2021-08-21 11:43:34,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6072 states. [2021-08-21 11:43:35,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6072 to 6072. [2021-08-21 11:43:35,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6072 states, 6071 states have (on average 3.3577664305715698) internal successors, (20385), 6071 states have internal predecessors, (20385), 0 states have call successors, (0), 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-21 11:43:35,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6072 states to 6072 states and 20385 transitions. [2021-08-21 11:43:35,049 INFO L78 Accepts]: Start accepts. Automaton has 6072 states and 20385 transitions. Word has length 71 [2021-08-21 11:43:35,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:43:35,049 INFO L470 AbstractCegarLoop]: Abstraction has 6072 states and 20385 transitions. [2021-08-21 11:43:35,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 0 states have call successors, (0), 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-21 11:43:35,050 INFO L276 IsEmpty]: Start isEmpty. Operand 6072 states and 20385 transitions. [2021-08-21 11:43:35,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-08-21 11:43:35,062 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:43:35,062 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, 1, 1, 1, 1, 1] [2021-08-21 11:43:35,062 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-21 11:43:35,063 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:43:35,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:43:35,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1262993744, now seen corresponding path program 1 times [2021-08-21 11:43:35,063 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:43:35,063 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225662150] [2021-08-21 11:43:35,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:43:35,064 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:43:35,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:43:35,176 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-21 11:43:35,176 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:43:35,176 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225662150] [2021-08-21 11:43:35,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225662150] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:43:35,177 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:43:35,177 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-21 11:43:35,177 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083098945] [2021-08-21 11:43:35,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-21 11:43:35,177 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:43:35,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-21 11:43:35,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-21 11:43:35,178 INFO L87 Difference]: Start difference. First operand 6072 states and 20385 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 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-21 11:43:35,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:43:35,443 INFO L93 Difference]: Finished difference Result 6886 states and 23015 transitions. [2021-08-21 11:43:35,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-21 11:43:35,457 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2021-08-21 11:43:35,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:43:35,476 INFO L225 Difference]: With dead ends: 6886 [2021-08-21 11:43:35,476 INFO L226 Difference]: Without dead ends: 6086 [2021-08-21 11:43:35,477 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 113.1ms TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2021-08-21 11:43:35,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6086 states. [2021-08-21 11:43:35,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6086 to 6086. [2021-08-21 11:43:35,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6086 states, 6085 states have (on average 3.3566146261298275) internal successors, (20425), 6085 states have internal predecessors, (20425), 0 states have call successors, (0), 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-21 11:43:35,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6086 states to 6086 states and 20425 transitions. [2021-08-21 11:43:35,728 INFO L78 Accepts]: Start accepts. Automaton has 6086 states and 20425 transitions. Word has length 72 [2021-08-21 11:43:35,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:43:35,729 INFO L470 AbstractCegarLoop]: Abstraction has 6086 states and 20425 transitions. [2021-08-21 11:43:35,729 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 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-21 11:43:35,729 INFO L276 IsEmpty]: Start isEmpty. Operand 6086 states and 20425 transitions. [2021-08-21 11:43:35,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-08-21 11:43:35,740 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:43:35,741 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, 1, 1, 1, 1, 1] [2021-08-21 11:43:35,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-21 11:43:35,741 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:43:35,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:43:35,742 INFO L82 PathProgramCache]: Analyzing trace with hash 90236014, now seen corresponding path program 2 times [2021-08-21 11:43:35,742 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:43:35,746 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888349318] [2021-08-21 11:43:35,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:43:35,746 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:43:35,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:43:35,968 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-21 11:43:35,969 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:43:35,969 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888349318] [2021-08-21 11:43:35,969 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888349318] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:43:35,969 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:43:35,969 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-21 11:43:35,969 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040472494] [2021-08-21 11:43:35,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-21 11:43:35,970 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:43:35,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-21 11:43:35,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-08-21 11:43:35,970 INFO L87 Difference]: Start difference. First operand 6086 states and 20425 transitions. Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 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-21 11:43:36,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:43:36,272 INFO L93 Difference]: Finished difference Result 6826 states and 22787 transitions. [2021-08-21 11:43:36,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-21 11:43:36,273 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2021-08-21 11:43:36,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:43:36,295 INFO L225 Difference]: With dead ends: 6826 [2021-08-21 11:43:36,295 INFO L226 Difference]: Without dead ends: 6026 [2021-08-21 11:43:36,296 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 179.8ms TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2021-08-21 11:43:36,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6026 states. [2021-08-21 11:43:36,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6026 to 6012. [2021-08-21 11:43:36,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6012 states, 6011 states have (on average 3.353352187655964) internal successors, (20157), 6011 states have internal predecessors, (20157), 0 states have call successors, (0), 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-21 11:43:36,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6012 states to 6012 states and 20157 transitions. [2021-08-21 11:43:36,415 INFO L78 Accepts]: Start accepts. Automaton has 6012 states and 20157 transitions. Word has length 72 [2021-08-21 11:43:36,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:43:36,416 INFO L470 AbstractCegarLoop]: Abstraction has 6012 states and 20157 transitions. [2021-08-21 11:43:36,416 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 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-21 11:43:36,416 INFO L276 IsEmpty]: Start isEmpty. Operand 6012 states and 20157 transitions. [2021-08-21 11:43:36,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-08-21 11:43:36,425 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:43:36,425 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, 1, 1, 1, 1, 1, 1] [2021-08-21 11:43:36,426 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-21 11:43:36,426 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:43:36,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:43:36,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1180876120, now seen corresponding path program 1 times [2021-08-21 11:43:36,426 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:43:36,426 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645743555] [2021-08-21 11:43:36,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:43:36,427 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:43:36,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:43:36,573 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-21 11:43:36,574 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:43:36,574 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645743555] [2021-08-21 11:43:36,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645743555] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:43:36,574 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:43:36,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-21 11:43:36,574 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514644299] [2021-08-21 11:43:36,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-21 11:43:36,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:43:36,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-21 11:43:36,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-08-21 11:43:36,575 INFO L87 Difference]: Start difference. First operand 6012 states and 20157 transitions. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 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-21 11:43:36,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:43:36,812 INFO L93 Difference]: Finished difference Result 6426 states and 21417 transitions. [2021-08-21 11:43:36,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-21 11:43:36,812 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2021-08-21 11:43:36,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:43:36,828 INFO L225 Difference]: With dead ends: 6426 [2021-08-21 11:43:36,828 INFO L226 Difference]: Without dead ends: 5786 [2021-08-21 11:43:36,829 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 141.2ms TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2021-08-21 11:43:36,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5786 states. [2021-08-21 11:43:36,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5786 to 5772. [2021-08-21 11:43:36,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5772 states, 5771 states have (on average 3.345174146595044) internal successors, (19305), 5771 states have internal predecessors, (19305), 0 states have call successors, (0), 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-21 11:43:36,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5772 states to 5772 states and 19305 transitions. [2021-08-21 11:43:36,955 INFO L78 Accepts]: Start accepts. Automaton has 5772 states and 19305 transitions. Word has length 73 [2021-08-21 11:43:36,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:43:36,955 INFO L470 AbstractCegarLoop]: Abstraction has 5772 states and 19305 transitions. [2021-08-21 11:43:36,955 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 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-21 11:43:36,955 INFO L276 IsEmpty]: Start isEmpty. Operand 5772 states and 19305 transitions. [2021-08-21 11:43:36,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-08-21 11:43:36,966 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:43:36,966 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, 1, 1, 1, 1, 1, 1] [2021-08-21 11:43:36,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-21 11:43:36,967 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:43:36,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:43:36,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1873790695, now seen corresponding path program 1 times [2021-08-21 11:43:36,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:43:36,967 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799296180] [2021-08-21 11:43:36,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:43:36,967 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:43:36,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:43:37,054 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-21 11:43:37,054 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:43:37,054 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799296180] [2021-08-21 11:43:37,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799296180] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:43:37,055 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:43:37,055 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-21 11:43:37,055 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088694199] [2021-08-21 11:43:37,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-21 11:43:37,055 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:43:37,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-21 11:43:37,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-21 11:43:37,056 INFO L87 Difference]: Start difference. First operand 5772 states and 19305 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 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-21 11:43:37,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:43:37,179 INFO L93 Difference]: Finished difference Result 6856 states and 22489 transitions. [2021-08-21 11:43:37,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-21 11:43:37,180 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2021-08-21 11:43:37,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:43:37,199 INFO L225 Difference]: With dead ends: 6856 [2021-08-21 11:43:37,199 INFO L226 Difference]: Without dead ends: 5064 [2021-08-21 11:43:37,200 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 68.2ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-21 11:43:37,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5064 states. [2021-08-21 11:43:37,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5064 to 5064. [2021-08-21 11:43:37,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5064 states, 5063 states have (on average 3.2654552636776613) internal successors, (16533), 5063 states have internal predecessors, (16533), 0 states have call successors, (0), 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-21 11:43:37,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5064 states to 5064 states and 16533 transitions. [2021-08-21 11:43:37,310 INFO L78 Accepts]: Start accepts. Automaton has 5064 states and 16533 transitions. Word has length 73 [2021-08-21 11:43:37,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:43:37,310 INFO L470 AbstractCegarLoop]: Abstraction has 5064 states and 16533 transitions. [2021-08-21 11:43:37,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 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-21 11:43:37,311 INFO L276 IsEmpty]: Start isEmpty. Operand 5064 states and 16533 transitions. [2021-08-21 11:43:37,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-08-21 11:43:37,319 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:43:37,320 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, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:43:37,320 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-21 11:43:37,320 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:43:37,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:43:37,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1708363064, now seen corresponding path program 1 times [2021-08-21 11:43:37,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:43:37,321 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124871863] [2021-08-21 11:43:37,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:43:37,321 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:43:37,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:43:37,400 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-21 11:43:37,400 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:43:37,400 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124871863] [2021-08-21 11:43:37,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124871863] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:43:37,400 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:43:37,400 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-21 11:43:37,400 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161527240] [2021-08-21 11:43:37,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-21 11:43:37,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:43:37,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-21 11:43:37,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-21 11:43:37,401 INFO L87 Difference]: Start difference. First operand 5064 states and 16533 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 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-21 11:43:37,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:43:37,589 INFO L93 Difference]: Finished difference Result 4836 states and 15310 transitions. [2021-08-21 11:43:37,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-21 11:43:37,605 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2021-08-21 11:43:37,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:43:37,614 INFO L225 Difference]: With dead ends: 4836 [2021-08-21 11:43:37,614 INFO L226 Difference]: Without dead ends: 3444 [2021-08-21 11:43:37,620 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 70.0ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-08-21 11:43:37,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3444 states. [2021-08-21 11:43:37,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3444 to 3444. [2021-08-21 11:43:37,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3444 states, 3443 states have (on average 3.113273308161487) internal successors, (10719), 3443 states have internal predecessors, (10719), 0 states have call successors, (0), 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-21 11:43:37,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3444 states to 3444 states and 10719 transitions. [2021-08-21 11:43:37,707 INFO L78 Accepts]: Start accepts. Automaton has 3444 states and 10719 transitions. Word has length 74 [2021-08-21 11:43:37,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:43:37,707 INFO L470 AbstractCegarLoop]: Abstraction has 3444 states and 10719 transitions. [2021-08-21 11:43:37,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 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-21 11:43:37,707 INFO L276 IsEmpty]: Start isEmpty. Operand 3444 states and 10719 transitions. [2021-08-21 11:43:37,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-08-21 11:43:37,712 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:43:37,712 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:43:37,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-21 11:43:37,712 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:43:37,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:43:37,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1511885559, now seen corresponding path program 1 times [2021-08-21 11:43:37,713 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:43:37,713 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577021269] [2021-08-21 11:43:37,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:43:37,713 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:43:37,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:43:37,817 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-21 11:43:37,818 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:43:37,818 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577021269] [2021-08-21 11:43:37,818 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577021269] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:43:37,818 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:43:37,818 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-21 11:43:37,818 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444056084] [2021-08-21 11:43:37,818 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-21 11:43:37,818 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:43:37,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-21 11:43:37,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-21 11:43:37,819 INFO L87 Difference]: Start difference. First operand 3444 states and 10719 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 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-21 11:43:37,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:43:37,950 INFO L93 Difference]: Finished difference Result 2760 states and 8394 transitions. [2021-08-21 11:43:37,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-21 11:43:37,950 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2021-08-21 11:43:37,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:43:37,954 INFO L225 Difference]: With dead ends: 2760 [2021-08-21 11:43:37,954 INFO L226 Difference]: Without dead ends: 1473 [2021-08-21 11:43:37,955 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 78.1ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-08-21 11:43:37,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states. [2021-08-21 11:43:37,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 1473. [2021-08-21 11:43:37,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1473 states, 1472 states have (on average 3.004755434782609) internal successors, (4423), 1472 states have internal predecessors, (4423), 0 states have call successors, (0), 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-21 11:43:37,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1473 states to 1473 states and 4423 transitions. [2021-08-21 11:43:37,978 INFO L78 Accepts]: Start accepts. Automaton has 1473 states and 4423 transitions. Word has length 76 [2021-08-21 11:43:37,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:43:37,978 INFO L470 AbstractCegarLoop]: Abstraction has 1473 states and 4423 transitions. [2021-08-21 11:43:37,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 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-21 11:43:37,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1473 states and 4423 transitions. [2021-08-21 11:43:37,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-08-21 11:43:37,981 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:43:37,981 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:43:37,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-21 11:43:37,981 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:43:37,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:43:37,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1967697918, now seen corresponding path program 1 times [2021-08-21 11:43:37,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:43:37,982 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283234707] [2021-08-21 11:43:37,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:43:37,982 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:43:38,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:43:38,159 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-21 11:43:38,159 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:43:38,159 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283234707] [2021-08-21 11:43:38,160 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283234707] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:43:38,160 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:43:38,160 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-21 11:43:38,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456965891] [2021-08-21 11:43:38,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-21 11:43:38,160 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:43:38,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-21 11:43:38,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-08-21 11:43:38,161 INFO L87 Difference]: Start difference. First operand 1473 states and 4423 transitions. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:43:38,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:43:38,306 INFO L93 Difference]: Finished difference Result 2298 states and 6962 transitions. [2021-08-21 11:43:38,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-21 11:43:38,307 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-08-21 11:43:38,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:43:38,310 INFO L225 Difference]: With dead ends: 2298 [2021-08-21 11:43:38,310 INFO L226 Difference]: Without dead ends: 1356 [2021-08-21 11:43:38,310 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 117.0ms TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2021-08-21 11:43:38,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2021-08-21 11:43:38,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1221. [2021-08-21 11:43:38,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1221 states, 1220 states have (on average 2.8975409836065573) internal successors, (3535), 1220 states have internal predecessors, (3535), 0 states have call successors, (0), 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-21 11:43:38,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 3535 transitions. [2021-08-21 11:43:38,327 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 3535 transitions. Word has length 81 [2021-08-21 11:43:38,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:43:38,327 INFO L470 AbstractCegarLoop]: Abstraction has 1221 states and 3535 transitions. [2021-08-21 11:43:38,327 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:43:38,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 3535 transitions. [2021-08-21 11:43:38,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-08-21 11:43:38,329 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:43:38,329 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:43:38,329 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-21 11:43:38,329 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:43:38,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:43:38,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1855856638, now seen corresponding path program 2 times [2021-08-21 11:43:38,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:43:38,330 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258257632] [2021-08-21 11:43:38,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:43:38,330 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:43:38,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-21 11:43:38,353 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-21 11:43:38,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-21 11:43:38,407 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-21 11:43:38,407 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-21 11:43:38,408 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-21 11:43:38,409 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-21 11:43:38,409 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-08-21 11:43:38,409 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-08-21 11:43:38,409 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-08-21 11:43:38,409 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-21 11:43:38,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-21 11:43:38,414 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-21 11:43:38,415 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-21 11:43:38,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.08 11:43:38 BasicIcfg [2021-08-21 11:43:38,486 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-21 11:43:38,487 INFO L168 Benchmark]: Toolchain (without parser) took 9997.72 ms. Allocated memory was 188.7 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 153.1 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 436.2 MB. Max. memory is 8.0 GB. [2021-08-21 11:43:38,487 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 188.7 MB. Free memory is still 171.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-08-21 11:43:38,487 INFO L168 Benchmark]: CACSL2BoogieTranslator took 460.51 ms. Allocated memory is still 188.7 MB. Free memory was 152.9 MB in the beginning and 160.5 MB in the end (delta: -7.6 MB). Peak memory consumption was 5.5 MB. Max. memory is 8.0 GB. [2021-08-21 11:43:38,487 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.66 ms. Allocated memory is still 188.7 MB. Free memory was 160.5 MB in the beginning and 157.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-08-21 11:43:38,488 INFO L168 Benchmark]: Boogie Preprocessor took 40.25 ms. Allocated memory is still 188.7 MB. Free memory was 157.4 MB in the beginning and 155.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-21 11:43:38,488 INFO L168 Benchmark]: RCFGBuilder took 1803.18 ms. Allocated memory was 188.7 MB in the beginning and 234.9 MB in the end (delta: 46.1 MB). Free memory was 155.3 MB in the beginning and 175.2 MB in the end (delta: -19.9 MB). Peak memory consumption was 80.8 MB. Max. memory is 8.0 GB. [2021-08-21 11:43:38,488 INFO L168 Benchmark]: TraceAbstraction took 7624.25 ms. Allocated memory was 234.9 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 175.2 MB in the beginning and 1.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 410.8 MB. Max. memory is 8.0 GB. [2021-08-21 11:43:38,489 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 188.7 MB. Free memory is still 171.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 460.51 ms. Allocated memory is still 188.7 MB. Free memory was 152.9 MB in the beginning and 160.5 MB in the end (delta: -7.6 MB). Peak memory consumption was 5.5 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 64.66 ms. Allocated memory is still 188.7 MB. Free memory was 160.5 MB in the beginning and 157.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 40.25 ms. Allocated memory is still 188.7 MB. Free memory was 157.4 MB in the beginning and 155.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1803.18 ms. Allocated memory was 188.7 MB in the beginning and 234.9 MB in the end (delta: 46.1 MB). Free memory was 155.3 MB in the beginning and 175.2 MB in the end (delta: -19.9 MB). Peak memory consumption was 80.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 7624.25 ms. Allocated memory was 234.9 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 175.2 MB in the beginning and 1.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 410.8 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: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L712] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0] [L713] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L715] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L718] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L719] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L720] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L721] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L722] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L723] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_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_buff0_thd3=0] [L724] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_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_buff0_thd3=0, y$r_buff1_thd0=0] [L725] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L726] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L727] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L728] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L729] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L730] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L731] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L732] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L733] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L735] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 0 pthread_t t2528; VAL [__unbuffered_cnt=0, __unbuffered_p0_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t2528, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 0 pthread_t t2529; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L818] FCALL, FORK 0 pthread_create(&t2529, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L819] 0 pthread_t t2530; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L820] FCALL, FORK 0 pthread_create(&t2530, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L778] 3 y$w_buff1 = y$w_buff0 [L779] 3 y$w_buff0 = 2 [L780] 3 y$w_buff1_used = y$w_buff0_used [L781] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L783] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L784] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L785] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L786] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L787] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L741] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L758] 2 x = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L761] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L764] 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) [L764] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L764] 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) [L764] 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) [L765] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L765] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L766] 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 [L767] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L767] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L768] 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 [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L793] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L794] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L795] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L796] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L796] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L797] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L797] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L800] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L822] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L826] 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) [L826] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L826] 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) [L826] 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) [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L827] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L828] 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 [L829] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L829] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L830] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L830] 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 [L833] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 0 y$flush_delayed = weak$$choice2 [L836] 0 y$mem_tmp = y [L837] 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) [L837] 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) [L838] 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)) [L838] 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) [L838] 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)) [L838] 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)) [L839] 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)) [L839] 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) [L839] 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)) [L839] 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)) [L840] 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)) [L840] 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) [L840] 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)) [L840] 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)) [L841] 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)) [L841] 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) [L841] 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)) [L841] 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)) [L842] 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)) [L842] 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) [L842] 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)) [L842] 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)) [L843] 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)) [L843] 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) [L843] 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)) [L843] 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)) [L844] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) [L845] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L845] 0 y = y$flush_delayed ? y$mem_tmp : y [L846] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 818]: 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: 816]: 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: 820]: 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 with 1 thread instances CFG has 7 procedures, 131 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 7474.0ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 215.4ms, AutomataDifference: 2966.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 252.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1536 SDtfs, 2325 SDslu, 5460 SDs, 0 SdLazy, 719 SolverSat, 148 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 732.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 163 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 1195.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=10392occurred in iteration=0, InterpolantAutomatonStates: 129, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1724.4ms AutomataMinimizationTime, 12 MinimizatonAttempts, 1405 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 39.8ms SsaConstructionTime, 421.1ms SatisfiabilityAnalysisTime, 1584.4ms InterpolantComputationTime, 934 NumberOfCodeBlocks, 934 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 841 ConstructedInterpolants, 0 QuantifiedInterpolants, 3933 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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-21 11:43:38,513 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...