/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/safe011_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-10 17:29:45,516 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-10 17:29:45,518 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-10 17:29:45,551 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-10 17:29:45,552 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-10 17:29:45,555 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-10 17:29:45,557 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-10 17:29:45,563 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-10 17:29:45,565 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-10 17:29:45,571 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-10 17:29:45,572 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-10 17:29:45,573 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-10 17:29:45,573 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-10 17:29:45,575 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-10 17:29:45,577 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-10 17:29:45,578 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-10 17:29:45,578 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-10 17:29:45,579 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-10 17:29:45,580 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-10 17:29:45,582 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-10 17:29:45,583 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-10 17:29:45,584 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-10 17:29:45,585 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-10 17:29:45,585 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-10 17:29:45,587 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-10 17:29:45,588 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-10 17:29:45,588 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-10 17:29:45,588 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-10 17:29:45,589 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-10 17:29:45,590 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-10 17:29:45,590 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-10 17:29:45,590 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-10 17:29:45,591 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-10 17:29:45,592 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-10 17:29:45,592 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-10 17:29:45,593 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-10 17:29:45,593 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-10 17:29:45,593 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-10 17:29:45,594 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-10 17:29:45,594 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-10 17:29:45,595 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-10 17:29:45,596 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:29:45,616 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-10 17:29:45,616 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-10 17:29:45,616 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-03-10 17:29:45,617 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-03-10 17:29:45,617 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-10 17:29:45,618 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-10 17:29:45,618 INFO L138 SettingsManager]: * Use SBE=true [2021-03-10 17:29:45,618 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-10 17:29:45,618 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-10 17:29:45,618 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-10 17:29:45,618 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-10 17:29:45,619 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-10 17:29:45,619 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-10 17:29:45,619 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-10 17:29:45,619 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-10 17:29:45,619 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-10 17:29:45,619 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-10 17:29:45,619 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-10 17:29:45,619 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-10 17:29:45,620 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-10 17:29:45,620 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-10 17:29:45,620 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-10 17:29:45,620 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-10 17:29:45,620 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-10 17:29:45,620 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-10 17:29:45,621 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-10 17:29:45,621 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-10 17:29:45,621 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-10 17:29:45,621 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-10 17:29:45,621 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-03-10 17:29:45,621 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-03-10 17:29:45,621 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:29:45,927 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-10 17:29:45,947 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-10 17:29:45,950 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-10 17:29:45,951 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-10 17:29:45,952 INFO L275 PluginConnector]: CDTParser initialized [2021-03-10 17:29:45,953 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_rmo.oepc.i [2021-03-10 17:29:46,019 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f61172abd/f38671c489c849c484fee030f8227056/FLAG72e8d7277 [2021-03-10 17:29:46,511 INFO L306 CDTParser]: Found 1 translation units. [2021-03-10 17:29:46,511 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_rmo.oepc.i [2021-03-10 17:29:46,531 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f61172abd/f38671c489c849c484fee030f8227056/FLAG72e8d7277 [2021-03-10 17:29:47,030 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f61172abd/f38671c489c849c484fee030f8227056 [2021-03-10 17:29:47,034 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-10 17:29:47,038 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-10 17:29:47,040 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-10 17:29:47,040 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-10 17:29:47,043 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-10 17:29:47,043 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.03 05:29:47" (1/1) ... [2021-03-10 17:29:47,044 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45bc5aa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:29:47, skipping insertion in model container [2021-03-10 17:29:47,044 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.03 05:29:47" (1/1) ... [2021-03-10 17:29:47,050 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-10 17:29:47,078 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-10 17:29:47,213 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/safe011_rmo.oepc.i[950,963] [2021-03-10 17:29:47,349 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-10 17:29:47,356 INFO L203 MainTranslator]: Completed pre-run [2021-03-10 17:29:47,365 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/safe011_rmo.oepc.i[950,963] [2021-03-10 17:29:47,405 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-10 17:29:47,474 INFO L208 MainTranslator]: Completed translation [2021-03-10 17:29:47,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:29:47 WrapperNode [2021-03-10 17:29:47,475 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-10 17:29:47,476 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-10 17:29:47,476 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-10 17:29:47,476 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-10 17:29:47,484 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:29:47" (1/1) ... [2021-03-10 17:29:47,511 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:29:47" (1/1) ... [2021-03-10 17:29:47,553 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-10 17:29:47,554 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-10 17:29:47,554 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-10 17:29:47,554 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-10 17:29:47,564 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:29:47" (1/1) ... [2021-03-10 17:29:47,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:29:47" (1/1) ... [2021-03-10 17:29:47,577 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:29:47" (1/1) ... [2021-03-10 17:29:47,577 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:29:47" (1/1) ... [2021-03-10 17:29:47,585 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:29:47" (1/1) ... [2021-03-10 17:29:47,604 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:29:47" (1/1) ... [2021-03-10 17:29:47,607 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:29:47" (1/1) ... [2021-03-10 17:29:47,610 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-10 17:29:47,611 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-10 17:29:47,611 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-10 17:29:47,611 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-10 17:29:47,612 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:29:47" (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:29:47,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-10 17:29:47,691 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-10 17:29:47,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-10 17:29:47,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-10 17:29:47,692 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-10 17:29:47,692 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-10 17:29:47,692 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-10 17:29:47,692 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-10 17:29:47,692 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-10 17:29:47,692 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-10 17:29:47,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-10 17:29:47,693 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-10 17:29:47,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-10 17:29:47,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-10 17:29:47,694 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:29:49,497 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-10 17:29:49,498 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-10 17:29:49,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.03 05:29:49 BoogieIcfgContainer [2021-03-10 17:29:49,500 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-10 17:29:49,502 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-10 17:29:49,502 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-10 17:29:49,504 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-10 17:29:49,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.03 05:29:47" (1/3) ... [2021-03-10 17:29:49,505 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a592dc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.03 05:29:49, skipping insertion in model container [2021-03-10 17:29:49,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:29:47" (2/3) ... [2021-03-10 17:29:49,506 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a592dc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.03 05:29:49, skipping insertion in model container [2021-03-10 17:29:49,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.03 05:29:49" (3/3) ... [2021-03-10 17:29:49,507 INFO L111 eAbstractionObserver]: Analyzing ICFG safe011_rmo.oepc.i [2021-03-10 17:29:49,514 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-03-10 17:29:49,514 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-10 17:29:49,517 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-10 17:29:49,518 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-10 17:29:49,548 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,548 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,549 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,549 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,549 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,549 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,549 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,549 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,549 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,549 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,550 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,550 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,550 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,550 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,550 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,550 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,551 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,551 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,551 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,551 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,551 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,551 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,551 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,552 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,552 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,552 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,552 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,552 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,552 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,553 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,553 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,553 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,553 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,553 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,554 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,554 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,554 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,554 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,554 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,554 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,555 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,555 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,555 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,555 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,555 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,555 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,555 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,555 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,556 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,556 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,556 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,556 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,556 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,556 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,557 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,557 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,557 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,557 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,557 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,557 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,558 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,558 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,558 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,558 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,558 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,558 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,558 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,559 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,561 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,562 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,562 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,562 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,563 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,564 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,564 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,564 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,564 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,564 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,564 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,564 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,565 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,565 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,566 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,567 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,567 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,567 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,567 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,567 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,567 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,568 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,568 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,568 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,570 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,570 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,570 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,570 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,570 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,570 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,571 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,571 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,571 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,571 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,571 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,571 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:29:49,572 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-10 17:29:49,586 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-10 17:29:49,601 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-10 17:29:49,601 INFO L377 AbstractCegarLoop]: Hoare is true [2021-03-10 17:29:49,601 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-10 17:29:49,601 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-10 17:29:49,602 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-10 17:29:49,602 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-10 17:29:49,602 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-10 17:29:49,602 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-10 17:29:49,610 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 105 places, 97 transitions, 209 flow [2021-03-10 17:29:50,591 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 15337 states, 15333 states have (on average 3.6504924020087395) internal successors, (55973), 15336 states have internal predecessors, (55973), 0 states have call successors, (0), 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:29:50,627 INFO L276 IsEmpty]: Start isEmpty. Operand has 15337 states, 15333 states have (on average 3.6504924020087395) internal successors, (55973), 15336 states have internal predecessors, (55973), 0 states have call successors, (0), 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:29:50,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-03-10 17:29:50,646 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:29:50,647 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] [2021-03-10 17:29:50,647 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:29:50,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:29:50,654 INFO L82 PathProgramCache]: Analyzing trace with hash 522056518, now seen corresponding path program 1 times [2021-03-10 17:29:50,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:29:50,661 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788871811] [2021-03-10 17:29:50,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:29:50,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:29:50,923 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:29:50,924 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788871811] [2021-03-10 17:29:50,924 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:29:50,925 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-10 17:29:50,925 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830117654] [2021-03-10 17:29:50,928 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-10 17:29:50,929 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:29:50,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-10 17:29:50,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-10 17:29:50,976 INFO L87 Difference]: Start difference. First operand has 15337 states, 15333 states have (on average 3.6504924020087395) internal successors, (55973), 15336 states have internal predecessors, (55973), 0 states have call successors, (0), 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.5) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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:29:51,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:29:51,272 INFO L93 Difference]: Finished difference Result 13125 states and 46689 transitions. [2021-03-10 17:29:51,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-10 17:29:51,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2021-03-10 17:29:51,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:29:51,410 INFO L225 Difference]: With dead ends: 13125 [2021-03-10 17:29:51,410 INFO L226 Difference]: Without dead ends: 7493 [2021-03-10 17:29:51,423 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-10 17:29:51,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7493 states. [2021-03-10 17:29:51,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7493 to 7493. [2021-03-10 17:29:51,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7493 states, 7492 states have (on average 3.5068072610784835) internal successors, (26273), 7492 states have internal predecessors, (26273), 0 states have call successors, (0), 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:29:51,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7493 states to 7493 states and 26273 transitions. [2021-03-10 17:29:51,853 INFO L78 Accepts]: Start accepts. Automaton has 7493 states and 26273 transitions. Word has length 39 [2021-03-10 17:29:51,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:29:51,853 INFO L480 AbstractCegarLoop]: Abstraction has 7493 states and 26273 transitions. [2021-03-10 17:29:51,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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:29:51,854 INFO L276 IsEmpty]: Start isEmpty. Operand 7493 states and 26273 transitions. [2021-03-10 17:29:51,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-03-10 17:29:51,869 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:29:51,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] [2021-03-10 17:29:51,869 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-10 17:29:51,870 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:29:51,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:29:51,873 INFO L82 PathProgramCache]: Analyzing trace with hash -95450143, now seen corresponding path program 1 times [2021-03-10 17:29:51,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:29:51,874 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497355555] [2021-03-10 17:29:51,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:29:51,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:29:52,061 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:29:52,062 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497355555] [2021-03-10 17:29:52,062 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:29:52,062 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-10 17:29:52,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231802493] [2021-03-10 17:29:52,064 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-10 17:29:52,064 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:29:52,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-10 17:29:52,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-10 17:29:52,066 INFO L87 Difference]: Start difference. First operand 7493 states and 26273 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 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:29:52,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:29:52,371 INFO L93 Difference]: Finished difference Result 9253 states and 32117 transitions. [2021-03-10 17:29:52,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 17:29:52,372 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2021-03-10 17:29:52,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:29:52,430 INFO L225 Difference]: With dead ends: 9253 [2021-03-10 17:29:52,430 INFO L226 Difference]: Without dead ends: 7205 [2021-03-10 17:29:52,432 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 175.3ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-03-10 17:29:52,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7205 states. [2021-03-10 17:29:52,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7205 to 7205. [2021-03-10 17:29:52,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7205 states, 7204 states have (on average 3.4920877290394223) internal successors, (25157), 7204 states have internal predecessors, (25157), 0 states have call successors, (0), 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:29:52,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7205 states to 7205 states and 25157 transitions. [2021-03-10 17:29:52,750 INFO L78 Accepts]: Start accepts. Automaton has 7205 states and 25157 transitions. Word has length 58 [2021-03-10 17:29:52,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:29:52,751 INFO L480 AbstractCegarLoop]: Abstraction has 7205 states and 25157 transitions. [2021-03-10 17:29:52,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 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:29:52,751 INFO L276 IsEmpty]: Start isEmpty. Operand 7205 states and 25157 transitions. [2021-03-10 17:29:52,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-03-10 17:29:52,765 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:29:52,766 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:29:52,766 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-10 17:29:52,766 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:29:52,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:29:52,773 INFO L82 PathProgramCache]: Analyzing trace with hash -2065500064, now seen corresponding path program 1 times [2021-03-10 17:29:52,773 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:29:52,774 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148274921] [2021-03-10 17:29:52,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:29:52,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:29:53,117 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:29:53,118 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148274921] [2021-03-10 17:29:53,118 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:29:53,118 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-10 17:29:53,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688320653] [2021-03-10 17:29:53,118 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-10 17:29:53,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:29:53,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-10 17:29:53,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-03-10 17:29:53,121 INFO L87 Difference]: Start difference. First operand 7205 states and 25157 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 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:29:53,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:29:53,465 INFO L93 Difference]: Finished difference Result 8693 states and 30091 transitions. [2021-03-10 17:29:53,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-10 17:29:53,470 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 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:29:53,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:29:53,497 INFO L225 Difference]: With dead ends: 8693 [2021-03-10 17:29:53,497 INFO L226 Difference]: Without dead ends: 7157 [2021-03-10 17:29:53,498 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 179.9ms TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2021-03-10 17:29:53,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7157 states. [2021-03-10 17:29:53,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7157 to 7133. [2021-03-10 17:29:53,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7133 states, 7132 states have (on average 3.4869601794727987) internal successors, (24869), 7132 states have internal predecessors, (24869), 0 states have call successors, (0), 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:29:53,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7133 states to 7133 states and 24869 transitions. [2021-03-10 17:29:53,751 INFO L78 Accepts]: Start accepts. Automaton has 7133 states and 24869 transitions. Word has length 60 [2021-03-10 17:29:53,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:29:53,754 INFO L480 AbstractCegarLoop]: Abstraction has 7133 states and 24869 transitions. [2021-03-10 17:29:53,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 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:29:53,754 INFO L276 IsEmpty]: Start isEmpty. Operand 7133 states and 24869 transitions. [2021-03-10 17:29:53,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-03-10 17:29:53,764 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:29:53,764 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:29:53,764 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-10 17:29:53,764 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:29:53,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:29:53,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1979542392, now seen corresponding path program 1 times [2021-03-10 17:29:53,765 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:29:53,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997245371] [2021-03-10 17:29:53,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:29:53,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:29:53,909 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:29:53,909 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997245371] [2021-03-10 17:29:53,910 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:29:53,910 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-10 17:29:53,910 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706299083] [2021-03-10 17:29:53,910 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-10 17:29:53,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:29:53,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-10 17:29:53,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-10 17:29:53,911 INFO L87 Difference]: Start difference. First operand 7133 states and 24869 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 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:29:54,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:29:54,062 INFO L93 Difference]: Finished difference Result 8213 states and 28329 transitions. [2021-03-10 17:29:54,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 17:29:54,062 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 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:29:54,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:29:54,085 INFO L225 Difference]: With dead ends: 8213 [2021-03-10 17:29:54,085 INFO L226 Difference]: Without dead ends: 6485 [2021-03-10 17:29:54,086 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 88.3ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-03-10 17:29:54,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6485 states. [2021-03-10 17:29:54,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6485 to 6485. [2021-03-10 17:29:54,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6485 states, 6484 states have (on average 3.46529919802591) internal successors, (22469), 6484 states have internal predecessors, (22469), 0 states have call successors, (0), 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:29:54,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6485 states to 6485 states and 22469 transitions. [2021-03-10 17:29:54,363 INFO L78 Accepts]: Start accepts. Automaton has 6485 states and 22469 transitions. Word has length 61 [2021-03-10 17:29:54,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:29:54,365 INFO L480 AbstractCegarLoop]: Abstraction has 6485 states and 22469 transitions. [2021-03-10 17:29:54,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 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:29:54,365 INFO L276 IsEmpty]: Start isEmpty. Operand 6485 states and 22469 transitions. [2021-03-10 17:29:54,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-03-10 17:29:54,378 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:29:54,378 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:29:54,378 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-10 17:29:54,379 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:29:54,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:29:54,379 INFO L82 PathProgramCache]: Analyzing trace with hash 991590087, now seen corresponding path program 1 times [2021-03-10 17:29:54,379 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:29:54,379 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300911532] [2021-03-10 17:29:54,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:29:54,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:29:54,563 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:29:54,564 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300911532] [2021-03-10 17:29:54,564 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:29:54,564 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-10 17:29:54,564 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838438333] [2021-03-10 17:29:54,565 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-10 17:29:54,565 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:29:54,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-10 17:29:54,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-03-10 17:29:54,566 INFO L87 Difference]: Start difference. First operand 6485 states and 22469 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 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:29:54,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:29:54,854 INFO L93 Difference]: Finished difference Result 9145 states and 31525 transitions. [2021-03-10 17:29:54,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 17:29:54,855 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 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:29:54,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:29:54,874 INFO L225 Difference]: With dead ends: 9145 [2021-03-10 17:29:54,874 INFO L226 Difference]: Without dead ends: 4697 [2021-03-10 17:29:54,874 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 140.4ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-03-10 17:29:54,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4697 states. [2021-03-10 17:29:54,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4697 to 4697. [2021-03-10 17:29:54,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4697 states, 4696 states have (on average 3.3690374787052813) internal successors, (15821), 4696 states have internal predecessors, (15821), 0 states have call successors, (0), 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:29:54,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4697 states to 4697 states and 15821 transitions. [2021-03-10 17:29:54,992 INFO L78 Accepts]: Start accepts. Automaton has 4697 states and 15821 transitions. Word has length 63 [2021-03-10 17:29:54,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:29:54,993 INFO L480 AbstractCegarLoop]: Abstraction has 4697 states and 15821 transitions. [2021-03-10 17:29:54,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 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:29:54,994 INFO L276 IsEmpty]: Start isEmpty. Operand 4697 states and 15821 transitions. [2021-03-10 17:29:55,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-03-10 17:29:55,002 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:29:55,002 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:29:55,003 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-10 17:29:55,003 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:29:55,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:29:55,003 INFO L82 PathProgramCache]: Analyzing trace with hash -209886158, now seen corresponding path program 1 times [2021-03-10 17:29:55,003 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:29:55,003 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138639777] [2021-03-10 17:29:55,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:29:55,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:29:55,204 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:29:55,205 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138639777] [2021-03-10 17:29:55,205 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:29:55,205 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-10 17:29:55,206 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663914752] [2021-03-10 17:29:55,206 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-10 17:29:55,206 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:29:55,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-10 17:29:55,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-03-10 17:29:55,207 INFO L87 Difference]: Start difference. First operand 4697 states and 15821 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:29:55,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:29:55,651 INFO L93 Difference]: Finished difference Result 5629 states and 18879 transitions. [2021-03-10 17:29:55,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-03-10 17:29:55,652 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:29:55,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:29:55,669 INFO L225 Difference]: With dead ends: 5629 [2021-03-10 17:29:55,669 INFO L226 Difference]: Without dead ends: 4797 [2021-03-10 17:29:55,669 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 244.9ms TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2021-03-10 17:29:55,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4797 states. [2021-03-10 17:29:55,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4797 to 4749. [2021-03-10 17:29:55,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4749 states, 4748 states have (on average 3.37089300758214) internal successors, (16005), 4748 states have internal predecessors, (16005), 0 states have call successors, (0), 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:29:55,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4749 states to 4749 states and 16005 transitions. [2021-03-10 17:29:55,791 INFO L78 Accepts]: Start accepts. Automaton has 4749 states and 16005 transitions. Word has length 64 [2021-03-10 17:29:55,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:29:55,792 INFO L480 AbstractCegarLoop]: Abstraction has 4749 states and 16005 transitions. [2021-03-10 17:29:55,793 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:29:55,793 INFO L276 IsEmpty]: Start isEmpty. Operand 4749 states and 16005 transitions. [2021-03-10 17:29:55,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-03-10 17:29:55,802 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:29:55,803 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:29:55,803 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-10 17:29:55,803 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:29:55,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:29:55,803 INFO L82 PathProgramCache]: Analyzing trace with hash -510655964, now seen corresponding path program 1 times [2021-03-10 17:29:55,804 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:29:55,804 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809524423] [2021-03-10 17:29:55,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:29:55,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:29:56,130 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:29:56,130 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809524423] [2021-03-10 17:29:56,131 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:29:56,131 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-03-10 17:29:56,131 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501347918] [2021-03-10 17:29:56,131 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-03-10 17:29:56,131 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:29:56,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-03-10 17:29:56,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2021-03-10 17:29:56,132 INFO L87 Difference]: Start difference. First operand 4749 states and 16005 transitions. Second operand has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 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:29:56,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:29:56,497 INFO L93 Difference]: Finished difference Result 5857 states and 19647 transitions. [2021-03-10 17:29:56,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-03-10 17:29:56,497 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 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:29:56,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:29:56,519 INFO L225 Difference]: With dead ends: 5857 [2021-03-10 17:29:56,519 INFO L226 Difference]: Without dead ends: 4913 [2021-03-10 17:29:56,520 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 311.7ms TimeCoverageRelationStatistics Valid=132, Invalid=288, Unknown=0, NotChecked=0, Total=420 [2021-03-10 17:29:56,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4913 states. [2021-03-10 17:29:56,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4913 to 4913. [2021-03-10 17:29:56,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4913 states, 4912 states have (on average 3.3715390879478826) internal successors, (16561), 4912 states have internal predecessors, (16561), 0 states have call successors, (0), 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:29:56,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4913 states to 4913 states and 16561 transitions. [2021-03-10 17:29:56,633 INFO L78 Accepts]: Start accepts. Automaton has 4913 states and 16561 transitions. Word has length 64 [2021-03-10 17:29:56,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:29:56,634 INFO L480 AbstractCegarLoop]: Abstraction has 4913 states and 16561 transitions. [2021-03-10 17:29:56,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 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:29:56,634 INFO L276 IsEmpty]: Start isEmpty. Operand 4913 states and 16561 transitions. [2021-03-10 17:29:56,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-03-10 17:29:56,643 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:29:56,643 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:29:56,643 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-10 17:29:56,644 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:29:56,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:29:56,644 INFO L82 PathProgramCache]: Analyzing trace with hash -873142336, now seen corresponding path program 1 times [2021-03-10 17:29:56,644 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:29:56,644 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32794993] [2021-03-10 17:29:56,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:29:56,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:29:56,866 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:29:56,867 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32794993] [2021-03-10 17:29:56,867 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:29:56,867 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-03-10 17:29:56,867 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333802081] [2021-03-10 17:29:56,867 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-03-10 17:29:56,867 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:29:56,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-03-10 17:29:56,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-03-10 17:29:56,868 INFO L87 Difference]: Start difference. First operand 4913 states and 16561 transitions. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 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:29:57,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:29:57,269 INFO L93 Difference]: Finished difference Result 5889 states and 19733 transitions. [2021-03-10 17:29:57,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-03-10 17:29:57,270 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 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:29:57,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:29:57,289 INFO L225 Difference]: With dead ends: 5889 [2021-03-10 17:29:57,289 INFO L226 Difference]: Without dead ends: 5121 [2021-03-10 17:29:57,289 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 299.3ms TimeCoverageRelationStatistics Valid=156, Invalid=306, Unknown=0, NotChecked=0, Total=462 [2021-03-10 17:29:57,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5121 states. [2021-03-10 17:29:57,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5121 to 5121. [2021-03-10 17:29:57,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5121 states, 5120 states have (on average 3.3681640625) internal successors, (17245), 5120 states have internal predecessors, (17245), 0 states have call successors, (0), 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:29:57,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5121 states to 5121 states and 17245 transitions. [2021-03-10 17:29:57,456 INFO L78 Accepts]: Start accepts. Automaton has 5121 states and 17245 transitions. Word has length 65 [2021-03-10 17:29:57,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:29:57,456 INFO L480 AbstractCegarLoop]: Abstraction has 5121 states and 17245 transitions. [2021-03-10 17:29:57,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 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:29:57,456 INFO L276 IsEmpty]: Start isEmpty. Operand 5121 states and 17245 transitions. [2021-03-10 17:29:57,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-03-10 17:29:57,469 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:29:57,469 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:29:57,469 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-10 17:29:57,470 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:29:57,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:29:57,470 INFO L82 PathProgramCache]: Analyzing trace with hash -668353517, now seen corresponding path program 1 times [2021-03-10 17:29:57,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:29:57,470 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968675626] [2021-03-10 17:29:57,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:29:57,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:29:57,714 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:29:57,714 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968675626] [2021-03-10 17:29:57,714 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:29:57,714 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-03-10 17:29:57,714 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738370366] [2021-03-10 17:29:57,714 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-03-10 17:29:57,715 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:29:57,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-03-10 17:29:57,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-03-10 17:29:57,715 INFO L87 Difference]: Start difference. First operand 5121 states and 17245 transitions. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 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:29:58,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:29:58,035 INFO L93 Difference]: Finished difference Result 5521 states and 18465 transitions. [2021-03-10 17:29:58,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-10 17:29:58,040 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 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:29:58,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:29:58,054 INFO L225 Difference]: With dead ends: 5521 [2021-03-10 17:29:58,055 INFO L226 Difference]: Without dead ends: 4881 [2021-03-10 17:29:58,055 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 242.2ms TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2021-03-10 17:29:58,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4881 states. [2021-03-10 17:29:58,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4881 to 4561. [2021-03-10 17:29:58,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4561 states, 4560 states have (on average 3.354605263157895) internal successors, (15297), 4560 states have internal predecessors, (15297), 0 states have call successors, (0), 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:29:58,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4561 states to 4561 states and 15297 transitions. [2021-03-10 17:29:58,158 INFO L78 Accepts]: Start accepts. Automaton has 4561 states and 15297 transitions. Word has length 65 [2021-03-10 17:29:58,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:29:58,159 INFO L480 AbstractCegarLoop]: Abstraction has 4561 states and 15297 transitions. [2021-03-10 17:29:58,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 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:29:58,159 INFO L276 IsEmpty]: Start isEmpty. Operand 4561 states and 15297 transitions. [2021-03-10 17:29:58,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-03-10 17:29:58,171 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:29:58,171 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:29:58,171 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-10 17:29:58,171 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:29:58,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:29:58,171 INFO L82 PathProgramCache]: Analyzing trace with hash 2033884144, now seen corresponding path program 1 times [2021-03-10 17:29:58,172 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:29:58,172 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262544440] [2021-03-10 17:29:58,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:29:58,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:29:58,382 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:29:58,383 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262544440] [2021-03-10 17:29:58,383 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:29:58,383 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-10 17:29:58,383 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639632598] [2021-03-10 17:29:58,383 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-10 17:29:58,383 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:29:58,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-10 17:29:58,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-03-10 17:29:58,384 INFO L87 Difference]: Start difference. First operand 4561 states and 15297 transitions. Second operand has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 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:29:58,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:29:58,701 INFO L93 Difference]: Finished difference Result 5681 states and 19033 transitions. [2021-03-10 17:29:58,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-10 17:29:58,702 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 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:29:58,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:29:58,715 INFO L225 Difference]: With dead ends: 5681 [2021-03-10 17:29:58,715 INFO L226 Difference]: Without dead ends: 4969 [2021-03-10 17:29:58,716 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 210.5ms TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2021-03-10 17:29:58,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4969 states. [2021-03-10 17:29:58,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4969 to 4801. [2021-03-10 17:29:58,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4801 states, 4800 states have (on average 3.3622916666666667) internal successors, (16139), 4800 states have internal predecessors, (16139), 0 states have call successors, (0), 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:29:58,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4801 states to 4801 states and 16139 transitions. [2021-03-10 17:29:58,875 INFO L78 Accepts]: Start accepts. Automaton has 4801 states and 16139 transitions. Word has length 66 [2021-03-10 17:29:58,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:29:58,875 INFO L480 AbstractCegarLoop]: Abstraction has 4801 states and 16139 transitions. [2021-03-10 17:29:58,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 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:29:58,875 INFO L276 IsEmpty]: Start isEmpty. Operand 4801 states and 16139 transitions. [2021-03-10 17:29:58,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-03-10 17:29:58,884 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:29:58,884 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:29:58,884 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-10 17:29:58,885 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:29:58,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:29:58,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1733114338, now seen corresponding path program 1 times [2021-03-10 17:29:58,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:29:58,885 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72347330] [2021-03-10 17:29:58,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:29:58,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:29:59,124 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:29:59,125 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72347330] [2021-03-10 17:29:59,125 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:29:59,125 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-03-10 17:29:59,125 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944476501] [2021-03-10 17:29:59,125 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-10 17:29:59,125 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:29:59,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-10 17:29:59,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-03-10 17:29:59,126 INFO L87 Difference]: Start difference. First operand 4801 states and 16139 transitions. Second operand has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 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:29:59,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:29:59,676 INFO L93 Difference]: Finished difference Result 5457 states and 18263 transitions. [2021-03-10 17:29:59,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-03-10 17:29:59,677 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 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:29:59,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:29:59,690 INFO L225 Difference]: With dead ends: 5457 [2021-03-10 17:29:59,690 INFO L226 Difference]: Without dead ends: 4881 [2021-03-10 17:29:59,690 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 398.8ms TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2021-03-10 17:29:59,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4881 states. [2021-03-10 17:29:59,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4881 to 4529. [2021-03-10 17:29:59,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4529 states, 4528 states have (on average 3.35136925795053) internal successors, (15175), 4528 states have internal predecessors, (15175), 0 states have call successors, (0), 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:29:59,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4529 states to 4529 states and 15175 transitions. [2021-03-10 17:29:59,818 INFO L78 Accepts]: Start accepts. Automaton has 4529 states and 15175 transitions. Word has length 66 [2021-03-10 17:29:59,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:29:59,818 INFO L480 AbstractCegarLoop]: Abstraction has 4529 states and 15175 transitions. [2021-03-10 17:29:59,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 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:29:59,819 INFO L276 IsEmpty]: Start isEmpty. Operand 4529 states and 15175 transitions. [2021-03-10 17:29:59,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-03-10 17:29:59,827 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:29:59,827 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:29:59,827 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-10 17:29:59,827 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:29:59,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:29:59,828 INFO L82 PathProgramCache]: Analyzing trace with hash -451764856, now seen corresponding path program 2 times [2021-03-10 17:29:59,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:29:59,830 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524969309] [2021-03-10 17:29:59,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:29:59,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:30:00,029 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:30:00,029 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524969309] [2021-03-10 17:30:00,029 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:30:00,029 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-10 17:30:00,029 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639600096] [2021-03-10 17:30:00,030 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-10 17:30:00,030 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:30:00,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-10 17:30:00,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-03-10 17:30:00,030 INFO L87 Difference]: Start difference. First operand 4529 states and 15175 transitions. Second operand has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 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:30:00,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:30:00,353 INFO L93 Difference]: Finished difference Result 5293 states and 17683 transitions. [2021-03-10 17:30:00,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-10 17:30:00,354 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 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:30:00,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:30:00,364 INFO L225 Difference]: With dead ends: 5293 [2021-03-10 17:30:00,364 INFO L226 Difference]: Without dead ends: 4661 [2021-03-10 17:30:00,365 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 210.5ms TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-03-10 17:30:00,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4661 states. [2021-03-10 17:30:00,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4661 to 4597. [2021-03-10 17:30:00,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4597 states, 4596 states have (on average 3.354873803307224) internal successors, (15419), 4596 states have internal predecessors, (15419), 0 states have call successors, (0), 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:30:00,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4597 states to 4597 states and 15419 transitions. [2021-03-10 17:30:00,482 INFO L78 Accepts]: Start accepts. Automaton has 4597 states and 15419 transitions. Word has length 66 [2021-03-10 17:30:00,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:30:00,483 INFO L480 AbstractCegarLoop]: Abstraction has 4597 states and 15419 transitions. [2021-03-10 17:30:00,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 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:30:00,483 INFO L276 IsEmpty]: Start isEmpty. Operand 4597 states and 15419 transitions. [2021-03-10 17:30:00,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-03-10 17:30:00,492 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:30:00,492 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:30:00,492 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-10 17:30:00,492 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:30:00,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:30:00,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1082419536, now seen corresponding path program 3 times [2021-03-10 17:30:00,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:30:00,493 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923892649] [2021-03-10 17:30:00,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:30:00,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:30:00,700 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:30:00,700 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923892649] [2021-03-10 17:30:00,700 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:30:00,700 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-10 17:30:00,700 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520938691] [2021-03-10 17:30:00,701 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-10 17:30:00,701 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:30:00,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-10 17:30:00,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-03-10 17:30:00,702 INFO L87 Difference]: Start difference. First operand 4597 states and 15419 transitions. Second operand has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 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:30:00,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:30:00,945 INFO L93 Difference]: Finished difference Result 5267 states and 17573 transitions. [2021-03-10 17:30:00,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 17:30:00,947 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 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:30:00,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:30:00,957 INFO L225 Difference]: With dead ends: 5267 [2021-03-10 17:30:00,957 INFO L226 Difference]: Without dead ends: 4667 [2021-03-10 17:30:00,958 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 166.3ms TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2021-03-10 17:30:00,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4667 states. [2021-03-10 17:30:01,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4667 to 4581. [2021-03-10 17:30:01,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4581 states, 4580 states have (on average 3.3534934497816593) internal successors, (15359), 4580 states have internal predecessors, (15359), 0 states have call successors, (0), 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:30:01,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4581 states to 4581 states and 15359 transitions. [2021-03-10 17:30:01,090 INFO L78 Accepts]: Start accepts. Automaton has 4581 states and 15359 transitions. Word has length 66 [2021-03-10 17:30:01,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:30:01,090 INFO L480 AbstractCegarLoop]: Abstraction has 4581 states and 15359 transitions. [2021-03-10 17:30:01,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 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:30:01,091 INFO L276 IsEmpty]: Start isEmpty. Operand 4581 states and 15359 transitions. [2021-03-10 17:30:01,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-03-10 17:30:01,099 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:30:01,099 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] [2021-03-10 17:30:01,100 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-10 17:30:01,100 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:30:01,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:30:01,100 INFO L82 PathProgramCache]: Analyzing trace with hash 430908804, now seen corresponding path program 1 times [2021-03-10 17:30:01,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:30:01,100 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037502090] [2021-03-10 17:30:01,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:30:01,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:30:01,190 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:30:01,192 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037502090] [2021-03-10 17:30:01,192 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:30:01,192 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-10 17:30:01,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434661792] [2021-03-10 17:30:01,193 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-10 17:30:01,193 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:30:01,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-10 17:30:01,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-10 17:30:01,193 INFO L87 Difference]: Start difference. First operand 4581 states and 15359 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:30:01,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:30:01,313 INFO L93 Difference]: Finished difference Result 5605 states and 18479 transitions. [2021-03-10 17:30:01,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 17:30:01,314 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-03-10 17:30:01,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:30:01,322 INFO L225 Difference]: With dead ends: 5605 [2021-03-10 17:30:01,322 INFO L226 Difference]: Without dead ends: 3981 [2021-03-10 17:30:01,323 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 86.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-03-10 17:30:01,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3981 states. [2021-03-10 17:30:01,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3981 to 3981. [2021-03-10 17:30:01,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3981 states, 3980 states have (on average 3.278643216080402) internal successors, (13049), 3980 states have internal predecessors, (13049), 0 states have call successors, (0), 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:30:01,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3981 states to 3981 states and 13049 transitions. [2021-03-10 17:30:01,418 INFO L78 Accepts]: Start accepts. Automaton has 3981 states and 13049 transitions. Word has length 67 [2021-03-10 17:30:01,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:30:01,419 INFO L480 AbstractCegarLoop]: Abstraction has 3981 states and 13049 transitions. [2021-03-10 17:30:01,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:30:01,419 INFO L276 IsEmpty]: Start isEmpty. Operand 3981 states and 13049 transitions. [2021-03-10 17:30:01,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-03-10 17:30:01,429 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:30:01,429 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] [2021-03-10 17:30:01,430 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-10 17:30:01,430 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:30:01,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:30:01,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1084943385, now seen corresponding path program 1 times [2021-03-10 17:30:01,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:30:01,430 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590232157] [2021-03-10 17:30:01,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:30:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:30:01,521 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:30:01,521 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590232157] [2021-03-10 17:30:01,521 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:30:01,522 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-10 17:30:01,522 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562045472] [2021-03-10 17:30:01,522 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-10 17:30:01,522 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:30:01,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-10 17:30:01,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-10 17:30:01,523 INFO L87 Difference]: Start difference. First operand 3981 states and 13049 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 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:30:01,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:30:01,659 INFO L93 Difference]: Finished difference Result 3867 states and 12277 transitions. [2021-03-10 17:30:01,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 17:30:01,660 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2021-03-10 17:30:01,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:30:01,665 INFO L225 Difference]: With dead ends: 3867 [2021-03-10 17:30:01,666 INFO L226 Difference]: Without dead ends: 2595 [2021-03-10 17:30:01,667 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 102.8ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-03-10 17:30:01,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2595 states. [2021-03-10 17:30:01,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2595 to 2551. [2021-03-10 17:30:01,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2551 states, 2550 states have (on average 3.089019607843137) internal successors, (7877), 2550 states have internal predecessors, (7877), 0 states have call successors, (0), 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:30:01,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2551 states to 2551 states and 7877 transitions. [2021-03-10 17:30:01,725 INFO L78 Accepts]: Start accepts. Automaton has 2551 states and 7877 transitions. Word has length 68 [2021-03-10 17:30:01,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:30:01,726 INFO L480 AbstractCegarLoop]: Abstraction has 2551 states and 7877 transitions. [2021-03-10 17:30:01,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 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:30:01,726 INFO L276 IsEmpty]: Start isEmpty. Operand 2551 states and 7877 transitions. [2021-03-10 17:30:01,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-03-10 17:30:01,731 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:30:01,731 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] [2021-03-10 17:30:01,731 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-10 17:30:01,731 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:30:01,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:30:01,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1095233850, now seen corresponding path program 1 times [2021-03-10 17:30:01,732 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:30:01,732 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746412407] [2021-03-10 17:30:01,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:30:01,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:30:01,841 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:30:01,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746412407] [2021-03-10 17:30:01,843 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:30:01,843 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-10 17:30:01,843 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716445114] [2021-03-10 17:30:01,844 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-10 17:30:01,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:30:01,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-10 17:30:01,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-03-10 17:30:01,844 INFO L87 Difference]: Start difference. First operand 2551 states and 7877 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:30:01,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:30:01,989 INFO L93 Difference]: Finished difference Result 1993 states and 5954 transitions. [2021-03-10 17:30:01,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 17:30:01,990 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-03-10 17:30:01,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:30:01,992 INFO L225 Difference]: With dead ends: 1993 [2021-03-10 17:30:01,992 INFO L226 Difference]: Without dead ends: 1417 [2021-03-10 17:30:01,993 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 120.0ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-03-10 17:30:01,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1417 states. [2021-03-10 17:30:02,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1417 to 1385. [2021-03-10 17:30:02,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1385 states, 1384 states have (on average 2.8908959537572256) internal successors, (4001), 1384 states have internal predecessors, (4001), 0 states have call successors, (0), 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:30:02,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 4001 transitions. [2021-03-10 17:30:02,020 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 4001 transitions. Word has length 70 [2021-03-10 17:30:02,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:30:02,020 INFO L480 AbstractCegarLoop]: Abstraction has 1385 states and 4001 transitions. [2021-03-10 17:30:02,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:30:02,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 4001 transitions. [2021-03-10 17:30:02,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-03-10 17:30:02,023 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:30:02,023 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, 1] [2021-03-10 17:30:02,024 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-10 17:30:02,024 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:30:02,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:30:02,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1926946406, now seen corresponding path program 1 times [2021-03-10 17:30:02,024 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:30:02,024 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146051383] [2021-03-10 17:30:02,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:30:02,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:30:02,324 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:30:02,324 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146051383] [2021-03-10 17:30:02,325 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:30:02,325 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-03-10 17:30:02,325 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123402481] [2021-03-10 17:30:02,325 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-03-10 17:30:02,325 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:30:02,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-03-10 17:30:02,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2021-03-10 17:30:02,326 INFO L87 Difference]: Start difference. First operand 1385 states and 4001 transitions. Second operand has 14 states, 14 states have (on average 5.214285714285714) internal successors, (73), 14 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:30:02,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:30:02,542 INFO L93 Difference]: Finished difference Result 1955 states and 5691 transitions. [2021-03-10 17:30:02,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 17:30:02,543 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.214285714285714) internal successors, (73), 14 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-03-10 17:30:02,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:30:02,545 INFO L225 Difference]: With dead ends: 1955 [2021-03-10 17:30:02,545 INFO L226 Difference]: Without dead ends: 1173 [2021-03-10 17:30:02,545 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 221.4ms TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2021-03-10 17:30:02,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2021-03-10 17:30:02,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 1073. [2021-03-10 17:30:02,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1073 states, 1072 states have (on average 2.855410447761194) internal successors, (3061), 1072 states have internal predecessors, (3061), 0 states have call successors, (0), 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:30:02,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 1073 states and 3061 transitions. [2021-03-10 17:30:02,562 INFO L78 Accepts]: Start accepts. Automaton has 1073 states and 3061 transitions. Word has length 73 [2021-03-10 17:30:02,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:30:02,562 INFO L480 AbstractCegarLoop]: Abstraction has 1073 states and 3061 transitions. [2021-03-10 17:30:02,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 5.214285714285714) internal successors, (73), 14 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:30:02,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1073 states and 3061 transitions. [2021-03-10 17:30:02,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-03-10 17:30:02,564 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:30:02,565 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, 1] [2021-03-10 17:30:02,565 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-10 17:30:02,565 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:30:02,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:30:02,565 INFO L82 PathProgramCache]: Analyzing trace with hash -297421094, now seen corresponding path program 2 times [2021-03-10 17:30:02,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:30:02,565 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629984620] [2021-03-10 17:30:02,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:30:02,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-10 17:30:02,601 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-10 17:30:02,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-10 17:30:02,644 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-10 17:30:02,685 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-10 17:30:02,685 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-10 17:30:02,686 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-03-10 17:30:02,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.03 05:30:02 BasicIcfg [2021-03-10 17:30:02,834 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-10 17:30:02,834 INFO L168 Benchmark]: Toolchain (without parser) took 15798.72 ms. Allocated memory was 255.9 MB in the beginning and 5.4 GB in the end (delta: 5.2 GB). Free memory was 234.9 MB in the beginning and 4.2 GB in the end (delta: -4.0 GB). Peak memory consumption was 1.2 GB. Max. memory is 16.0 GB. [2021-03-10 17:30:02,834 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 255.9 MB. Free memory is still 237.7 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-10 17:30:02,834 INFO L168 Benchmark]: CACSL2BoogieTranslator took 435.31 ms. Allocated memory was 255.9 MB in the beginning and 358.6 MB in the end (delta: 102.8 MB). Free memory was 234.5 MB in the beginning and 317.6 MB in the end (delta: -83.1 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.0 GB. [2021-03-10 17:30:02,835 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.45 ms. Allocated memory is still 358.6 MB. Free memory was 317.6 MB in the beginning and 314.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-10 17:30:02,835 INFO L168 Benchmark]: Boogie Preprocessor took 56.51 ms. Allocated memory is still 358.6 MB. Free memory was 314.9 MB in the beginning and 312.5 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-10 17:30:02,835 INFO L168 Benchmark]: RCFGBuilder took 1889.09 ms. Allocated memory was 358.6 MB in the beginning and 432.0 MB in the end (delta: 73.4 MB). Free memory was 312.5 MB in the beginning and 391.6 MB in the end (delta: -79.1 MB). Peak memory consumption was 62.1 MB. Max. memory is 16.0 GB. [2021-03-10 17:30:02,835 INFO L168 Benchmark]: TraceAbstraction took 13332.15 ms. Allocated memory was 432.0 MB in the beginning and 5.4 GB in the end (delta: 5.0 GB). Free memory was 391.6 MB in the beginning and 4.2 GB in the end (delta: -3.8 GB). Peak memory consumption was 1.2 GB. Max. memory is 16.0 GB. [2021-03-10 17:30:02,839 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.16 ms. Allocated memory is still 255.9 MB. Free memory is still 237.7 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 435.31 ms. Allocated memory was 255.9 MB in the beginning and 358.6 MB in the end (delta: 102.8 MB). Free memory was 234.5 MB in the beginning and 317.6 MB in the end (delta: -83.1 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 77.45 ms. Allocated memory is still 358.6 MB. Free memory was 317.6 MB in the beginning and 314.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 56.51 ms. Allocated memory is still 358.6 MB. Free memory was 314.9 MB in the beginning and 312.5 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1889.09 ms. Allocated memory was 358.6 MB in the beginning and 432.0 MB in the end (delta: 73.4 MB). Free memory was 312.5 MB in the beginning and 391.6 MB in the end (delta: -79.1 MB). Peak memory consumption was 62.1 MB. Max. memory is 16.0 GB. * TraceAbstraction took 13332.15 ms. Allocated memory was 432.0 MB in the beginning and 5.4 GB in the end (delta: 5.0 GB). Free memory was 391.6 MB in the beginning and 4.2 GB in the end (delta: -3.8 GB). Peak memory consumption was 1.2 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] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L712] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L713] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L715] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L719] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L720] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L721] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L722] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L723] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L724] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L725] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L726] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L727] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L728] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L729] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L730] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L731] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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}] [L732] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L733] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L734] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L735] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L818] 0 pthread_t t2037; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L819] FCALL, FORK 0 pthread_create(&t2037, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 2 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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 t2038; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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(&t2038, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L822] 0 pthread_t t2039; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L823] FCALL, FORK 0 pthread_create(&t2039, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=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] [L793] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=1, 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] [L796] 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) [L796] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L796] 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) [L796] 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) [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L797] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L798] 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 [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L799] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L800] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L800] 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 [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=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=1, 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] [L756] 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) [L756] 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) [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L758] 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 [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L760] 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 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=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=1, 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] [L776] 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) [L776] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L776] 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) [L776] 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) [L777] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L778] 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 [L779] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L780] 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 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=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=1, 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] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, 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=1, 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, __unbuffered_p2_EAX=1, 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=1, 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] [L829] 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) [L829] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L829] 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) [L829] 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) [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L830] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L831] 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 [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L832] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L833] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L833] 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 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 z$flush_delayed = weak$$choice2 [L839] 0 z$mem_tmp = z [L840] 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) [L840] 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) [L841] 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)) [L841] 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)) [L842] 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)) [L842] 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)) [L843] 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)) [L843] 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)) [L844] 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)) [L844] 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)) [L845] 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)) [L845] 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)) [L846] 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)) [L846] 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)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L848] 0 z = z$flush_delayed ? z$mem_tmp : z [L849] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, 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, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, 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, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, 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, 96 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13087.3ms, OverallIterations: 18, TraceHistogramMax: 1, EmptinessCheckTime: 210.9ms, AutomataDifference: 5457.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 989.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2079 SDtfs, 3367 SDslu, 8894 SDs, 0 SdLazy, 1645 SolverSat, 336 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1757.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 265 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 3206.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=15337occurred in iteration=0, InterpolantAutomatonStates: 204, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 2619.9ms AutomataMinimizationTime, 17 MinimizatonAttempts, 1238 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 68.6ms SsaConstructionTime, 662.5ms SatisfiabilityAnalysisTime, 2713.5ms InterpolantComputationTime, 1154 NumberOfCodeBlocks, 1154 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1064 ConstructedInterpolants, 0 QuantifiedInterpolants, 7072 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...