/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-10 17:35:08,246 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-10 17:35:08,247 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-10 17:35:08,272 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-10 17:35:08,273 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-10 17:35:08,274 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-10 17:35:08,275 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-10 17:35:08,277 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-10 17:35:08,279 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-10 17:35:08,280 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-10 17:35:08,281 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-10 17:35:08,282 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-10 17:35:08,282 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-10 17:35:08,283 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-10 17:35:08,284 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-10 17:35:08,285 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-10 17:35:08,285 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-10 17:35:08,286 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-10 17:35:08,288 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-10 17:35:08,289 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-10 17:35:08,291 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-10 17:35:08,292 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-10 17:35:08,293 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-10 17:35:08,293 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-10 17:35:08,296 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-10 17:35:08,296 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-10 17:35:08,296 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-10 17:35:08,297 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-10 17:35:08,297 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-10 17:35:08,298 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-10 17:35:08,298 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-10 17:35:08,299 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-10 17:35:08,300 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-10 17:35:08,300 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-10 17:35:08,301 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-10 17:35:08,302 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-10 17:35:08,302 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-10 17:35:08,302 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-10 17:35:08,303 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-10 17:35:08,303 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-10 17:35:08,304 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-10 17:35:08,309 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-03-10 17:35:08,336 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-10 17:35:08,337 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-10 17:35:08,337 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-03-10 17:35:08,337 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-03-10 17:35:08,338 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-10 17:35:08,338 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-10 17:35:08,339 INFO L138 SettingsManager]: * Use SBE=true [2021-03-10 17:35:08,339 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-10 17:35:08,339 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-10 17:35:08,339 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-10 17:35:08,339 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-10 17:35:08,339 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-10 17:35:08,340 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-10 17:35:08,340 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-10 17:35:08,340 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-10 17:35:08,340 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-10 17:35:08,340 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-10 17:35:08,340 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-10 17:35:08,341 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-10 17:35:08,341 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-10 17:35:08,341 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-10 17:35:08,341 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-10 17:35:08,341 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-10 17:35:08,341 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-10 17:35:08,342 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-10 17:35:08,342 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-10 17:35:08,342 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-10 17:35:08,342 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-10 17:35:08,342 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-10 17:35:08,342 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-03-10 17:35:08,343 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-03-10 17:35:08,345 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-03-10 17:35:08,637 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-10 17:35:08,657 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-10 17:35:08,659 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-10 17:35:08,660 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-10 17:35:08,661 INFO L275 PluginConnector]: CDTParser initialized [2021-03-10 17:35:08,662 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_rmo.oepc.i [2021-03-10 17:35:08,725 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03eaf4b0a/80ced7ea8927419d96c286614f1ca7fc/FLAGd77d6d3f3 [2021-03-10 17:35:09,304 INFO L306 CDTParser]: Found 1 translation units. [2021-03-10 17:35:09,305 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_rmo.oepc.i [2021-03-10 17:35:09,321 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03eaf4b0a/80ced7ea8927419d96c286614f1ca7fc/FLAGd77d6d3f3 [2021-03-10 17:35:09,704 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03eaf4b0a/80ced7ea8927419d96c286614f1ca7fc [2021-03-10 17:35:09,706 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-10 17:35:09,714 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-10 17:35:09,718 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-10 17:35:09,719 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-10 17:35:09,722 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-10 17:35:09,722 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.03 05:35:09" (1/1) ... [2021-03-10 17:35:09,725 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@469cf382 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:35:09, skipping insertion in model container [2021-03-10 17:35:09,725 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.03 05:35:09" (1/1) ... [2021-03-10 17:35:09,731 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-10 17:35:09,771 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-10 17:35:09,894 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_rmo.oepc.i[950,963] [2021-03-10 17:35:10,141 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-10 17:35:10,153 INFO L203 MainTranslator]: Completed pre-run [2021-03-10 17:35:10,163 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_rmo.oepc.i[950,963] [2021-03-10 17:35:10,224 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-10 17:35:10,302 INFO L208 MainTranslator]: Completed translation [2021-03-10 17:35:10,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:35:10 WrapperNode [2021-03-10 17:35:10,303 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-10 17:35:10,305 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-10 17:35:10,305 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-10 17:35:10,305 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-10 17:35:10,312 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:35:10" (1/1) ... [2021-03-10 17:35:10,343 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:35:10" (1/1) ... [2021-03-10 17:35:10,384 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-10 17:35:10,384 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-10 17:35:10,384 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-10 17:35:10,384 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-10 17:35:10,391 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:35:10" (1/1) ... [2021-03-10 17:35:10,392 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:35:10" (1/1) ... [2021-03-10 17:35:10,394 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:35:10" (1/1) ... [2021-03-10 17:35:10,395 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:35:10" (1/1) ... [2021-03-10 17:35:10,402 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:35:10" (1/1) ... [2021-03-10 17:35:10,405 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:35:10" (1/1) ... [2021-03-10 17:35:10,407 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:35:10" (1/1) ... [2021-03-10 17:35:10,410 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-10 17:35:10,411 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-10 17:35:10,411 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-10 17:35:10,411 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-10 17:35:10,412 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:35:10" (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-03-10 17:35:10,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-10 17:35:10,503 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-10 17:35:10,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-10 17:35:10,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-10 17:35:10,504 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-10 17:35:10,506 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-10 17:35:10,506 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-10 17:35:10,506 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-10 17:35:10,506 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-10 17:35:10,506 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-10 17:35:10,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-10 17:35:10,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-10 17:35:10,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-10 17:35:10,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-10 17:35:10,508 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-10 17:35:12,267 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-10 17:35:12,268 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-10 17:35:12,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.03 05:35:12 BoogieIcfgContainer [2021-03-10 17:35:12,270 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-10 17:35:12,272 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-10 17:35:12,272 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-10 17:35:12,274 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-10 17:35:12,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.03 05:35:09" (1/3) ... [2021-03-10 17:35:12,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@268aad5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.03 05:35:12, skipping insertion in model container [2021-03-10 17:35:12,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:35:10" (2/3) ... [2021-03-10 17:35:12,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@268aad5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.03 05:35:12, skipping insertion in model container [2021-03-10 17:35:12,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.03 05:35:12" (3/3) ... [2021-03-10 17:35:12,277 INFO L111 eAbstractionObserver]: Analyzing ICFG safe030_rmo.oepc.i [2021-03-10 17:35:12,283 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-03-10 17:35:12,283 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-10 17:35:12,287 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-10 17:35:12,288 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-10 17:35:12,323 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,324 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,324 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,324 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,324 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,324 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,324 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,324 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,325 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,325 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,325 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,325 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,325 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,325 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,325 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,326 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,326 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,326 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,326 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,326 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,326 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,326 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,326 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,327 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,327 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,327 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,327 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,327 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,327 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,327 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,328 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,328 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,328 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,328 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,329 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,329 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,329 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,329 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,329 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,329 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,329 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,329 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,329 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,330 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,330 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,330 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,330 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,330 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,330 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,330 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,330 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,331 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,331 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,331 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,331 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,331 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,331 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,331 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,332 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,332 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,332 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,332 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,332 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,332 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,332 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,332 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,333 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,333 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,333 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,333 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,333 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,333 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,333 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,333 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,333 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,334 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,334 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,334 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,334 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,334 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,334 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,334 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,335 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,335 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,335 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,335 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,337 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,337 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,337 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,337 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,337 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,338 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,338 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,338 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,338 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,338 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,340 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,340 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,341 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,341 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,341 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,341 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,342 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,342 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,343 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,343 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,343 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:12,344 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-10 17:35:12,359 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-10 17:35:12,375 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-10 17:35:12,375 INFO L377 AbstractCegarLoop]: Hoare is true [2021-03-10 17:35:12,375 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-10 17:35:12,375 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-10 17:35:12,376 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-10 17:35:12,376 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-10 17:35:12,376 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-10 17:35:12,376 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-10 17:35:12,384 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 104 places, 96 transitions, 207 flow [2021-03-10 17:35:13,235 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 15336 states, 15332 states have (on average 3.6506652752413253) internal successors, (55972), 15335 states have internal predecessors, (55972), 0 states have call successors, (0), 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-03-10 17:35:13,380 INFO L276 IsEmpty]: Start isEmpty. Operand has 15336 states, 15332 states have (on average 3.6506652752413253) internal successors, (55972), 15335 states have internal predecessors, (55972), 0 states have call successors, (0), 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-03-10 17:35:13,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-03-10 17:35:13,387 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:35:13,387 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:35:13,388 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:35:13,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:35:13,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1089194266, now seen corresponding path program 1 times [2021-03-10 17:35:13,410 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:35:13,410 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110732159] [2021-03-10 17:35:13,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:35:13,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:35:13,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:35:13,688 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110732159] [2021-03-10 17:35:13,689 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:35:13,689 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-10 17:35:13,690 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987729456] [2021-03-10 17:35:13,693 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-10 17:35:13,693 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:35:13,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-10 17:35:13,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-10 17:35:13,734 INFO L87 Difference]: Start difference. First operand has 15336 states, 15332 states have (on average 3.6506652752413253) internal successors, (55972), 15335 states have internal predecessors, (55972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:14,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:35:14,020 INFO L93 Difference]: Finished difference Result 13124 states and 46688 transitions. [2021-03-10 17:35:14,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-10 17:35:14,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-03-10 17:35:14,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:35:14,096 INFO L225 Difference]: With dead ends: 13124 [2021-03-10 17:35:14,096 INFO L226 Difference]: Without dead ends: 7492 [2021-03-10 17:35:14,097 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-10 17:35:14,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7492 states. [2021-03-10 17:35:14,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7492 to 7492. [2021-03-10 17:35:14,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7492 states, 7491 states have (on average 3.5071419036176747) internal successors, (26272), 7491 states have internal predecessors, (26272), 0 states have call successors, (0), 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-03-10 17:35:14,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7492 states to 7492 states and 26272 transitions. [2021-03-10 17:35:14,543 INFO L78 Accepts]: Start accepts. Automaton has 7492 states and 26272 transitions. Word has length 38 [2021-03-10 17:35:14,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:35:14,544 INFO L480 AbstractCegarLoop]: Abstraction has 7492 states and 26272 transitions. [2021-03-10 17:35:14,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:14,545 INFO L276 IsEmpty]: Start isEmpty. Operand 7492 states and 26272 transitions. [2021-03-10 17:35:14,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-03-10 17:35:14,560 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:35:14,560 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:35:14,561 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-10 17:35:14,561 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:35:14,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:35:14,564 INFO L82 PathProgramCache]: Analyzing trace with hash -948121074, now seen corresponding path program 1 times [2021-03-10 17:35:14,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:35:14,565 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687957643] [2021-03-10 17:35:14,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:35:14,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:35:14,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:35:14,870 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687957643] [2021-03-10 17:35:14,870 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:35:14,870 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-10 17:35:14,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067391850] [2021-03-10 17:35:14,872 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-10 17:35:14,872 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:35:14,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-10 17:35:14,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-10 17:35:14,873 INFO L87 Difference]: Start difference. First operand 7492 states and 26272 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:15,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:35:15,078 INFO L93 Difference]: Finished difference Result 9252 states and 32116 transitions. [2021-03-10 17:35:15,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 17:35:15,078 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-03-10 17:35:15,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:35:15,126 INFO L225 Difference]: With dead ends: 9252 [2021-03-10 17:35:15,126 INFO L226 Difference]: Without dead ends: 7204 [2021-03-10 17:35:15,127 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 97.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-03-10 17:35:15,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7204 states. [2021-03-10 17:35:15,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7204 to 7204. [2021-03-10 17:35:15,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7204 states, 7203 states have (on average 3.4924337081771486) internal successors, (25156), 7203 states have internal predecessors, (25156), 0 states have call successors, (0), 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-03-10 17:35:15,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7204 states to 7204 states and 25156 transitions. [2021-03-10 17:35:15,445 INFO L78 Accepts]: Start accepts. Automaton has 7204 states and 25156 transitions. Word has length 57 [2021-03-10 17:35:15,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:35:15,446 INFO L480 AbstractCegarLoop]: Abstraction has 7204 states and 25156 transitions. [2021-03-10 17:35:15,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:15,446 INFO L276 IsEmpty]: Start isEmpty. Operand 7204 states and 25156 transitions. [2021-03-10 17:35:15,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-03-10 17:35:15,463 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:35:15,463 INFO L519 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-03-10 17:35:15,463 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-10 17:35:15,463 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:35:15,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:35:15,471 INFO L82 PathProgramCache]: Analyzing trace with hash -939331345, now seen corresponding path program 1 times [2021-03-10 17:35:15,471 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:35:15,471 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172219788] [2021-03-10 17:35:15,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:35:15,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:35:15,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:35:15,647 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172219788] [2021-03-10 17:35:15,647 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:35:15,647 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-10 17:35:15,647 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111988362] [2021-03-10 17:35:15,648 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-10 17:35:15,648 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:35:15,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-10 17:35:15,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-10 17:35:15,652 INFO L87 Difference]: Start difference. First operand 7204 states and 25156 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:15,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:35:15,854 INFO L93 Difference]: Finished difference Result 8844 states and 30580 transitions. [2021-03-10 17:35:15,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 17:35:15,860 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-03-10 17:35:15,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:35:15,891 INFO L225 Difference]: With dead ends: 8844 [2021-03-10 17:35:15,891 INFO L226 Difference]: Without dead ends: 6988 [2021-03-10 17:35:15,892 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 108.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-03-10 17:35:16,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6988 states. [2021-03-10 17:35:16,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6988 to 6988. [2021-03-10 17:35:16,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6988 states, 6987 states have (on average 3.481894947760126) internal successors, (24328), 6987 states have internal predecessors, (24328), 0 states have call successors, (0), 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-03-10 17:35:16,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6988 states to 6988 states and 24328 transitions. [2021-03-10 17:35:16,264 INFO L78 Accepts]: Start accepts. Automaton has 6988 states and 24328 transitions. Word has length 59 [2021-03-10 17:35:16,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:35:16,266 INFO L480 AbstractCegarLoop]: Abstraction has 6988 states and 24328 transitions. [2021-03-10 17:35:16,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:16,266 INFO L276 IsEmpty]: Start isEmpty. Operand 6988 states and 24328 transitions. [2021-03-10 17:35:16,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-03-10 17:35:16,276 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:35:16,276 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:35:16,277 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-10 17:35:16,277 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:35:16,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:35:16,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1534831967, now seen corresponding path program 1 times [2021-03-10 17:35:16,278 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:35:16,278 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881482609] [2021-03-10 17:35:16,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:35:16,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:35:16,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:35:16,449 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881482609] [2021-03-10 17:35:16,449 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:35:16,449 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-10 17:35:16,450 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467741843] [2021-03-10 17:35:16,450 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-10 17:35:16,450 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:35:16,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-10 17:35:16,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-10 17:35:16,451 INFO L87 Difference]: Start difference. First operand 6988 states and 24328 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:16,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:35:16,628 INFO L93 Difference]: Finished difference Result 12108 states and 41544 transitions. [2021-03-10 17:35:16,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 17:35:16,629 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-03-10 17:35:16,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:35:16,657 INFO L225 Difference]: With dead ends: 12108 [2021-03-10 17:35:16,657 INFO L226 Difference]: Without dead ends: 7948 [2021-03-10 17:35:16,657 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 100.1ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-03-10 17:35:16,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7948 states. [2021-03-10 17:35:16,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7948 to 6508. [2021-03-10 17:35:16,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6508 states, 6507 states have (on average 3.4086368526202553) internal successors, (22180), 6507 states have internal predecessors, (22180), 0 states have call successors, (0), 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-03-10 17:35:16,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6508 states to 6508 states and 22180 transitions. [2021-03-10 17:35:16,922 INFO L78 Accepts]: Start accepts. Automaton has 6508 states and 22180 transitions. Word has length 60 [2021-03-10 17:35:16,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:35:16,924 INFO L480 AbstractCegarLoop]: Abstraction has 6508 states and 22180 transitions. [2021-03-10 17:35:16,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:16,924 INFO L276 IsEmpty]: Start isEmpty. Operand 6508 states and 22180 transitions. [2021-03-10 17:35:16,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-03-10 17:35:16,936 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:35:16,936 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:35:16,936 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-10 17:35:16,936 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:35:16,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:35:16,937 INFO L82 PathProgramCache]: Analyzing trace with hash 928131088, now seen corresponding path program 1 times [2021-03-10 17:35:16,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:35:16,938 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200750600] [2021-03-10 17:35:16,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:35:17,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:35:17,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:35:17,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200750600] [2021-03-10 17:35:17,182 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:35:17,182 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-10 17:35:17,182 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846942388] [2021-03-10 17:35:17,183 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-10 17:35:17,184 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:35:17,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-10 17:35:17,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-03-10 17:35:17,185 INFO L87 Difference]: Start difference. First operand 6508 states and 22180 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:17,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:35:17,593 INFO L93 Difference]: Finished difference Result 7840 states and 26554 transitions. [2021-03-10 17:35:17,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-03-10 17:35:17,594 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-03-10 17:35:17,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:35:17,624 INFO L225 Difference]: With dead ends: 7840 [2021-03-10 17:35:17,624 INFO L226 Difference]: Without dead ends: 6448 [2021-03-10 17:35:17,624 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 219.6ms TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2021-03-10 17:35:17,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6448 states. [2021-03-10 17:35:17,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6448 to 6448. [2021-03-10 17:35:17,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6448 states, 6447 states have (on average 3.403133240266791) internal successors, (21940), 6447 states have internal predecessors, (21940), 0 states have call successors, (0), 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-03-10 17:35:17,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6448 states to 6448 states and 21940 transitions. [2021-03-10 17:35:17,815 INFO L78 Accepts]: Start accepts. Automaton has 6448 states and 21940 transitions. Word has length 61 [2021-03-10 17:35:17,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:35:17,816 INFO L480 AbstractCegarLoop]: Abstraction has 6448 states and 21940 transitions. [2021-03-10 17:35:17,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:17,817 INFO L276 IsEmpty]: Start isEmpty. Operand 6448 states and 21940 transitions. [2021-03-10 17:35:17,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-03-10 17:35:17,828 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:35:17,828 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:35:17,829 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-10 17:35:17,829 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:35:17,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:35:17,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1178229839, now seen corresponding path program 1 times [2021-03-10 17:35:17,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:35:17,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956940998] [2021-03-10 17:35:17,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:35:17,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:35:18,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:35:18,041 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956940998] [2021-03-10 17:35:18,042 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:35:18,042 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-10 17:35:18,042 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567120270] [2021-03-10 17:35:18,042 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-10 17:35:18,042 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:35:18,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-10 17:35:18,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-03-10 17:35:18,043 INFO L87 Difference]: Start difference. First operand 6448 states and 21940 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:18,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:35:18,591 INFO L93 Difference]: Finished difference Result 7560 states and 25618 transitions. [2021-03-10 17:35:18,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-10 17:35:18,592 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-03-10 17:35:18,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:35:18,613 INFO L225 Difference]: With dead ends: 7560 [2021-03-10 17:35:18,613 INFO L226 Difference]: Without dead ends: 6568 [2021-03-10 17:35:18,614 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 267.0ms TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2021-03-10 17:35:18,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6568 states. [2021-03-10 17:35:18,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6568 to 6464. [2021-03-10 17:35:18,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6464 states, 6463 states have (on average 3.4015163236886896) internal successors, (21984), 6463 states have internal predecessors, (21984), 0 states have call successors, (0), 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-03-10 17:35:18,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6464 states to 6464 states and 21984 transitions. [2021-03-10 17:35:18,774 INFO L78 Accepts]: Start accepts. Automaton has 6464 states and 21984 transitions. Word has length 62 [2021-03-10 17:35:18,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:35:18,776 INFO L480 AbstractCegarLoop]: Abstraction has 6464 states and 21984 transitions. [2021-03-10 17:35:18,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:18,777 INFO L276 IsEmpty]: Start isEmpty. Operand 6464 states and 21984 transitions. [2021-03-10 17:35:18,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-03-10 17:35:18,788 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:35:18,788 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:35:18,788 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-10 17:35:18,789 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:35:18,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:35:18,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1992047525, now seen corresponding path program 2 times [2021-03-10 17:35:18,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:35:18,789 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168279937] [2021-03-10 17:35:18,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:35:18,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:35:19,047 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 18 [2021-03-10 17:35:19,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:35:19,092 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168279937] [2021-03-10 17:35:19,092 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:35:19,092 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-10 17:35:19,093 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113909912] [2021-03-10 17:35:19,093 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-10 17:35:19,093 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:35:19,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-10 17:35:19,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-03-10 17:35:19,094 INFO L87 Difference]: Start difference. First operand 6464 states and 21984 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:19,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:35:19,484 INFO L93 Difference]: Finished difference Result 7544 states and 25544 transitions. [2021-03-10 17:35:19,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-03-10 17:35:19,485 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-03-10 17:35:19,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:35:19,507 INFO L225 Difference]: With dead ends: 7544 [2021-03-10 17:35:19,507 INFO L226 Difference]: Without dead ends: 6552 [2021-03-10 17:35:19,507 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 319.4ms TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2021-03-10 17:35:19,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6552 states. [2021-03-10 17:35:19,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6552 to 6488. [2021-03-10 17:35:19,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6488 states, 6487 states have (on average 3.4031139201479883) internal successors, (22076), 6487 states have internal predecessors, (22076), 0 states have call successors, (0), 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-03-10 17:35:19,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6488 states to 6488 states and 22076 transitions. [2021-03-10 17:35:19,660 INFO L78 Accepts]: Start accepts. Automaton has 6488 states and 22076 transitions. Word has length 62 [2021-03-10 17:35:19,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:35:19,660 INFO L480 AbstractCegarLoop]: Abstraction has 6488 states and 22076 transitions. [2021-03-10 17:35:19,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:19,661 INFO L276 IsEmpty]: Start isEmpty. Operand 6488 states and 22076 transitions. [2021-03-10 17:35:19,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-03-10 17:35:19,675 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:35:19,675 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:35:19,675 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-10 17:35:19,675 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:35:19,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:35:19,676 INFO L82 PathProgramCache]: Analyzing trace with hash -670065266, now seen corresponding path program 1 times [2021-03-10 17:35:19,676 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:35:19,676 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775933216] [2021-03-10 17:35:19,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:35:19,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:35:19,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:35:19,772 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775933216] [2021-03-10 17:35:19,772 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:35:19,772 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-10 17:35:19,772 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925362805] [2021-03-10 17:35:19,773 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-10 17:35:19,773 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:35:19,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-10 17:35:19,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-10 17:35:19,773 INFO L87 Difference]: Start difference. First operand 6488 states and 22076 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:19,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:35:19,978 INFO L93 Difference]: Finished difference Result 10840 states and 36268 transitions. [2021-03-10 17:35:19,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 17:35:19,978 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-03-10 17:35:19,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:35:19,997 INFO L225 Difference]: With dead ends: 10840 [2021-03-10 17:35:19,997 INFO L226 Difference]: Without dead ends: 7160 [2021-03-10 17:35:19,999 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 90.2ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-03-10 17:35:20,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7160 states. [2021-03-10 17:35:20,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7160 to 6140. [2021-03-10 17:35:20,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6140 states, 6139 states have (on average 3.32431992181137) internal successors, (20408), 6139 states have internal predecessors, (20408), 0 states have call successors, (0), 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-03-10 17:35:20,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6140 states to 6140 states and 20408 transitions. [2021-03-10 17:35:20,159 INFO L78 Accepts]: Start accepts. Automaton has 6140 states and 20408 transitions. Word has length 63 [2021-03-10 17:35:20,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:35:20,159 INFO L480 AbstractCegarLoop]: Abstraction has 6140 states and 20408 transitions. [2021-03-10 17:35:20,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:20,162 INFO L276 IsEmpty]: Start isEmpty. Operand 6140 states and 20408 transitions. [2021-03-10 17:35:20,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-03-10 17:35:20,173 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:35:20,173 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:35:20,173 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-10 17:35:20,173 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:35:20,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:35:20,174 INFO L82 PathProgramCache]: Analyzing trace with hash -593101169, now seen corresponding path program 1 times [2021-03-10 17:35:20,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:35:20,174 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38094573] [2021-03-10 17:35:20,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:35:20,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:35:20,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:35:20,399 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38094573] [2021-03-10 17:35:20,399 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:35:20,399 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-03-10 17:35:20,399 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316705921] [2021-03-10 17:35:20,399 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-03-10 17:35:20,399 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:35:20,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-03-10 17:35:20,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-03-10 17:35:20,400 INFO L87 Difference]: Start difference. First operand 6140 states and 20408 transitions. Second operand has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:20,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:35:20,736 INFO L93 Difference]: Finished difference Result 6972 states and 22984 transitions. [2021-03-10 17:35:20,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-03-10 17:35:20,737 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-03-10 17:35:20,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:35:20,751 INFO L225 Difference]: With dead ends: 6972 [2021-03-10 17:35:20,751 INFO L226 Difference]: Without dead ends: 6204 [2021-03-10 17:35:20,752 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 221.9ms TimeCoverageRelationStatistics Valid=137, Invalid=283, Unknown=0, NotChecked=0, Total=420 [2021-03-10 17:35:20,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6204 states. [2021-03-10 17:35:20,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6204 to 6204. [2021-03-10 17:35:20,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6204 states, 6203 states have (on average 3.3061421892632596) internal successors, (20508), 6203 states have internal predecessors, (20508), 0 states have call successors, (0), 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-03-10 17:35:20,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6204 states to 6204 states and 20508 transitions. [2021-03-10 17:35:20,916 INFO L78 Accepts]: Start accepts. Automaton has 6204 states and 20508 transitions. Word has length 63 [2021-03-10 17:35:20,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:35:20,917 INFO L480 AbstractCegarLoop]: Abstraction has 6204 states and 20508 transitions. [2021-03-10 17:35:20,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:20,917 INFO L276 IsEmpty]: Start isEmpty. Operand 6204 states and 20508 transitions. [2021-03-10 17:35:20,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-03-10 17:35:20,927 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:35:20,927 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:35:20,928 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-10 17:35:20,928 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:35:20,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:35:20,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1228860209, now seen corresponding path program 1 times [2021-03-10 17:35:20,928 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:35:20,928 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561750194] [2021-03-10 17:35:20,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:35:20,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:35:21,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:35:21,109 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561750194] [2021-03-10 17:35:21,109 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:35:21,109 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-10 17:35:21,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296683958] [2021-03-10 17:35:21,110 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-10 17:35:21,110 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:35:21,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-10 17:35:21,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-03-10 17:35:21,110 INFO L87 Difference]: Start difference. First operand 6204 states and 20508 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:21,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:35:21,424 INFO L93 Difference]: Finished difference Result 7276 states and 24008 transitions. [2021-03-10 17:35:21,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-10 17:35:21,425 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-03-10 17:35:21,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:35:21,440 INFO L225 Difference]: With dead ends: 7276 [2021-03-10 17:35:21,440 INFO L226 Difference]: Without dead ends: 6508 [2021-03-10 17:35:21,441 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 194.0ms TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2021-03-10 17:35:21,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6508 states. [2021-03-10 17:35:21,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6508 to 6284. [2021-03-10 17:35:21,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6284 states, 6283 states have (on average 3.296514403947159) internal successors, (20712), 6283 states have internal predecessors, (20712), 0 states have call successors, (0), 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-03-10 17:35:21,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6284 states to 6284 states and 20712 transitions. [2021-03-10 17:35:21,617 INFO L78 Accepts]: Start accepts. Automaton has 6284 states and 20712 transitions. Word has length 63 [2021-03-10 17:35:21,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:35:21,618 INFO L480 AbstractCegarLoop]: Abstraction has 6284 states and 20712 transitions. [2021-03-10 17:35:21,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:21,618 INFO L276 IsEmpty]: Start isEmpty. Operand 6284 states and 20712 transitions. [2021-03-10 17:35:21,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-03-10 17:35:21,628 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:35:21,628 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:35:21,628 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-10 17:35:21,629 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:35:21,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:35:21,629 INFO L82 PathProgramCache]: Analyzing trace with hash -86707731, now seen corresponding path program 2 times [2021-03-10 17:35:21,629 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:35:21,629 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265537759] [2021-03-10 17:35:21,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:35:21,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:35:21,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:35:21,980 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265537759] [2021-03-10 17:35:21,980 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:35:21,980 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-03-10 17:35:21,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857488146] [2021-03-10 17:35:21,981 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-03-10 17:35:21,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:35:21,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-03-10 17:35:21,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2021-03-10 17:35:21,982 INFO L87 Difference]: Start difference. First operand 6284 states and 20712 transitions. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:22,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:35:22,469 INFO L93 Difference]: Finished difference Result 6844 states and 22452 transitions. [2021-03-10 17:35:22,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-03-10 17:35:22,470 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-03-10 17:35:22,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:35:22,481 INFO L225 Difference]: With dead ends: 6844 [2021-03-10 17:35:22,482 INFO L226 Difference]: Without dead ends: 5948 [2021-03-10 17:35:22,482 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 403.3ms TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2021-03-10 17:35:22,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5948 states. [2021-03-10 17:35:22,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5948 to 5804. [2021-03-10 17:35:22,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5804 states, 5803 states have (on average 3.2851973117353093) internal successors, (19064), 5803 states have internal predecessors, (19064), 0 states have call successors, (0), 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-03-10 17:35:22,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5804 states to 5804 states and 19064 transitions. [2021-03-10 17:35:22,602 INFO L78 Accepts]: Start accepts. Automaton has 5804 states and 19064 transitions. Word has length 63 [2021-03-10 17:35:22,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:35:22,602 INFO L480 AbstractCegarLoop]: Abstraction has 5804 states and 19064 transitions. [2021-03-10 17:35:22,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:22,602 INFO L276 IsEmpty]: Start isEmpty. Operand 5804 states and 19064 transitions. [2021-03-10 17:35:22,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-03-10 17:35:22,612 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:35:22,612 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:35:22,612 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-10 17:35:22,612 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:35:22,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:35:22,613 INFO L82 PathProgramCache]: Analyzing trace with hash -940696751, now seen corresponding path program 1 times [2021-03-10 17:35:22,613 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:35:22,613 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998497161] [2021-03-10 17:35:22,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:35:22,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:35:22,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:35:22,796 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998497161] [2021-03-10 17:35:22,796 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:35:22,796 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-10 17:35:22,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039130696] [2021-03-10 17:35:22,797 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-10 17:35:22,797 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:35:22,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-10 17:35:22,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-03-10 17:35:22,798 INFO L87 Difference]: Start difference. First operand 5804 states and 19064 transitions. Second operand has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:23,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:35:23,133 INFO L93 Difference]: Finished difference Result 9577 states and 31265 transitions. [2021-03-10 17:35:23,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-10 17:35:23,134 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-03-10 17:35:23,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:35:23,148 INFO L225 Difference]: With dead ends: 9577 [2021-03-10 17:35:23,148 INFO L226 Difference]: Without dead ends: 8857 [2021-03-10 17:35:23,149 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 188.7ms TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2021-03-10 17:35:23,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8857 states. [2021-03-10 17:35:23,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8857 to 5996. [2021-03-10 17:35:23,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5996 states, 5995 states have (on average 3.2660550458715596) internal successors, (19580), 5995 states have internal predecessors, (19580), 0 states have call successors, (0), 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-03-10 17:35:23,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5996 states to 5996 states and 19580 transitions. [2021-03-10 17:35:23,319 INFO L78 Accepts]: Start accepts. Automaton has 5996 states and 19580 transitions. Word has length 64 [2021-03-10 17:35:23,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:35:23,320 INFO L480 AbstractCegarLoop]: Abstraction has 5996 states and 19580 transitions. [2021-03-10 17:35:23,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:23,320 INFO L276 IsEmpty]: Start isEmpty. Operand 5996 states and 19580 transitions. [2021-03-10 17:35:23,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-03-10 17:35:23,331 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:35:23,331 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:35:23,331 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-10 17:35:23,331 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:35:23,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:35:23,332 INFO L82 PathProgramCache]: Analyzing trace with hash 183993181, now seen corresponding path program 2 times [2021-03-10 17:35:23,332 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:35:23,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745733386] [2021-03-10 17:35:23,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:35:23,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:35:23,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:35:23,551 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745733386] [2021-03-10 17:35:23,551 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:35:23,552 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-10 17:35:23,552 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349677843] [2021-03-10 17:35:23,552 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-10 17:35:23,552 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:35:23,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-10 17:35:23,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-03-10 17:35:23,553 INFO L87 Difference]: Start difference. First operand 5996 states and 19580 transitions. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:23,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:35:23,979 INFO L93 Difference]: Finished difference Result 7460 states and 24430 transitions. [2021-03-10 17:35:23,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-10 17:35:23,980 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-03-10 17:35:23,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:35:23,991 INFO L225 Difference]: With dead ends: 7460 [2021-03-10 17:35:23,991 INFO L226 Difference]: Without dead ends: 6612 [2021-03-10 17:35:23,992 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 309.2ms TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2021-03-10 17:35:24,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6612 states. [2021-03-10 17:35:24,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6612 to 6180. [2021-03-10 17:35:24,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6180 states, 6179 states have (on average 3.287263311215407) internal successors, (20312), 6179 states have internal predecessors, (20312), 0 states have call successors, (0), 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-03-10 17:35:24,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6180 states to 6180 states and 20312 transitions. [2021-03-10 17:35:24,136 INFO L78 Accepts]: Start accepts. Automaton has 6180 states and 20312 transitions. Word has length 64 [2021-03-10 17:35:24,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:35:24,137 INFO L480 AbstractCegarLoop]: Abstraction has 6180 states and 20312 transitions. [2021-03-10 17:35:24,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:24,137 INFO L276 IsEmpty]: Start isEmpty. Operand 6180 states and 20312 transitions. [2021-03-10 17:35:24,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-03-10 17:35:24,147 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:35:24,147 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:35:24,147 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-10 17:35:24,148 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:35:24,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:35:24,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1326170541, now seen corresponding path program 3 times [2021-03-10 17:35:24,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:35:24,148 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737585803] [2021-03-10 17:35:24,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:35:24,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:35:24,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:35:24,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737585803] [2021-03-10 17:35:24,313 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:35:24,313 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-10 17:35:24,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850061104] [2021-03-10 17:35:24,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-10 17:35:24,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:35:24,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-10 17:35:24,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-03-10 17:35:24,315 INFO L87 Difference]: Start difference. First operand 6180 states and 20312 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:24,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:35:24,532 INFO L93 Difference]: Finished difference Result 7011 states and 22990 transitions. [2021-03-10 17:35:24,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 17:35:24,533 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-03-10 17:35:24,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:35:24,543 INFO L225 Difference]: With dead ends: 7011 [2021-03-10 17:35:24,544 INFO L226 Difference]: Without dead ends: 6291 [2021-03-10 17:35:24,544 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 135.9ms TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-03-10 17:35:24,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6291 states. [2021-03-10 17:35:24,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6291 to 6196. [2021-03-10 17:35:24,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6196 states, 6195 states have (on average 3.2858757062146893) internal successors, (20356), 6195 states have internal predecessors, (20356), 0 states have call successors, (0), 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-03-10 17:35:24,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6196 states to 6196 states and 20356 transitions. [2021-03-10 17:35:24,696 INFO L78 Accepts]: Start accepts. Automaton has 6196 states and 20356 transitions. Word has length 64 [2021-03-10 17:35:24,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:35:24,697 INFO L480 AbstractCegarLoop]: Abstraction has 6196 states and 20356 transitions. [2021-03-10 17:35:24,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:24,697 INFO L276 IsEmpty]: Start isEmpty. Operand 6196 states and 20356 transitions. [2021-03-10 17:35:24,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-03-10 17:35:24,707 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:35:24,707 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:35:24,707 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-10 17:35:24,707 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:35:24,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:35:24,708 INFO L82 PathProgramCache]: Analyzing trace with hash 853224239, now seen corresponding path program 4 times [2021-03-10 17:35:24,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:35:24,708 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791606647] [2021-03-10 17:35:24,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:35:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:35:24,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:35:24,905 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791606647] [2021-03-10 17:35:24,905 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:35:24,905 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-10 17:35:24,906 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135761956] [2021-03-10 17:35:24,906 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-10 17:35:24,906 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:35:24,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-10 17:35:24,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-03-10 17:35:24,907 INFO L87 Difference]: Start difference. First operand 6196 states and 20356 transitions. Second operand has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:25,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:35:25,170 INFO L93 Difference]: Finished difference Result 7054 states and 23126 transitions. [2021-03-10 17:35:25,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-10 17:35:25,171 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-03-10 17:35:25,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:35:25,182 INFO L225 Difference]: With dead ends: 7054 [2021-03-10 17:35:25,182 INFO L226 Difference]: Without dead ends: 6302 [2021-03-10 17:35:25,183 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 200.9ms TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2021-03-10 17:35:25,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6302 states. [2021-03-10 17:35:25,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6302 to 6203. [2021-03-10 17:35:25,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6203 states, 6202 states have (on average 3.288939051918736) internal successors, (20398), 6202 states have internal predecessors, (20398), 0 states have call successors, (0), 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-03-10 17:35:25,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6203 states to 6203 states and 20398 transitions. [2021-03-10 17:35:25,335 INFO L78 Accepts]: Start accepts. Automaton has 6203 states and 20398 transitions. Word has length 64 [2021-03-10 17:35:25,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:35:25,336 INFO L480 AbstractCegarLoop]: Abstraction has 6203 states and 20398 transitions. [2021-03-10 17:35:25,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:25,336 INFO L276 IsEmpty]: Start isEmpty. Operand 6203 states and 20398 transitions. [2021-03-10 17:35:25,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-03-10 17:35:25,349 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:35:25,349 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:35:25,350 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-10 17:35:25,350 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:35:25,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:35:25,350 INFO L82 PathProgramCache]: Analyzing trace with hash -820521017, now seen corresponding path program 5 times [2021-03-10 17:35:25,350 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:35:25,350 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530527994] [2021-03-10 17:35:25,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:35:25,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:35:25,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:35:25,633 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530527994] [2021-03-10 17:35:25,635 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:35:25,635 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-03-10 17:35:25,636 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184960029] [2021-03-10 17:35:25,636 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-10 17:35:25,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:35:25,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-10 17:35:25,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-03-10 17:35:25,637 INFO L87 Difference]: Start difference. First operand 6203 states and 20398 transitions. Second operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:26,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:35:26,140 INFO L93 Difference]: Finished difference Result 7595 states and 24747 transitions. [2021-03-10 17:35:26,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-03-10 17:35:26,141 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-03-10 17:35:26,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:35:26,151 INFO L225 Difference]: With dead ends: 7595 [2021-03-10 17:35:26,151 INFO L226 Difference]: Without dead ends: 6171 [2021-03-10 17:35:26,151 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 407.1ms TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2021-03-10 17:35:26,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6171 states. [2021-03-10 17:35:26,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6171 to 5972. [2021-03-10 17:35:26,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5972 states, 5971 states have (on average 3.2476972031485514) internal successors, (19392), 5971 states have internal predecessors, (19392), 0 states have call successors, (0), 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-03-10 17:35:26,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5972 states to 5972 states and 19392 transitions. [2021-03-10 17:35:26,289 INFO L78 Accepts]: Start accepts. Automaton has 5972 states and 19392 transitions. Word has length 64 [2021-03-10 17:35:26,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:35:26,289 INFO L480 AbstractCegarLoop]: Abstraction has 5972 states and 19392 transitions. [2021-03-10 17:35:26,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:26,289 INFO L276 IsEmpty]: Start isEmpty. Operand 5972 states and 19392 transitions. [2021-03-10 17:35:26,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-03-10 17:35:26,297 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:35:26,297 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:35:26,297 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-10 17:35:26,297 INFO L428 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:35:26,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:35:26,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1624114065, now seen corresponding path program 1 times [2021-03-10 17:35:26,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:35:26,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309673708] [2021-03-10 17:35:26,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:35:26,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:35:26,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:35:26,381 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309673708] [2021-03-10 17:35:26,381 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:35:26,381 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-10 17:35:26,381 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887073428] [2021-03-10 17:35:26,381 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-10 17:35:26,381 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:35:26,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-10 17:35:26,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-10 17:35:26,382 INFO L87 Difference]: Start difference. First operand 5972 states and 19392 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:26,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:35:26,493 INFO L93 Difference]: Finished difference Result 7228 states and 22897 transitions. [2021-03-10 17:35:26,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 17:35:26,493 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-03-10 17:35:26,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:35:26,501 INFO L225 Difference]: With dead ends: 7228 [2021-03-10 17:35:26,501 INFO L226 Difference]: Without dead ends: 5036 [2021-03-10 17:35:26,502 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 84.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-03-10 17:35:26,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5036 states. [2021-03-10 17:35:26,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5036 to 5036. [2021-03-10 17:35:26,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5036 states, 5035 states have (on average 3.1602780536246278) internal successors, (15912), 5035 states have internal predecessors, (15912), 0 states have call successors, (0), 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-03-10 17:35:26,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5036 states to 5036 states and 15912 transitions. [2021-03-10 17:35:26,602 INFO L78 Accepts]: Start accepts. Automaton has 5036 states and 15912 transitions. Word has length 65 [2021-03-10 17:35:26,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:35:26,602 INFO L480 AbstractCegarLoop]: Abstraction has 5036 states and 15912 transitions. [2021-03-10 17:35:26,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:26,603 INFO L276 IsEmpty]: Start isEmpty. Operand 5036 states and 15912 transitions. [2021-03-10 17:35:26,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-03-10 17:35:26,608 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:35:26,609 INFO L519 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] [2021-03-10 17:35:26,609 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-10 17:35:26,609 INFO L428 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:35:26,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:35:26,609 INFO L82 PathProgramCache]: Analyzing trace with hash 893703364, now seen corresponding path program 1 times [2021-03-10 17:35:26,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:35:26,609 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284488565] [2021-03-10 17:35:26,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:35:26,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:35:26,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:35:26,685 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284488565] [2021-03-10 17:35:26,685 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:35:26,685 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-10 17:35:26,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297222833] [2021-03-10 17:35:26,686 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-10 17:35:26,686 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:35:26,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-10 17:35:26,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-10 17:35:26,686 INFO L87 Difference]: Start difference. First operand 5036 states and 15912 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 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-03-10 17:35:26,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:35:26,815 INFO L93 Difference]: Finished difference Result 4646 states and 14185 transitions. [2021-03-10 17:35:26,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 17:35:26,816 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2021-03-10 17:35:26,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:35:26,820 INFO L225 Difference]: With dead ends: 4646 [2021-03-10 17:35:26,820 INFO L226 Difference]: Without dead ends: 2982 [2021-03-10 17:35:26,821 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 101.1ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-03-10 17:35:26,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2982 states. [2021-03-10 17:35:26,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2982 to 2846. [2021-03-10 17:35:26,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2846 states, 2845 states have (on average 3.0038664323374342) internal successors, (8546), 2845 states have internal predecessors, (8546), 0 states have call successors, (0), 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-03-10 17:35:26,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2846 states to 2846 states and 8546 transitions. [2021-03-10 17:35:26,865 INFO L78 Accepts]: Start accepts. Automaton has 2846 states and 8546 transitions. Word has length 66 [2021-03-10 17:35:26,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:35:26,865 INFO L480 AbstractCegarLoop]: Abstraction has 2846 states and 8546 transitions. [2021-03-10 17:35:26,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 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-03-10 17:35:26,866 INFO L276 IsEmpty]: Start isEmpty. Operand 2846 states and 8546 transitions. [2021-03-10 17:35:26,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-03-10 17:35:26,869 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:35:26,869 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:35:26,869 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-03-10 17:35:26,869 INFO L428 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:35:26,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:35:26,869 INFO L82 PathProgramCache]: Analyzing trace with hash -89120785, now seen corresponding path program 1 times [2021-03-10 17:35:26,869 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:35:26,870 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302454313] [2021-03-10 17:35:26,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:35:26,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:35:26,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:35:26,965 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302454313] [2021-03-10 17:35:26,965 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:35:26,965 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-10 17:35:26,965 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912840013] [2021-03-10 17:35:26,966 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-10 17:35:26,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:35:26,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-10 17:35:26,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-03-10 17:35:26,967 INFO L87 Difference]: Start difference. First operand 2846 states and 8546 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:27,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:35:27,115 INFO L93 Difference]: Finished difference Result 2216 states and 6419 transitions. [2021-03-10 17:35:27,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 17:35:27,115 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2021-03-10 17:35:27,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:35:27,117 INFO L225 Difference]: With dead ends: 2216 [2021-03-10 17:35:27,117 INFO L226 Difference]: Without dead ends: 1092 [2021-03-10 17:35:27,117 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 121.2ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-03-10 17:35:27,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2021-03-10 17:35:27,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 1060. [2021-03-10 17:35:27,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1060 states, 1059 states have (on average 2.8083097261567516) internal successors, (2974), 1059 states have internal predecessors, (2974), 0 states have call successors, (0), 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-03-10 17:35:27,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 2974 transitions. [2021-03-10 17:35:27,128 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 2974 transitions. Word has length 69 [2021-03-10 17:35:27,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:35:27,128 INFO L480 AbstractCegarLoop]: Abstraction has 1060 states and 2974 transitions. [2021-03-10 17:35:27,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:27,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 2974 transitions. [2021-03-10 17:35:27,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-03-10 17:35:27,129 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:35:27,129 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:35:27,129 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-03-10 17:35:27,129 INFO L428 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:35:27,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:35:27,130 INFO L82 PathProgramCache]: Analyzing trace with hash 764916839, now seen corresponding path program 1 times [2021-03-10 17:35:27,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:35:27,130 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295355492] [2021-03-10 17:35:27,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:35:27,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:35:27,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:35:27,420 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295355492] [2021-03-10 17:35:27,420 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:35:27,420 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-03-10 17:35:27,420 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213733362] [2021-03-10 17:35:27,421 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-03-10 17:35:27,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:35:27,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-03-10 17:35:27,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2021-03-10 17:35:27,421 INFO L87 Difference]: Start difference. First operand 1060 states and 2974 transitions. Second operand has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:27,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:35:27,839 INFO L93 Difference]: Finished difference Result 2206 states and 6318 transitions. [2021-03-10 17:35:27,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-10 17:35:27,839 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-03-10 17:35:27,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:35:27,841 INFO L225 Difference]: With dead ends: 2206 [2021-03-10 17:35:27,841 INFO L226 Difference]: Without dead ends: 1392 [2021-03-10 17:35:27,841 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 397.3ms TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2021-03-10 17:35:27,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2021-03-10 17:35:27,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 908. [2021-03-10 17:35:27,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 907 states have (on average 2.780595369349504) internal successors, (2522), 907 states have internal predecessors, (2522), 0 states have call successors, (0), 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-03-10 17:35:27,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 2522 transitions. [2021-03-10 17:35:27,855 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 2522 transitions. Word has length 72 [2021-03-10 17:35:27,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:35:27,855 INFO L480 AbstractCegarLoop]: Abstraction has 908 states and 2522 transitions. [2021-03-10 17:35:27,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:27,855 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 2522 transitions. [2021-03-10 17:35:27,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-03-10 17:35:27,856 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:35:27,856 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:35:27,856 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-03-10 17:35:27,857 INFO L428 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:35:27,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:35:27,857 INFO L82 PathProgramCache]: Analyzing trace with hash -701347545, now seen corresponding path program 2 times [2021-03-10 17:35:27,857 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:35:27,857 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168413416] [2021-03-10 17:35:27,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:35:27,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:35:28,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:35:28,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168413416] [2021-03-10 17:35:28,095 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:35:28,095 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-03-10 17:35:28,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582853816] [2021-03-10 17:35:28,095 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-10 17:35:28,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:35:28,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-10 17:35:28,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-03-10 17:35:28,096 INFO L87 Difference]: Start difference. First operand 908 states and 2522 transitions. Second operand has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:28,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:35:28,249 INFO L93 Difference]: Finished difference Result 1378 states and 3902 transitions. [2021-03-10 17:35:28,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 17:35:28,250 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-03-10 17:35:28,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:35:28,251 INFO L225 Difference]: With dead ends: 1378 [2021-03-10 17:35:28,251 INFO L226 Difference]: Without dead ends: 788 [2021-03-10 17:35:28,251 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 195.3ms TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2021-03-10 17:35:28,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2021-03-10 17:35:28,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 748. [2021-03-10 17:35:28,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 747 states have (on average 2.7228915662650603) internal successors, (2034), 747 states have internal predecessors, (2034), 0 states have call successors, (0), 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-03-10 17:35:28,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 2034 transitions. [2021-03-10 17:35:28,259 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 2034 transitions. Word has length 72 [2021-03-10 17:35:28,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:35:28,259 INFO L480 AbstractCegarLoop]: Abstraction has 748 states and 2034 transitions. [2021-03-10 17:35:28,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:28,259 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 2034 transitions. [2021-03-10 17:35:28,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-03-10 17:35:28,260 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:35:28,260 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:35:28,260 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-03-10 17:35:28,260 INFO L428 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:35:28,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:35:28,261 INFO L82 PathProgramCache]: Analyzing trace with hash -518831961, now seen corresponding path program 3 times [2021-03-10 17:35:28,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:35:28,261 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711066671] [2021-03-10 17:35:28,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:35:28,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-10 17:35:28,293 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-10 17:35:28,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-10 17:35:28,332 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-10 17:35:28,363 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-10 17:35:28,363 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-10 17:35:28,364 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-03-10 17:35:28,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.03 05:35:28 BasicIcfg [2021-03-10 17:35:28,504 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-10 17:35:28,504 INFO L168 Benchmark]: Toolchain (without parser) took 18795.89 ms. Allocated memory was 255.9 MB in the beginning and 6.0 GB in the end (delta: 5.8 GB). Free memory was 232.1 MB in the beginning and 4.0 GB in the end (delta: -3.7 GB). Peak memory consumption was 2.1 GB. Max. memory is 16.0 GB. [2021-03-10 17:35:28,504 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 255.9 MB. Free memory is still 238.4 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-10 17:35:28,505 INFO L168 Benchmark]: CACSL2BoogieTranslator took 585.30 ms. Allocated memory was 255.9 MB in the beginning and 406.8 MB in the end (delta: 151.0 MB). Free memory was 231.4 MB in the beginning and 368.1 MB in the end (delta: -136.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.0 GB. [2021-03-10 17:35:28,505 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.83 ms. Allocated memory is still 406.8 MB. Free memory was 368.1 MB in the beginning and 365.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-10 17:35:28,505 INFO L168 Benchmark]: Boogie Preprocessor took 26.39 ms. Allocated memory is still 406.8 MB. Free memory was 365.5 MB in the beginning and 362.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-10 17:35:28,505 INFO L168 Benchmark]: RCFGBuilder took 1859.00 ms. Allocated memory is still 406.8 MB. Free memory was 362.9 MB in the beginning and 364.7 MB in the end (delta: -1.8 MB). Peak memory consumption was 112.0 MB. Max. memory is 16.0 GB. [2021-03-10 17:35:28,505 INFO L168 Benchmark]: TraceAbstraction took 16232.02 ms. Allocated memory was 406.8 MB in the beginning and 6.0 GB in the end (delta: 5.6 GB). Free memory was 363.7 MB in the beginning and 4.0 GB in the end (delta: -3.6 GB). Peak memory consumption was 2.1 GB. Max. memory is 16.0 GB. [2021-03-10 17:35:28,506 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.18 ms. Allocated memory is still 255.9 MB. Free memory is still 238.4 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 585.30 ms. Allocated memory was 255.9 MB in the beginning and 406.8 MB in the end (delta: 151.0 MB). Free memory was 231.4 MB in the beginning and 368.1 MB in the end (delta: -136.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 78.83 ms. Allocated memory is still 406.8 MB. Free memory was 368.1 MB in the beginning and 365.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 26.39 ms. Allocated memory is still 406.8 MB. Free memory was 365.5 MB in the beginning and 362.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1859.00 ms. Allocated memory is still 406.8 MB. Free memory was 362.9 MB in the beginning and 364.7 MB in the end (delta: -1.8 MB). Peak memory consumption was 112.0 MB. Max. memory is 16.0 GB. * TraceAbstraction took 16232.02 ms. Allocated memory was 406.8 MB in the beginning and 6.0 GB in the end (delta: 5.6 GB). Free memory was 363.7 MB in the beginning and 4.0 GB in the end (delta: -3.6 GB). Peak memory consumption was 2.1 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L711] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L713] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L715] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L717] 0 int z = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L718] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L719] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L720] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L721] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L722] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L723] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L724] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L725] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L726] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L727] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L728] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L729] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L730] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L731] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L732] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L733] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L735] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L816] 0 pthread_t t2501; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] FCALL, FORK 0 pthread_create(&t2501, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L739] 1 z$w_buff1 = z$w_buff0 [L740] 1 z$w_buff0 = 2 [L741] 1 z$w_buff1_used = z$w_buff0_used [L742] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L744] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L745] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L746] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L747] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L748] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 pthread_t t2502; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] FCALL, FORK 0 pthread_create(&t2502, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 pthread_t t2503; VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] FCALL, FORK 0 pthread_create(&t2503, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L774] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L774] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L774] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L775] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L775] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L776] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L777] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L777] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L778] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] 3 y = 2 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z = 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L794] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L794] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L794] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L794] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L795] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L795] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L796] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L797] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L798] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L754] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L755] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L755] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L756] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L757] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L758] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L823] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L827] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L827] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L827] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L828] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L828] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L829] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L830] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L831] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L834] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L835] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L836] 0 z$flush_delayed = weak$$choice2 [L837] 0 z$mem_tmp = z [L838] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L838] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L839] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L839] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L839] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L839] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L840] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L840] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L840] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L840] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L841] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L841] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L841] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L841] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L842] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L842] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L843] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L843] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L843] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L844] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L844] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L846] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L846] 0 z = z$flush_delayed ? z$mem_tmp : z [L847] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 95 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 15990.8ms, OverallIterations: 22, TraceHistogramMax: 1, EmptinessCheckTime: 345.1ms, AutomataDifference: 6737.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 859.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2657 SDtfs, 4079 SDslu, 10981 SDs, 0 SdLazy, 1996 SolverSat, 351 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2252.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 319 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 274 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 635 ImplicationChecksByTransitivity, 4173.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=15336occurred in iteration=0, InterpolantAutomatonStates: 244, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 3446.7ms AutomataMinimizationTime, 21 MinimizatonAttempts, 7374 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 68.4ms SsaConstructionTime, 743.2ms SatisfiabilityAnalysisTime, 3415.2ms InterpolantComputationTime, 1387 NumberOfCodeBlocks, 1387 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1294 ConstructedInterpolants, 0 QuantifiedInterpolants, 8245 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...