/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/mix030_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-9bbddad6b14272d9691b7fb6f1c011d15ab18596-9bbddad [2021-06-12 16:34:27,228 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-12 16:34:27,229 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-12 16:34:27,261 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-12 16:34:27,262 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-12 16:34:27,264 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-12 16:34:27,266 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-12 16:34:27,270 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-12 16:34:27,272 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-12 16:34:27,276 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-12 16:34:27,276 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-12 16:34:27,277 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-12 16:34:27,277 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-12 16:34:27,278 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-12 16:34:27,278 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-12 16:34:27,279 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-12 16:34:27,279 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-12 16:34:27,288 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-12 16:34:27,289 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-12 16:34:27,290 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-12 16:34:27,291 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-12 16:34:27,292 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-12 16:34:27,292 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-12 16:34:27,293 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-12 16:34:27,294 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-12 16:34:27,294 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-12 16:34:27,295 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-12 16:34:27,295 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-12 16:34:27,295 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-12 16:34:27,296 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-12 16:34:27,296 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-12 16:34:27,297 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-12 16:34:27,297 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-12 16:34:27,298 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-12 16:34:27,298 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-12 16:34:27,299 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-12 16:34:27,299 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-12 16:34:27,299 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-12 16:34:27,299 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-12 16:34:27,300 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-12 16:34:27,300 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-12 16:34:27,301 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-06-12 16:34:27,328 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-12 16:34:27,328 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-12 16:34:27,329 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-12 16:34:27,329 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-12 16:34:27,331 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-12 16:34:27,331 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-12 16:34:27,331 INFO L138 SettingsManager]: * Use SBE=true [2021-06-12 16:34:27,331 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-12 16:34:27,331 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-12 16:34:27,331 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-12 16:34:27,332 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-12 16:34:27,332 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-12 16:34:27,332 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-12 16:34:27,332 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-12 16:34:27,332 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-12 16:34:27,332 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-12 16:34:27,332 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-12 16:34:27,333 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-12 16:34:27,333 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-12 16:34:27,333 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-12 16:34:27,333 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-12 16:34:27,333 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-12 16:34:27,333 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-12 16:34:27,333 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-12 16:34:27,333 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-12 16:34:27,333 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-12 16:34:27,333 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-12 16:34:27,334 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-12 16:34:27,334 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-12 16:34:27,334 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-12 16:34:27,334 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-12 16:34:27,334 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-12 16:34:27,556 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-12 16:34:27,570 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-12 16:34:27,571 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-12 16:34:27,572 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-12 16:34:27,572 INFO L275 PluginConnector]: CDTParser initialized [2021-06-12 16:34:27,573 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix030_rmo.opt.i [2021-06-12 16:34:27,611 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/713b4f53d/ecca57b801e64d54a924911901dec813/FLAG64759942e [2021-06-12 16:34:28,024 INFO L306 CDTParser]: Found 1 translation units. [2021-06-12 16:34:28,024 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix030_rmo.opt.i [2021-06-12 16:34:28,033 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/713b4f53d/ecca57b801e64d54a924911901dec813/FLAG64759942e [2021-06-12 16:34:28,383 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/713b4f53d/ecca57b801e64d54a924911901dec813 [2021-06-12 16:34:28,385 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-12 16:34:28,386 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-12 16:34:28,389 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-12 16:34:28,389 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-12 16:34:28,391 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-12 16:34:28,391 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.06 04:34:28" (1/1) ... [2021-06-12 16:34:28,392 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f0a80bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 04:34:28, skipping insertion in model container [2021-06-12 16:34:28,392 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.06 04:34:28" (1/1) ... [2021-06-12 16:34:28,396 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-12 16:34:28,419 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-12 16:34:28,535 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix030_rmo.opt.i[948,961] [2021-06-12 16:34:28,737 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-12 16:34:28,743 INFO L203 MainTranslator]: Completed pre-run [2021-06-12 16:34:28,751 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix030_rmo.opt.i[948,961] [2021-06-12 16:34:28,784 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-12 16:34:28,821 INFO L208 MainTranslator]: Completed translation [2021-06-12 16:34:28,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 04:34:28 WrapperNode [2021-06-12 16:34:28,822 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-12 16:34:28,823 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-12 16:34:28,823 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-12 16:34:28,823 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-12 16:34:28,827 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 04:34:28" (1/1) ... [2021-06-12 16:34:28,850 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 04:34:28" (1/1) ... [2021-06-12 16:34:28,881 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-12 16:34:28,881 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-12 16:34:28,881 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-12 16:34:28,881 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-12 16:34:28,890 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 04:34:28" (1/1) ... [2021-06-12 16:34:28,891 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 04:34:28" (1/1) ... [2021-06-12 16:34:28,900 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 04:34:28" (1/1) ... [2021-06-12 16:34:28,900 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 04:34:28" (1/1) ... [2021-06-12 16:34:28,905 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 04:34:28" (1/1) ... [2021-06-12 16:34:28,907 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 04:34:28" (1/1) ... [2021-06-12 16:34:28,922 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 04:34:28" (1/1) ... [2021-06-12 16:34:28,924 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-12 16:34:28,925 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-12 16:34:28,925 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-12 16:34:28,925 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-12 16:34:28,926 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 04:34:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-12 16:34:28,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-12 16:34:28,993 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-12 16:34:28,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-12 16:34:28,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-12 16:34:28,993 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-12 16:34:28,993 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-12 16:34:28,994 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-12 16:34:28,994 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-12 16:34:28,994 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-12 16:34:28,994 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-12 16:34:28,994 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-06-12 16:34:28,994 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-06-12 16:34:28,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-12 16:34:28,994 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-12 16:34:28,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-12 16:34:28,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-12 16:34:28,996 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-12 16:34:30,269 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-12 16:34:30,270 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-12 16:34:30,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.06 04:34:30 BoogieIcfgContainer [2021-06-12 16:34:30,271 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-12 16:34:30,272 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-12 16:34:30,273 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-12 16:34:30,274 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-12 16:34:30,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.06 04:34:28" (1/3) ... [2021-06-12 16:34:30,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3df7b2f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.06 04:34:30, skipping insertion in model container [2021-06-12 16:34:30,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 04:34:28" (2/3) ... [2021-06-12 16:34:30,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3df7b2f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.06 04:34:30, skipping insertion in model container [2021-06-12 16:34:30,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.06 04:34:30" (3/3) ... [2021-06-12 16:34:30,276 INFO L111 eAbstractionObserver]: Analyzing ICFG mix030_rmo.opt.i [2021-06-12 16:34:30,282 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-12 16:34:30,282 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-12 16:34:30,282 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-12 16:34:30,283 INFO L471 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-12 16:34:30,309 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,310 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,310 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,310 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,310 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,310 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,310 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,310 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,311 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,311 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,311 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,311 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,311 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,311 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,311 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,311 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,311 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,312 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,312 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,312 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,312 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,315 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,315 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,315 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,315 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,315 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,315 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,315 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,315 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,316 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,316 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,316 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,316 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,316 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,316 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,316 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,316 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,316 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,316 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,316 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,317 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,317 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,317 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,317 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,317 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,317 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,317 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,317 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,317 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,318 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,318 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,318 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,318 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,318 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,318 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,318 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,318 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,318 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,319 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,319 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,319 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,319 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,319 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,319 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,319 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,319 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,319 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,320 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,320 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,320 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,320 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,320 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,320 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,320 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,320 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,320 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,320 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,321 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,321 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,322 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,322 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,324 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,324 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,324 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,326 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,329 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,329 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,329 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,330 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,331 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,331 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,331 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,331 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,331 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,332 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,333 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,333 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,333 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,333 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,333 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,333 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,333 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,333 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,333 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,334 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,334 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,334 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,334 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,334 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,334 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,334 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,334 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,335 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,335 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,335 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,335 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,335 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,336 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,336 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,336 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:34:30,336 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-12 16:34:30,352 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-12 16:34:30,370 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-12 16:34:30,370 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-12 16:34:30,370 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-12 16:34:30,370 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-12 16:34:30,370 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-12 16:34:30,370 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-12 16:34:30,370 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-12 16:34:30,370 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P2======== [2021-06-12 16:34:30,378 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 138 places, 127 transitions, 274 flow [2021-06-12 16:34:52,456 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 135556 states, 135552 states have (on average 4.513168378186969) internal successors, (611769), 135555 states have internal predecessors, (611769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:34:52,691 INFO L276 IsEmpty]: Start isEmpty. Operand has 135556 states, 135552 states have (on average 4.513168378186969) internal successors, (611769), 135555 states have internal predecessors, (611769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:34:53,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-12 16:34:53,343 INFO L301 ceAbstractionStarter]: Result for error location P2 was SAFE (1/3) [2021-06-12 16:34:53,345 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-12 16:34:53,351 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-12 16:34:53,351 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-12 16:34:53,351 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-12 16:34:53,351 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-12 16:34:53,351 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-12 16:34:53,351 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-12 16:34:53,351 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-12 16:34:53,352 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P2Thread1of1ForFork2======== [2021-06-12 16:34:53,357 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 138 places, 127 transitions, 274 flow [2021-06-12 16:35:14,568 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 135556 states, 135552 states have (on average 4.513168378186969) internal successors, (611769), 135555 states have internal predecessors, (611769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:35:14,961 INFO L276 IsEmpty]: Start isEmpty. Operand has 135556 states, 135552 states have (on average 4.513168378186969) internal successors, (611769), 135555 states have internal predecessors, (611769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:35:14,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-06-12 16:35:14,963 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:35:14,964 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 16:35:14,965 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 16:35:14,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:35:14,968 INFO L82 PathProgramCache]: Analyzing trace with hash -386527450, now seen corresponding path program 1 times [2021-06-12 16:35:14,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:35:14,989 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880132566] [2021-06-12 16:35:14,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:35:15,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:35:15,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 16:35:15,230 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:35:15,230 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880132566] [2021-06-12 16:35:15,230 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880132566] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:35:15,231 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:35:15,231 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-12 16:35:15,231 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079691496] [2021-06-12 16:35:15,233 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-12 16:35:15,233 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:35:15,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-12 16:35:15,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 16:35:15,393 INFO L87 Difference]: Start difference. First operand has 135556 states, 135552 states have (on average 4.513168378186969) internal successors, (611769), 135555 states have internal predecessors, (611769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 29.5) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:35:16,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:35:16,477 INFO L93 Difference]: Finished difference Result 116516 states and 516069 transitions. [2021-06-12 16:35:16,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-12 16:35:16,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 29.5) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-06-12 16:35:16,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:35:16,482 INFO L225 Difference]: With dead ends: 116516 [2021-06-12 16:35:16,482 INFO L226 Difference]: Without dead ends: 0 [2021-06-12 16:35:16,485 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 16:35:16,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-12 16:35:16,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-12 16:35:16,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:35:16,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-12 16:35:16,499 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 59 [2021-06-12 16:35:16,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:35:16,500 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-12 16:35:16,500 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 29.5) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:35:16,500 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-12 16:35:16,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-12 16:35:16,500 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-12 16:35:16,500 INFO L301 ceAbstractionStarter]: Result for error location P2Thread1of1ForFork2 was SAFE (2/3) [2021-06-12 16:35:16,501 INFO L255 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-06-12 16:35:16,502 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-12 16:35:16,502 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-12 16:35:16,502 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-12 16:35:16,502 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-12 16:35:16,502 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-12 16:35:16,502 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-12 16:35:16,502 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-12 16:35:16,502 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-06-12 16:35:16,505 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 138 places, 127 transitions, 274 flow [2021-06-12 16:35:37,197 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 135556 states, 135552 states have (on average 4.513168378186969) internal successors, (611769), 135555 states have internal predecessors, (611769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:35:37,384 INFO L276 IsEmpty]: Start isEmpty. Operand has 135556 states, 135552 states have (on average 4.513168378186969) internal successors, (611769), 135555 states have internal predecessors, (611769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:35:37,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-06-12 16:35:37,613 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:35:37,613 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 16:35:37,613 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 16:35:37,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:35:37,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1061660364, now seen corresponding path program 1 times [2021-06-12 16:35:37,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:35:37,614 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255268314] [2021-06-12 16:35:37,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:35:37,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:35:37,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 16:35:37,866 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:35:37,866 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255268314] [2021-06-12 16:35:37,866 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255268314] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:35:37,866 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:35:37,866 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-12 16:35:37,866 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553006623] [2021-06-12 16:35:37,867 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-12 16:35:37,867 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:35:37,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-12 16:35:37,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-12 16:35:38,021 INFO L87 Difference]: Start difference. First operand has 135556 states, 135552 states have (on average 4.513168378186969) internal successors, (611769), 135555 states have internal predecessors, (611769), 0 states have call successors, (0), 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 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:35:39,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:35:39,798 INFO L93 Difference]: Finished difference Result 203659 states and 898875 transitions. [2021-06-12 16:35:39,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-12 16:35:39,798 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2021-06-12 16:35:39,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:35:40,536 INFO L225 Difference]: With dead ends: 203659 [2021-06-12 16:35:40,536 INFO L226 Difference]: Without dead ends: 72367 [2021-06-12 16:35:40,537 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 115.5ms TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2021-06-12 16:35:41,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72367 states. [2021-06-12 16:35:43,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72367 to 69784. [2021-06-12 16:35:43,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69784 states, 69782 states have (on average 4.362170760368003) internal successors, (304401), 69783 states have internal predecessors, (304401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:35:43,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69784 states to 69784 states and 304401 transitions. [2021-06-12 16:35:43,589 INFO L78 Accepts]: Start accepts. Automaton has 69784 states and 304401 transitions. Word has length 78 [2021-06-12 16:35:43,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:35:43,590 INFO L482 AbstractCegarLoop]: Abstraction has 69784 states and 304401 transitions. [2021-06-12 16:35:43,591 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:35:43,591 INFO L276 IsEmpty]: Start isEmpty. Operand 69784 states and 304401 transitions. [2021-06-12 16:35:43,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-12 16:35:43,861 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:35:43,861 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 16:35:43,861 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-12 16:35:43,861 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 16:35:43,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:35:43,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1088813707, now seen corresponding path program 1 times [2021-06-12 16:35:43,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:35:43,862 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854195746] [2021-06-12 16:35:43,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:35:43,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:35:43,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-06-12 16:35:43,968 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:35:43,968 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854195746] [2021-06-12 16:35:43,968 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854195746] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:35:43,968 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:35:43,968 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-12 16:35:43,968 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445213494] [2021-06-12 16:35:43,969 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-12 16:35:43,969 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:35:43,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-12 16:35:43,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 16:35:43,970 INFO L87 Difference]: Start difference. First operand 69784 states and 304401 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:35:44,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:35:44,514 INFO L93 Difference]: Finished difference Result 61832 states and 269641 transitions. [2021-06-12 16:35:44,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-12 16:35:44,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-06-12 16:35:44,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:35:44,763 INFO L225 Difference]: With dead ends: 61832 [2021-06-12 16:35:44,764 INFO L226 Difference]: Without dead ends: 61832 [2021-06-12 16:35:44,764 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 16:35:45,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61832 states. [2021-06-12 16:35:46,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61832 to 61832. [2021-06-12 16:35:46,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61832 states, 61831 states have (on average 4.360935453089874) internal successors, (269641), 61831 states have internal predecessors, (269641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:35:46,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61832 states to 61832 states and 269641 transitions. [2021-06-12 16:35:46,861 INFO L78 Accepts]: Start accepts. Automaton has 61832 states and 269641 transitions. Word has length 80 [2021-06-12 16:35:46,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:35:46,861 INFO L482 AbstractCegarLoop]: Abstraction has 61832 states and 269641 transitions. [2021-06-12 16:35:46,861 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:35:46,861 INFO L276 IsEmpty]: Start isEmpty. Operand 61832 states and 269641 transitions. [2021-06-12 16:35:46,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-12 16:35:46,898 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:35:46,899 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 16:35:46,899 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-12 16:35:46,899 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 16:35:46,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:35:46,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1494537528, now seen corresponding path program 1 times [2021-06-12 16:35:46,899 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:35:46,899 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608565751] [2021-06-12 16:35:46,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:35:46,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:35:47,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 16:35:47,014 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:35:47,014 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608565751] [2021-06-12 16:35:47,014 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608565751] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:35:47,014 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:35:47,014 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-12 16:35:47,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770948342] [2021-06-12 16:35:47,015 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 16:35:47,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:35:47,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 16:35:47,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-12 16:35:47,018 INFO L87 Difference]: Start difference. First operand 61832 states and 269641 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:35:47,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:35:47,891 INFO L93 Difference]: Finished difference Result 74936 states and 324483 transitions. [2021-06-12 16:35:47,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-12 16:35:47,904 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-06-12 16:35:47,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:35:48,201 INFO L225 Difference]: With dead ends: 74936 [2021-06-12 16:35:48,202 INFO L226 Difference]: Without dead ends: 60320 [2021-06-12 16:35:48,202 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 63.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-12 16:35:48,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60320 states. [2021-06-12 16:35:49,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60320 to 60320. [2021-06-12 16:35:49,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60320 states, 60319 states have (on average 4.352674944876407) internal successors, (262549), 60319 states have internal predecessors, (262549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:35:50,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60320 states to 60320 states and 262549 transitions. [2021-06-12 16:35:50,166 INFO L78 Accepts]: Start accepts. Automaton has 60320 states and 262549 transitions. Word has length 80 [2021-06-12 16:35:50,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:35:50,166 INFO L482 AbstractCegarLoop]: Abstraction has 60320 states and 262549 transitions. [2021-06-12 16:35:50,166 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:35:50,166 INFO L276 IsEmpty]: Start isEmpty. Operand 60320 states and 262549 transitions. [2021-06-12 16:35:50,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-06-12 16:35:50,206 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:35:50,206 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 16:35:50,206 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-12 16:35:50,206 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 16:35:50,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:35:50,207 INFO L82 PathProgramCache]: Analyzing trace with hash -158736966, now seen corresponding path program 1 times [2021-06-12 16:35:50,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:35:50,207 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926159220] [2021-06-12 16:35:50,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:35:50,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:35:50,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 16:35:50,291 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:35:50,291 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926159220] [2021-06-12 16:35:50,291 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926159220] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:35:50,291 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:35:50,292 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-12 16:35:50,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597180123] [2021-06-12 16:35:50,292 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 16:35:50,292 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:35:50,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 16:35:50,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-12 16:35:50,293 INFO L87 Difference]: Start difference. First operand 60320 states and 262549 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:35:51,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:35:51,339 INFO L93 Difference]: Finished difference Result 104280 states and 449462 transitions. [2021-06-12 16:35:51,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-12 16:35:51,339 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-06-12 16:35:51,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:35:51,583 INFO L225 Difference]: With dead ends: 104280 [2021-06-12 16:35:51,583 INFO L226 Difference]: Without dead ends: 68720 [2021-06-12 16:35:51,584 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 90.1ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-12 16:35:52,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68720 states. [2021-06-12 16:35:53,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68720 to 56960. [2021-06-12 16:35:53,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56960 states, 56959 states have (on average 4.280148879018241) internal successors, (243793), 56959 states have internal predecessors, (243793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:35:53,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56960 states to 56960 states and 243793 transitions. [2021-06-12 16:35:53,498 INFO L78 Accepts]: Start accepts. Automaton has 56960 states and 243793 transitions. Word has length 81 [2021-06-12 16:35:53,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:35:53,498 INFO L482 AbstractCegarLoop]: Abstraction has 56960 states and 243793 transitions. [2021-06-12 16:35:53,498 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:35:53,498 INFO L276 IsEmpty]: Start isEmpty. Operand 56960 states and 243793 transitions. [2021-06-12 16:35:53,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-06-12 16:35:53,545 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:35:53,546 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 16:35:53,546 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-12 16:35:53,546 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 16:35:53,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:35:53,546 INFO L82 PathProgramCache]: Analyzing trace with hash 2082581959, now seen corresponding path program 1 times [2021-06-12 16:35:53,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:35:53,546 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806122884] [2021-06-12 16:35:53,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:35:53,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:35:53,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 16:35:53,624 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:35:53,624 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806122884] [2021-06-12 16:35:53,624 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806122884] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:35:53,624 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:35:53,624 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-12 16:35:53,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215464923] [2021-06-12 16:35:53,625 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 16:35:53,625 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:35:53,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 16:35:53,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-12 16:35:53,625 INFO L87 Difference]: Start difference. First operand 56960 states and 243793 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:35:54,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:35:54,246 INFO L93 Difference]: Finished difference Result 65892 states and 280653 transitions. [2021-06-12 16:35:54,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-12 16:35:54,247 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-06-12 16:35:54,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:35:54,436 INFO L225 Difference]: With dead ends: 65892 [2021-06-12 16:35:54,436 INFO L226 Difference]: Without dead ends: 54524 [2021-06-12 16:35:54,436 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 60.0ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-12 16:35:54,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54524 states. [2021-06-12 16:35:55,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54524 to 54524. [2021-06-12 16:35:55,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54524 states, 54523 states have (on average 4.266694789354951) internal successors, (232633), 54523 states have internal predecessors, (232633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:35:56,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54524 states to 54524 states and 232633 transitions. [2021-06-12 16:35:56,142 INFO L78 Accepts]: Start accepts. Automaton has 54524 states and 232633 transitions. Word has length 82 [2021-06-12 16:35:56,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:35:56,142 INFO L482 AbstractCegarLoop]: Abstraction has 54524 states and 232633 transitions. [2021-06-12 16:35:56,142 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:35:56,142 INFO L276 IsEmpty]: Start isEmpty. Operand 54524 states and 232633 transitions. [2021-06-12 16:35:56,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-06-12 16:35:56,202 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:35:56,202 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 16:35:56,202 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-12 16:35:56,202 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 16:35:56,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:35:56,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1799743632, now seen corresponding path program 1 times [2021-06-12 16:35:56,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:35:56,208 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891257202] [2021-06-12 16:35:56,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:35:56,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:35:56,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 16:35:56,401 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:35:56,401 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891257202] [2021-06-12 16:35:56,401 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891257202] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:35:56,401 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:35:56,401 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-12 16:35:56,401 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377023404] [2021-06-12 16:35:56,401 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 16:35:56,401 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:35:56,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 16:35:56,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-12 16:35:56,402 INFO L87 Difference]: Start difference. First operand 54524 states and 232633 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:35:57,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:35:57,145 INFO L93 Difference]: Finished difference Result 61292 states and 260257 transitions. [2021-06-12 16:35:57,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-12 16:35:57,146 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-06-12 16:35:57,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:35:57,357 INFO L225 Difference]: With dead ends: 61292 [2021-06-12 16:35:57,357 INFO L226 Difference]: Without dead ends: 53228 [2021-06-12 16:35:57,357 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 96.5ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-12 16:35:57,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53228 states. [2021-06-12 16:35:58,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53228 to 53228. [2021-06-12 16:35:58,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53228 states, 53227 states have (on average 4.256956056136923) internal successors, (226585), 53227 states have internal predecessors, (226585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:35:59,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53228 states to 53228 states and 226585 transitions. [2021-06-12 16:35:59,229 INFO L78 Accepts]: Start accepts. Automaton has 53228 states and 226585 transitions. Word has length 83 [2021-06-12 16:35:59,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:35:59,230 INFO L482 AbstractCegarLoop]: Abstraction has 53228 states and 226585 transitions. [2021-06-12 16:35:59,230 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:35:59,230 INFO L276 IsEmpty]: Start isEmpty. Operand 53228 states and 226585 transitions. [2021-06-12 16:35:59,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-06-12 16:35:59,285 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:35:59,285 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 16:35:59,285 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-12 16:35:59,286 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 16:35:59,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:35:59,286 INFO L82 PathProgramCache]: Analyzing trace with hash 425204255, now seen corresponding path program 1 times [2021-06-12 16:35:59,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:35:59,286 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022905948] [2021-06-12 16:35:59,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:35:59,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:35:59,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 16:35:59,390 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:35:59,390 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022905948] [2021-06-12 16:35:59,390 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022905948] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:35:59,390 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:35:59,390 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-12 16:35:59,390 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639632612] [2021-06-12 16:35:59,390 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-12 16:35:59,390 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:35:59,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-12 16:35:59,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-12 16:35:59,391 INFO L87 Difference]: Start difference. First operand 53228 states and 226585 transitions. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:36:00,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:36:00,169 INFO L93 Difference]: Finished difference Result 60508 states and 256751 transitions. [2021-06-12 16:36:00,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-12 16:36:00,169 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-06-12 16:36:00,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:36:00,340 INFO L225 Difference]: With dead ends: 60508 [2021-06-12 16:36:00,340 INFO L226 Difference]: Without dead ends: 53564 [2021-06-12 16:36:00,340 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 164.5ms TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2021-06-12 16:36:00,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53564 states. [2021-06-12 16:36:01,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53564 to 53564. [2021-06-12 16:36:01,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53564 states, 53563 states have (on average 4.2573231521759425) internal successors, (228035), 53563 states have internal predecessors, (228035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:36:01,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53564 states to 53564 states and 228035 transitions. [2021-06-12 16:36:01,872 INFO L78 Accepts]: Start accepts. Automaton has 53564 states and 228035 transitions. Word has length 84 [2021-06-12 16:36:01,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:36:01,872 INFO L482 AbstractCegarLoop]: Abstraction has 53564 states and 228035 transitions. [2021-06-12 16:36:01,872 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:36:01,872 INFO L276 IsEmpty]: Start isEmpty. Operand 53564 states and 228035 transitions. [2021-06-12 16:36:02,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-06-12 16:36:02,220 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:36:02,221 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 16:36:02,221 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-12 16:36:02,221 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 16:36:02,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:36:02,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1467462400, now seen corresponding path program 1 times [2021-06-12 16:36:02,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:36:02,231 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128367191] [2021-06-12 16:36:02,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:36:02,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:36:02,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 16:36:02,446 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:36:02,446 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128367191] [2021-06-12 16:36:02,446 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128367191] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:36:02,446 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:36:02,446 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-06-12 16:36:02,447 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336066607] [2021-06-12 16:36:02,447 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-12 16:36:02,447 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:36:02,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-12 16:36:02,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-06-12 16:36:02,449 INFO L87 Difference]: Start difference. First operand 53564 states and 228035 transitions. Second operand has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:36:03,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:36:03,464 INFO L93 Difference]: Finished difference Result 72660 states and 307277 transitions. [2021-06-12 16:36:03,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-12 16:36:03,465 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-06-12 16:36:03,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:36:03,660 INFO L225 Difference]: With dead ends: 72660 [2021-06-12 16:36:03,660 INFO L226 Difference]: Without dead ends: 60116 [2021-06-12 16:36:03,661 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 286.4ms TimeCoverageRelationStatistics Valid=200, Invalid=450, Unknown=0, NotChecked=0, Total=650 [2021-06-12 16:36:03,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60116 states. [2021-06-12 16:36:05,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60116 to 58772. [2021-06-12 16:36:05,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58772 states, 58771 states have (on average 4.237821374487417) internal successors, (249061), 58771 states have internal predecessors, (249061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:36:05,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58772 states to 58772 states and 249061 transitions. [2021-06-12 16:36:05,629 INFO L78 Accepts]: Start accepts. Automaton has 58772 states and 249061 transitions. Word has length 85 [2021-06-12 16:36:05,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:36:05,630 INFO L482 AbstractCegarLoop]: Abstraction has 58772 states and 249061 transitions. [2021-06-12 16:36:05,630 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:36:05,630 INFO L276 IsEmpty]: Start isEmpty. Operand 58772 states and 249061 transitions. [2021-06-12 16:36:05,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-06-12 16:36:05,720 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:36:05,721 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 16:36:05,721 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-12 16:36:05,721 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 16:36:05,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:36:05,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1509607535, now seen corresponding path program 1 times [2021-06-12 16:36:05,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:36:05,721 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36463665] [2021-06-12 16:36:05,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:36:05,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:36:05,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 16:36:05,852 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:36:05,852 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36463665] [2021-06-12 16:36:05,853 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36463665] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:36:05,853 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:36:05,853 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-12 16:36:05,853 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055353366] [2021-06-12 16:36:05,853 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-12 16:36:05,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:36:05,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-12 16:36:05,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-06-12 16:36:05,854 INFO L87 Difference]: Start difference. First operand 58772 states and 249061 transitions. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:36:06,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:36:06,751 INFO L93 Difference]: Finished difference Result 66910 states and 282687 transitions. [2021-06-12 16:36:06,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-12 16:36:06,752 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-06-12 16:36:06,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:36:06,941 INFO L225 Difference]: With dead ends: 66910 [2021-06-12 16:36:06,941 INFO L226 Difference]: Without dead ends: 59710 [2021-06-12 16:36:06,941 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 214.9ms TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2021-06-12 16:36:07,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59710 states. [2021-06-12 16:36:08,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59710 to 58982. [2021-06-12 16:36:08,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58982 states, 58981 states have (on average 4.235397839982367) internal successors, (249808), 58981 states have internal predecessors, (249808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:36:08,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58982 states to 58982 states and 249808 transitions. [2021-06-12 16:36:08,834 INFO L78 Accepts]: Start accepts. Automaton has 58982 states and 249808 transitions. Word has length 85 [2021-06-12 16:36:08,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:36:08,834 INFO L482 AbstractCegarLoop]: Abstraction has 58982 states and 249808 transitions. [2021-06-12 16:36:08,834 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:36:08,834 INFO L276 IsEmpty]: Start isEmpty. Operand 58982 states and 249808 transitions. [2021-06-12 16:36:08,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-06-12 16:36:08,936 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:36:08,936 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 16:36:08,936 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-12 16:36:08,937 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 16:36:08,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:36:08,938 INFO L82 PathProgramCache]: Analyzing trace with hash 2127135461, now seen corresponding path program 2 times [2021-06-12 16:36:08,938 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:36:08,938 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147093785] [2021-06-12 16:36:08,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:36:08,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:36:09,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 16:36:09,110 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:36:09,110 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147093785] [2021-06-12 16:36:09,110 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147093785] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:36:09,110 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:36:09,110 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-12 16:36:09,110 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692971982] [2021-06-12 16:36:09,110 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-12 16:36:09,110 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:36:09,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-12 16:36:09,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-12 16:36:09,111 INFO L87 Difference]: Start difference. First operand 58982 states and 249808 transitions. Second operand has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:36:09,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:36:09,848 INFO L93 Difference]: Finished difference Result 66890 states and 281759 transitions. [2021-06-12 16:36:09,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-12 16:36:09,849 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-06-12 16:36:09,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:36:10,034 INFO L225 Difference]: With dead ends: 66890 [2021-06-12 16:36:10,034 INFO L226 Difference]: Without dead ends: 59210 [2021-06-12 16:36:10,034 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 144.9ms TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2021-06-12 16:36:10,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59210 states. [2021-06-12 16:36:11,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59210 to 59000. [2021-06-12 16:36:11,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59000 states, 58999 states have (on average 4.223597010118816) internal successors, (249188), 58999 states have internal predecessors, (249188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:36:11,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59000 states to 59000 states and 249188 transitions. [2021-06-12 16:36:11,700 INFO L78 Accepts]: Start accepts. Automaton has 59000 states and 249188 transitions. Word has length 85 [2021-06-12 16:36:11,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:36:11,701 INFO L482 AbstractCegarLoop]: Abstraction has 59000 states and 249188 transitions. [2021-06-12 16:36:11,701 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:36:11,701 INFO L276 IsEmpty]: Start isEmpty. Operand 59000 states and 249188 transitions. [2021-06-12 16:36:12,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-12 16:36:12,112 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:36:12,112 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 16:36:12,112 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-12 16:36:12,113 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 16:36:12,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:36:12,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1113078432, now seen corresponding path program 1 times [2021-06-12 16:36:12,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:36:12,113 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251612839] [2021-06-12 16:36:12,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:36:12,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:36:12,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 16:36:12,312 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:36:12,312 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251612839] [2021-06-12 16:36:12,312 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251612839] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:36:12,312 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:36:12,312 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-12 16:36:12,312 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925408973] [2021-06-12 16:36:12,313 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-12 16:36:12,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:36:12,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-12 16:36:12,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-06-12 16:36:12,313 INFO L87 Difference]: Start difference. First operand 59000 states and 249188 transitions. Second operand has 12 states, 12 states have (on average 7.166666666666667) internal successors, (86), 12 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:36:13,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:36:13,173 INFO L93 Difference]: Finished difference Result 63144 states and 265760 transitions. [2021-06-12 16:36:13,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-12 16:36:13,174 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.166666666666667) internal successors, (86), 12 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2021-06-12 16:36:13,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:36:13,486 INFO L225 Difference]: With dead ends: 63144 [2021-06-12 16:36:13,486 INFO L226 Difference]: Without dead ends: 58664 [2021-06-12 16:36:13,486 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 215.7ms TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2021-06-12 16:36:13,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58664 states. [2021-06-12 16:36:14,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58664 to 58664. [2021-06-12 16:36:14,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58664 states, 58663 states have (on average 4.221400201148936) internal successors, (247640), 58663 states have internal predecessors, (247640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:36:15,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58664 states to 58664 states and 247640 transitions. [2021-06-12 16:36:15,147 INFO L78 Accepts]: Start accepts. Automaton has 58664 states and 247640 transitions. Word has length 86 [2021-06-12 16:36:15,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:36:15,147 INFO L482 AbstractCegarLoop]: Abstraction has 58664 states and 247640 transitions. [2021-06-12 16:36:15,147 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 7.166666666666667) internal successors, (86), 12 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:36:15,148 INFO L276 IsEmpty]: Start isEmpty. Operand 58664 states and 247640 transitions. [2021-06-12 16:36:15,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-06-12 16:36:15,226 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:36:15,227 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 16:36:15,227 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-12 16:36:15,227 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 16:36:15,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:36:15,227 INFO L82 PathProgramCache]: Analyzing trace with hash -968410815, now seen corresponding path program 1 times [2021-06-12 16:36:15,227 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:36:15,227 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9690217] [2021-06-12 16:36:15,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:36:15,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:36:15,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 16:36:15,654 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:36:15,654 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9690217] [2021-06-12 16:36:15,654 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9690217] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:36:15,654 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:36:15,654 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-06-12 16:36:15,654 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280664946] [2021-06-12 16:36:15,654 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-12 16:36:15,654 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:36:15,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-12 16:36:15,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2021-06-12 16:36:15,655 INFO L87 Difference]: Start difference. First operand 58664 states and 247640 transitions. Second operand has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:36:16,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:36:16,275 INFO L93 Difference]: Finished difference Result 66056 states and 276929 transitions. [2021-06-12 16:36:16,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-12 16:36:16,276 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-06-12 16:36:16,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:36:16,650 INFO L225 Difference]: With dead ends: 66056 [2021-06-12 16:36:16,650 INFO L226 Difference]: Without dead ends: 57880 [2021-06-12 16:36:16,650 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 257.3ms TimeCoverageRelationStatistics Valid=161, Invalid=345, Unknown=0, NotChecked=0, Total=506 [2021-06-12 16:36:16,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57880 states. [2021-06-12 16:36:17,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57880 to 54800. [2021-06-12 16:36:17,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54800 states, 54799 states have (on average 4.205441705140605) internal successors, (230454), 54799 states have internal predecessors, (230454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:36:18,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54800 states to 54800 states and 230454 transitions. [2021-06-12 16:36:18,109 INFO L78 Accepts]: Start accepts. Automaton has 54800 states and 230454 transitions. Word has length 87 [2021-06-12 16:36:18,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:36:18,109 INFO L482 AbstractCegarLoop]: Abstraction has 54800 states and 230454 transitions. [2021-06-12 16:36:18,110 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:36:18,110 INFO L276 IsEmpty]: Start isEmpty. Operand 54800 states and 230454 transitions. [2021-06-12 16:36:18,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-06-12 16:36:18,177 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:36:18,177 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 16:36:18,177 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-12 16:36:18,177 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 16:36:18,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:36:18,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1087591396, now seen corresponding path program 1 times [2021-06-12 16:36:18,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:36:18,178 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219605939] [2021-06-12 16:36:18,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:36:18,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:36:18,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 16:36:18,301 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:36:18,301 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219605939] [2021-06-12 16:36:18,301 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219605939] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:36:18,301 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:36:18,301 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-12 16:36:18,301 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144312624] [2021-06-12 16:36:18,301 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-12 16:36:18,301 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:36:18,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-12 16:36:18,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-06-12 16:36:18,302 INFO L87 Difference]: Start difference. First operand 54800 states and 230454 transitions. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:36:19,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:36:19,036 INFO L93 Difference]: Finished difference Result 65202 states and 271934 transitions. [2021-06-12 16:36:19,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-12 16:36:19,036 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-06-12 16:36:19,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:36:19,205 INFO L225 Difference]: With dead ends: 65202 [2021-06-12 16:36:19,205 INFO L226 Difference]: Without dead ends: 58958 [2021-06-12 16:36:19,206 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 135.1ms TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2021-06-12 16:36:19,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58958 states. [2021-06-12 16:36:20,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58958 to 56046. [2021-06-12 16:36:20,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56046 states, 56045 states have (on average 4.19732357926666) internal successors, (235239), 56045 states have internal predecessors, (235239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:36:20,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56046 states to 56046 states and 235239 transitions. [2021-06-12 16:36:20,938 INFO L78 Accepts]: Start accepts. Automaton has 56046 states and 235239 transitions. Word has length 87 [2021-06-12 16:36:20,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:36:20,938 INFO L482 AbstractCegarLoop]: Abstraction has 56046 states and 235239 transitions. [2021-06-12 16:36:20,938 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:36:20,938 INFO L276 IsEmpty]: Start isEmpty. Operand 56046 states and 235239 transitions. [2021-06-12 16:36:21,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-06-12 16:36:21,023 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:36:21,023 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 16:36:21,023 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-12 16:36:21,024 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 16:36:21,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:36:21,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1724993808, now seen corresponding path program 2 times [2021-06-12 16:36:21,024 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:36:21,024 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605528282] [2021-06-12 16:36:21,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:36:21,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:36:21,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 16:36:21,231 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:36:21,231 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605528282] [2021-06-12 16:36:21,231 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605528282] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:36:21,231 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:36:21,231 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-06-12 16:36:21,231 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984898742] [2021-06-12 16:36:21,231 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-12 16:36:21,231 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:36:21,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-12 16:36:21,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2021-06-12 16:36:21,232 INFO L87 Difference]: Start difference. First operand 56046 states and 235239 transitions. Second operand has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:36:22,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:36:22,017 INFO L93 Difference]: Finished difference Result 62584 states and 260695 transitions. [2021-06-12 16:36:22,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-12 16:36:22,017 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-06-12 16:36:22,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:36:22,187 INFO L225 Difference]: With dead ends: 62584 [2021-06-12 16:36:22,187 INFO L226 Difference]: Without dead ends: 55444 [2021-06-12 16:36:22,187 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 313.3ms TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2021-06-12 16:36:22,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55444 states. [2021-06-12 16:36:23,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55444 to 55024. [2021-06-12 16:36:23,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55024 states, 55023 states have (on average 4.2026243570870365) internal successors, (231241), 55023 states have internal predecessors, (231241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:36:23,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55024 states to 55024 states and 231241 transitions. [2021-06-12 16:36:23,624 INFO L78 Accepts]: Start accepts. Automaton has 55024 states and 231241 transitions. Word has length 87 [2021-06-12 16:36:23,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:36:23,624 INFO L482 AbstractCegarLoop]: Abstraction has 55024 states and 231241 transitions. [2021-06-12 16:36:23,625 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:36:23,625 INFO L276 IsEmpty]: Start isEmpty. Operand 55024 states and 231241 transitions. [2021-06-12 16:36:23,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-06-12 16:36:23,936 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:36:23,936 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 16:36:23,936 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-12 16:36:23,936 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 16:36:23,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:36:23,937 INFO L82 PathProgramCache]: Analyzing trace with hash -889594318, now seen corresponding path program 1 times [2021-06-12 16:36:23,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:36:23,937 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045096710] [2021-06-12 16:36:23,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:36:23,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:36:24,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 16:36:24,121 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:36:24,121 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045096710] [2021-06-12 16:36:24,121 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045096710] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:36:24,121 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:36:24,121 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-12 16:36:24,121 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072383084] [2021-06-12 16:36:24,122 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-12 16:36:24,122 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:36:24,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-12 16:36:24,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-06-12 16:36:24,122 INFO L87 Difference]: Start difference. First operand 55024 states and 231241 transitions. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:36:24,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:36:24,919 INFO L93 Difference]: Finished difference Result 60552 states and 253221 transitions. [2021-06-12 16:36:24,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-12 16:36:24,919 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-06-12 16:36:24,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:36:25,082 INFO L225 Difference]: With dead ends: 60552 [2021-06-12 16:36:25,082 INFO L226 Difference]: Without dead ends: 55752 [2021-06-12 16:36:25,082 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 267.2ms TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2021-06-12 16:36:25,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55752 states. [2021-06-12 16:36:26,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55752 to 54646. [2021-06-12 16:36:26,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54646 states, 54645 states have (on average 4.206551377070181) internal successors, (229867), 54645 states have internal predecessors, (229867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:36:26,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54646 states to 54646 states and 229867 transitions. [2021-06-12 16:36:26,735 INFO L78 Accepts]: Start accepts. Automaton has 54646 states and 229867 transitions. Word has length 87 [2021-06-12 16:36:26,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:36:26,736 INFO L482 AbstractCegarLoop]: Abstraction has 54646 states and 229867 transitions. [2021-06-12 16:36:26,736 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:36:26,736 INFO L276 IsEmpty]: Start isEmpty. Operand 54646 states and 229867 transitions. [2021-06-12 16:36:26,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-06-12 16:36:26,812 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:36:26,813 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 16:36:26,813 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-12 16:36:26,813 INFO L430 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 16:36:26,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:36:26,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1557815994, now seen corresponding path program 2 times [2021-06-12 16:36:26,814 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:36:26,814 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860449119] [2021-06-12 16:36:26,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:36:26,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:36:27,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 16:36:27,078 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:36:27,078 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860449119] [2021-06-12 16:36:27,078 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860449119] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:36:27,078 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:36:27,078 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-06-12 16:36:27,078 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29231510] [2021-06-12 16:36:27,078 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-12 16:36:27,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:36:27,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-12 16:36:27,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2021-06-12 16:36:27,079 INFO L87 Difference]: Start difference. First operand 54646 states and 229867 transitions. Second operand has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:36:27,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:36:27,874 INFO L93 Difference]: Finished difference Result 58726 states and 246071 transitions. [2021-06-12 16:36:27,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-12 16:36:27,874 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-06-12 16:36:27,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:36:28,059 INFO L225 Difference]: With dead ends: 58726 [2021-06-12 16:36:28,060 INFO L226 Difference]: Without dead ends: 53926 [2021-06-12 16:36:28,060 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 238.7ms TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2021-06-12 16:36:28,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53926 states. [2021-06-12 16:36:29,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53926 to 53548. [2021-06-12 16:36:29,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53548 states, 53547 states have (on average 4.207929482510692) internal successors, (225322), 53547 states have internal predecessors, (225322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:36:29,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53548 states to 53548 states and 225322 transitions. [2021-06-12 16:36:29,632 INFO L78 Accepts]: Start accepts. Automaton has 53548 states and 225322 transitions. Word has length 87 [2021-06-12 16:36:29,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:36:29,633 INFO L482 AbstractCegarLoop]: Abstraction has 53548 states and 225322 transitions. [2021-06-12 16:36:29,633 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:36:29,633 INFO L276 IsEmpty]: Start isEmpty. Operand 53548 states and 225322 transitions. [2021-06-12 16:36:29,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-06-12 16:36:29,979 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:36:29,980 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 16:36:29,980 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-12 16:36:29,980 INFO L430 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 16:36:29,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:36:29,980 INFO L82 PathProgramCache]: Analyzing trace with hash -864779378, now seen corresponding path program 3 times [2021-06-12 16:36:29,980 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:36:29,980 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975555592] [2021-06-12 16:36:29,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:36:30,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:36:30,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 16:36:30,167 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:36:30,167 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975555592] [2021-06-12 16:36:30,167 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975555592] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:36:30,167 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:36:30,167 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-12 16:36:30,167 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061763507] [2021-06-12 16:36:30,167 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-12 16:36:30,167 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:36:30,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-12 16:36:30,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-06-12 16:36:30,168 INFO L87 Difference]: Start difference. First operand 53548 states and 225322 transitions. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:36:30,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:36:30,987 INFO L93 Difference]: Finished difference Result 77404 states and 321958 transitions. [2021-06-12 16:36:30,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-12 16:36:30,987 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-06-12 16:36:30,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:36:31,171 INFO L225 Difference]: With dead ends: 77404 [2021-06-12 16:36:31,171 INFO L226 Difference]: Without dead ends: 61220 [2021-06-12 16:36:31,171 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 175.8ms TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2021-06-12 16:36:31,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61220 states. [2021-06-12 16:36:32,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61220 to 52540. [2021-06-12 16:36:32,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52540 states, 52539 states have (on average 4.181617465121148) internal successors, (219698), 52539 states have internal predecessors, (219698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:36:32,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52540 states to 52540 states and 219698 transitions. [2021-06-12 16:36:32,620 INFO L78 Accepts]: Start accepts. Automaton has 52540 states and 219698 transitions. Word has length 87 [2021-06-12 16:36:32,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:36:32,620 INFO L482 AbstractCegarLoop]: Abstraction has 52540 states and 219698 transitions. [2021-06-12 16:36:32,620 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:36:32,620 INFO L276 IsEmpty]: Start isEmpty. Operand 52540 states and 219698 transitions. [2021-06-12 16:36:32,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-06-12 16:36:32,687 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:36:32,687 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 16:36:32,687 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-12 16:36:32,687 INFO L430 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 16:36:32,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:36:32,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1755142550, now seen corresponding path program 1 times [2021-06-12 16:36:32,687 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:36:32,687 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501712818] [2021-06-12 16:36:32,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:36:32,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:36:32,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 16:36:32,737 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:36:32,737 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501712818] [2021-06-12 16:36:32,737 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501712818] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:36:32,737 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:36:32,737 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-12 16:36:32,737 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304155640] [2021-06-12 16:36:32,737 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 16:36:32,737 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:36:32,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 16:36:32,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-12 16:36:32,738 INFO L87 Difference]: Start difference. First operand 52540 states and 219698 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:36:33,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:36:33,322 INFO L93 Difference]: Finished difference Result 65976 states and 272606 transitions. [2021-06-12 16:36:33,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-12 16:36:33,323 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-06-12 16:36:33,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:36:33,446 INFO L225 Difference]: With dead ends: 65976 [2021-06-12 16:36:33,446 INFO L226 Difference]: Without dead ends: 48616 [2021-06-12 16:36:33,447 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 51.7ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-12 16:36:33,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48616 states. [2021-06-12 16:36:34,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48616 to 48616. [2021-06-12 16:36:34,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48616 states, 48615 states have (on average 4.130864959374678) internal successors, (200822), 48615 states have internal predecessors, (200822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:36:34,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48616 states to 48616 states and 200822 transitions. [2021-06-12 16:36:34,695 INFO L78 Accepts]: Start accepts. Automaton has 48616 states and 200822 transitions. Word has length 87 [2021-06-12 16:36:34,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:36:34,695 INFO L482 AbstractCegarLoop]: Abstraction has 48616 states and 200822 transitions. [2021-06-12 16:36:34,695 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:36:34,695 INFO L276 IsEmpty]: Start isEmpty. Operand 48616 states and 200822 transitions. [2021-06-12 16:36:34,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-06-12 16:36:34,760 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:36:34,760 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 16:36:34,760 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-12 16:36:34,760 INFO L430 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 16:36:34,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:36:34,760 INFO L82 PathProgramCache]: Analyzing trace with hash -928030478, now seen corresponding path program 1 times [2021-06-12 16:36:34,760 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:36:34,760 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667077357] [2021-06-12 16:36:34,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:36:34,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:36:34,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 16:36:34,811 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:36:34,811 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667077357] [2021-06-12 16:36:34,811 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667077357] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:36:34,811 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:36:34,811 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-12 16:36:34,811 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947763712] [2021-06-12 16:36:34,811 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-12 16:36:34,811 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:36:34,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-12 16:36:34,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-12 16:36:34,812 INFO L87 Difference]: Start difference. First operand 48616 states and 200822 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:36:35,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:36:35,416 INFO L93 Difference]: Finished difference Result 52576 states and 212555 transitions. [2021-06-12 16:36:35,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-12 16:36:35,416 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-06-12 16:36:35,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:36:35,512 INFO L225 Difference]: With dead ends: 52576 [2021-06-12 16:36:35,513 INFO L226 Difference]: Without dead ends: 37600 [2021-06-12 16:36:35,513 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 77.8ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-06-12 16:36:35,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37600 states. [2021-06-12 16:36:36,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37600 to 37600. [2021-06-12 16:36:36,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37600 states, 37599 states have (on average 4.007872549801856) internal successors, (150692), 37599 states have internal predecessors, (150692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:36:36,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37600 states to 37600 states and 150692 transitions. [2021-06-12 16:36:36,615 INFO L78 Accepts]: Start accepts. Automaton has 37600 states and 150692 transitions. Word has length 88 [2021-06-12 16:36:36,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:36:36,616 INFO L482 AbstractCegarLoop]: Abstraction has 37600 states and 150692 transitions. [2021-06-12 16:36:36,616 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:36:36,616 INFO L276 IsEmpty]: Start isEmpty. Operand 37600 states and 150692 transitions. [2021-06-12 16:36:36,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-06-12 16:36:36,669 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:36:36,670 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 16:36:36,670 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-12 16:36:36,670 INFO L430 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 16:36:36,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:36:36,670 INFO L82 PathProgramCache]: Analyzing trace with hash -582813131, now seen corresponding path program 1 times [2021-06-12 16:36:36,670 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:36:36,670 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273253459] [2021-06-12 16:36:36,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:36:36,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:36:36,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 16:36:36,724 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:36:36,724 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273253459] [2021-06-12 16:36:36,724 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273253459] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:36:36,724 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:36:36,724 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-12 16:36:36,724 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886186477] [2021-06-12 16:36:36,725 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 16:36:36,725 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:36:36,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 16:36:36,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-12 16:36:36,725 INFO L87 Difference]: Start difference. First operand 37600 states and 150692 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:36:37,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:36:37,262 INFO L93 Difference]: Finished difference Result 60612 states and 240480 transitions. [2021-06-12 16:36:37,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-12 16:36:37,262 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2021-06-12 16:36:37,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:36:37,393 INFO L225 Difference]: With dead ends: 60612 [2021-06-12 16:36:37,393 INFO L226 Difference]: Without dead ends: 39328 [2021-06-12 16:36:37,393 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 55.2ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-12 16:36:37,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39328 states. [2021-06-12 16:36:38,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39328 to 36736. [2021-06-12 16:36:38,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36736 states, 36735 states have (on average 3.917354022049816) internal successors, (143904), 36735 states have internal predecessors, (143904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:36:38,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36736 states to 36736 states and 143904 transitions. [2021-06-12 16:36:38,242 INFO L78 Accepts]: Start accepts. Automaton has 36736 states and 143904 transitions. Word has length 90 [2021-06-12 16:36:38,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:36:38,242 INFO L482 AbstractCegarLoop]: Abstraction has 36736 states and 143904 transitions. [2021-06-12 16:36:38,242 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:36:38,243 INFO L276 IsEmpty]: Start isEmpty. Operand 36736 states and 143904 transitions. [2021-06-12 16:36:38,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-06-12 16:36:38,294 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:36:38,294 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 16:36:38,294 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-12 16:36:38,294 INFO L430 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 16:36:38,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:36:38,294 INFO L82 PathProgramCache]: Analyzing trace with hash 750527785, now seen corresponding path program 1 times [2021-06-12 16:36:38,294 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:36:38,295 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354246792] [2021-06-12 16:36:38,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:36:38,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:36:38,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 16:36:38,433 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:36:38,433 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354246792] [2021-06-12 16:36:38,433 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354246792] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:36:38,433 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:36:38,433 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-06-12 16:36:38,433 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940329955] [2021-06-12 16:36:38,434 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-12 16:36:38,434 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:36:38,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-12 16:36:38,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2021-06-12 16:36:38,435 INFO L87 Difference]: Start difference. First operand 36736 states and 143904 transitions. Second operand has 14 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:36:39,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:36:39,084 INFO L93 Difference]: Finished difference Result 43832 states and 170814 transitions. [2021-06-12 16:36:39,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-12 16:36:39,085 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2021-06-12 16:36:39,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:36:39,178 INFO L225 Difference]: With dead ends: 43832 [2021-06-12 16:36:39,178 INFO L226 Difference]: Without dead ends: 39932 [2021-06-12 16:36:39,179 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 164.4ms TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2021-06-12 16:36:39,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39932 states. [2021-06-12 16:36:39,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39932 to 38258. [2021-06-12 16:36:39,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38258 states, 38257 states have (on average 3.906370076064511) internal successors, (149446), 38257 states have internal predecessors, (149446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:36:40,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38258 states to 38258 states and 149446 transitions. [2021-06-12 16:36:40,047 INFO L78 Accepts]: Start accepts. Automaton has 38258 states and 149446 transitions. Word has length 91 [2021-06-12 16:36:40,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:36:40,047 INFO L482 AbstractCegarLoop]: Abstraction has 38258 states and 149446 transitions. [2021-06-12 16:36:40,047 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:36:40,047 INFO L276 IsEmpty]: Start isEmpty. Operand 38258 states and 149446 transitions. [2021-06-12 16:36:40,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-06-12 16:36:40,290 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:36:40,291 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 16:36:40,291 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-06-12 16:36:40,291 INFO L430 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 16:36:40,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:36:40,291 INFO L82 PathProgramCache]: Analyzing trace with hash -831517099, now seen corresponding path program 1 times [2021-06-12 16:36:40,291 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:36:40,291 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206124535] [2021-06-12 16:36:40,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:36:40,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:36:40,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 16:36:40,367 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:36:40,367 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206124535] [2021-06-12 16:36:40,367 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206124535] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:36:40,367 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:36:40,367 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-12 16:36:40,367 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104270657] [2021-06-12 16:36:40,368 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-12 16:36:40,368 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:36:40,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-12 16:36:40,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-12 16:36:40,369 INFO L87 Difference]: Start difference. First operand 38258 states and 149446 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:36:40,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:36:40,624 INFO L93 Difference]: Finished difference Result 34910 states and 133516 transitions. [2021-06-12 16:36:40,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-12 16:36:40,624 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2021-06-12 16:36:40,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:36:40,681 INFO L225 Difference]: With dead ends: 34910 [2021-06-12 16:36:40,681 INFO L226 Difference]: Without dead ends: 24740 [2021-06-12 16:36:40,681 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 73.4ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-06-12 16:36:40,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24740 states. [2021-06-12 16:36:41,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24740 to 22548. [2021-06-12 16:36:41,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22548 states, 22547 states have (on average 3.7869783119705502) internal successors, (85385), 22547 states have internal predecessors, (85385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:36:41,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22548 states to 22548 states and 85385 transitions. [2021-06-12 16:36:41,225 INFO L78 Accepts]: Start accepts. Automaton has 22548 states and 85385 transitions. Word has length 91 [2021-06-12 16:36:41,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:36:41,225 INFO L482 AbstractCegarLoop]: Abstraction has 22548 states and 85385 transitions. [2021-06-12 16:36:41,226 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:36:41,226 INFO L276 IsEmpty]: Start isEmpty. Operand 22548 states and 85385 transitions. [2021-06-12 16:36:41,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-06-12 16:36:41,257 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:36:41,257 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 16:36:41,257 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-06-12 16:36:41,257 INFO L430 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 16:36:41,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:36:41,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1057559834, now seen corresponding path program 1 times [2021-06-12 16:36:41,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:36:41,261 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495397147] [2021-06-12 16:36:41,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:36:41,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:36:41,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 16:36:41,333 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:36:41,333 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495397147] [2021-06-12 16:36:41,333 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495397147] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:36:41,333 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:36:41,333 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-12 16:36:41,333 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036951752] [2021-06-12 16:36:41,334 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-12 16:36:41,334 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:36:41,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-12 16:36:41,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-12 16:36:41,334 INFO L87 Difference]: Start difference. First operand 22548 states and 85385 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:36:41,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:36:41,519 INFO L93 Difference]: Finished difference Result 19470 states and 73046 transitions. [2021-06-12 16:36:41,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-12 16:36:41,520 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2021-06-12 16:36:41,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:36:41,542 INFO L225 Difference]: With dead ends: 19470 [2021-06-12 16:36:41,542 INFO L226 Difference]: Without dead ends: 10968 [2021-06-12 16:36:41,542 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 87.4ms TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2021-06-12 16:36:41,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10968 states. [2021-06-12 16:36:41,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10968 to 8408. [2021-06-12 16:36:41,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8408 states, 8407 states have (on average 3.6816938265730936) internal successors, (30952), 8407 states have internal predecessors, (30952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:36:41,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8408 states to 8408 states and 30952 transitions. [2021-06-12 16:36:41,814 INFO L78 Accepts]: Start accepts. Automaton has 8408 states and 30952 transitions. Word has length 94 [2021-06-12 16:36:41,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:36:41,814 INFO L482 AbstractCegarLoop]: Abstraction has 8408 states and 30952 transitions. [2021-06-12 16:36:41,814 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:36:41,815 INFO L276 IsEmpty]: Start isEmpty. Operand 8408 states and 30952 transitions. [2021-06-12 16:36:41,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-06-12 16:36:41,826 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:36:41,826 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 16:36:41,826 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-06-12 16:36:41,826 INFO L430 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 16:36:41,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:36:41,826 INFO L82 PathProgramCache]: Analyzing trace with hash -52076560, now seen corresponding path program 1 times [2021-06-12 16:36:41,826 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:36:41,826 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395360541] [2021-06-12 16:36:41,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:36:41,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-12 16:36:41,847 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-12 16:36:41,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-12 16:36:41,870 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-12 16:36:41,911 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-12 16:36:41,911 INFO L573 BasicCegarLoop]: Counterexample might be feasible [2021-06-12 16:36:41,911 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-06-12 16:36:41,911 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (3/3) [2021-06-12 16:36:41,912 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-12 16:36:42,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.06 04:36:42 BasicIcfg [2021-06-12 16:36:42,030 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-12 16:36:42,031 INFO L168 Benchmark]: Toolchain (without parser) took 133645.37 ms. Allocated memory was 195.0 MB in the beginning and 8.0 GB in the end (delta: 7.8 GB). Free memory was 156.6 MB in the beginning and 4.1 GB in the end (delta: -3.9 GB). Peak memory consumption was 3.9 GB. Max. memory is 8.0 GB. [2021-06-12 16:36:42,031 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 195.0 MB. Free memory is still 174.6 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-06-12 16:36:42,031 INFO L168 Benchmark]: CACSL2BoogieTranslator took 433.73 ms. Allocated memory is still 195.0 MB. Free memory was 156.5 MB in the beginning and 152.5 MB in the end (delta: 3.9 MB). Peak memory consumption was 12.5 MB. Max. memory is 8.0 GB. [2021-06-12 16:36:42,031 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.10 ms. Allocated memory is still 195.0 MB. Free memory was 152.5 MB in the beginning and 149.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-06-12 16:36:42,031 INFO L168 Benchmark]: Boogie Preprocessor took 43.24 ms. Allocated memory is still 195.0 MB. Free memory was 149.5 MB in the beginning and 147.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-06-12 16:36:42,031 INFO L168 Benchmark]: RCFGBuilder took 1346.51 ms. Allocated memory was 195.0 MB in the beginning and 239.1 MB in the end (delta: 44.0 MB). Free memory was 147.4 MB in the beginning and 194.1 MB in the end (delta: -46.7 MB). Peak memory consumption was 110.5 MB. Max. memory is 8.0 GB. [2021-06-12 16:36:42,031 INFO L168 Benchmark]: TraceAbstraction took 131757.97 ms. Allocated memory was 239.1 MB in the beginning and 8.0 GB in the end (delta: 7.8 GB). Free memory was 193.6 MB in the beginning and 4.1 GB in the end (delta: -3.9 GB). Peak memory consumption was 3.9 GB. Max. memory is 8.0 GB. [2021-06-12 16:36:42,031 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.11 ms. Allocated memory is still 195.0 MB. Free memory is still 174.6 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 433.73 ms. Allocated memory is still 195.0 MB. Free memory was 156.5 MB in the beginning and 152.5 MB in the end (delta: 3.9 MB). Peak memory consumption was 12.5 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 58.10 ms. Allocated memory is still 195.0 MB. Free memory was 152.5 MB in the beginning and 149.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 43.24 ms. Allocated memory is still 195.0 MB. Free memory was 149.5 MB in the beginning and 147.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1346.51 ms. Allocated memory was 195.0 MB in the beginning and 239.1 MB in the end (delta: 44.0 MB). Free memory was 147.4 MB in the beginning and 194.1 MB in the end (delta: -46.7 MB). Peak memory consumption was 110.5 MB. Max. memory is 8.0 GB. * TraceAbstraction took 131757.97 ms. Allocated memory was 239.1 MB in the beginning and 8.0 GB in the end (delta: 7.8 GB). Free memory was 193.6 MB in the beginning and 4.1 GB in the end (delta: -3.9 GB). Peak memory consumption was 3.9 GB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0] [L714] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L716] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L717] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0] [L718] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L720] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L722] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L723] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L724] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L725] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L726] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L727] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L728] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L729] 0 _Bool y$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0] [L730] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0] [L731] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L732] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L733] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L734] 0 _Bool y$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0] [L735] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0] [L736] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L737] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L738] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L739] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L740] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L742] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L743] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L744] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L844] 0 pthread_t t821; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L845] FCALL, FORK 0 pthread_create(&t821, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L846] 0 pthread_t t822; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L847] FCALL, FORK 0 pthread_create(&t822, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L848] 0 pthread_t t823; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L849] FCALL, FORK 0 pthread_create(&t823, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L850] 0 pthread_t t824; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L851] FCALL, FORK 0 pthread_create(&t824, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L783] 3 y$w_buff1 = y$w_buff0 [L784] 3 y$w_buff0 = 2 [L785] 3 y$w_buff1_used = y$w_buff0_used [L786] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L788] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L789] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L790] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L791] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L792] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L793] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L796] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L816] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L819] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L822] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L822] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L822] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L822] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L823] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L823] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L824] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L824] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L825] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L825] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L826] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L826] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L748] 1 a = 1 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L751] 1 x = 1 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L763] 2 x = 2 VAL [__unbuffered_cnt=2, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L766] 2 y = 1 VAL [__unbuffered_cnt=2, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L773] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L776] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L799] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L799] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L800] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L800] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L801] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L802] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L803] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L806] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L857] 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) [L857] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L857] 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) [L857] 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) [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L858] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L859] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L859] 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 [L860] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L860] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L861] 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 [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 y$flush_delayed = weak$$choice2 [L867] 0 y$mem_tmp = y [L868] 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) [L868] 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) [L869] 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)) [L869] 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)) [L870] 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)) [L870] 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)) [L871] 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)) [L871] 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)) [L872] 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)) [L872] 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)) [L873] 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)) [L873] 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)) [L874] 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)) [L874] 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)) [L875] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L876] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L876] 0 y = y$flush_delayed ? y$mem_tmp : y [L877] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L18] 0 reach_error() VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P2 with 1 thread instances CFG has 9 procedures, 163 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 22974.9ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 886.8ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 22085.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=135556occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P2Thread1of1ForFork2 with 1 thread instances CFG has 9 procedures, 163 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 23149.4ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 394.2ms, AutomataDifference: 1249.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 21217.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 114 SDtfs, 51 SDslu, 85 SDs, 0 SdLazy, 11 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=135556occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 5.8ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 7.4ms SsaConstructionTime, 53.8ms SatisfiabilityAnalysisTime, 98.1ms InterpolantComputationTime, 59 NumberOfCodeBlocks, 59 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 58 ConstructedInterpolants, 0 QuantifiedInterpolants, 114 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 9 procedures, 163 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 85408.8ms, OverallIterations: 24, TraceHistogramMax: 1, EmptinessCheckTime: 3362.5ms, AutomataDifference: 22202.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 20694.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 4231 SDtfs, 8156 SDslu, 18987 SDs, 0 SdLazy, 2323 SolverSat, 511 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1958.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 379 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 328 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 941 ImplicationChecksByTransitivity, 3353.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=135556occurred in iteration=0, InterpolantAutomatonStates: 293, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 35507.0ms AutomataMinimizationTime, 23 MinimizatonAttempts, 42219 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 62.7ms SsaConstructionTime, 567.7ms SatisfiabilityAnalysisTime, 2699.3ms InterpolantComputationTime, 2070 NumberOfCodeBlocks, 2070 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1949 ConstructedInterpolants, 0 QuantifiedInterpolants, 12647 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...