/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/safe029_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2abb09bbbae98a04ae2fcc735832bfdba44f6fbc-2abb09b [2021-06-05 19:57:47,462 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 19:57:47,465 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 19:57:47,502 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 19:57:47,503 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 19:57:47,506 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 19:57:47,508 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 19:57:47,513 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 19:57:47,515 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 19:57:47,519 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 19:57:47,520 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 19:57:47,521 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 19:57:47,521 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 19:57:47,523 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 19:57:47,524 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 19:57:47,525 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 19:57:47,528 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 19:57:47,529 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 19:57:47,531 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 19:57:47,535 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 19:57:47,537 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 19:57:47,538 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 19:57:47,538 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 19:57:47,540 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 19:57:47,546 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 19:57:47,546 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 19:57:47,547 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 19:57:47,548 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 19:57:47,548 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 19:57:47,549 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 19:57:47,549 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 19:57:47,550 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 19:57:47,551 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 19:57:47,552 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 19:57:47,552 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 19:57:47,553 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 19:57:47,553 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 19:57:47,553 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 19:57:47,553 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 19:57:47,554 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 19:57:47,555 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 19:57:47,559 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2021-06-05 19:57:47,592 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 19:57:47,592 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 19:57:47,593 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 19:57:47,593 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 19:57:47,595 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 19:57:47,595 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 19:57:47,595 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 19:57:47,596 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 19:57:47,596 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 19:57:47,596 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 19:57:47,597 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 19:57:47,597 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 19:57:47,597 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 19:57:47,597 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 19:57:47,598 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 19:57:47,598 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 19:57:47,598 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 19:57:47,598 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 19:57:47,598 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 19:57:47,598 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 19:57:47,599 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 19:57:47,599 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 19:57:47,599 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 19:57:47,599 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 19:57:47,599 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 19:57:47,599 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 19:57:47,599 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 19:57:47,600 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 19:57:47,600 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 19:57:47,600 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 19:57:47,600 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 19:57:47,600 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-05 19:57:47,912 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 19:57:47,932 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 19:57:47,934 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 19:57:47,935 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-05 19:57:47,936 INFO L275 PluginConnector]: CDTParser initialized [2021-06-05 19:57:47,936 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.oepc.i [2021-06-05 19:57:48,002 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b94bd3b76/c42e3c7d3fc6464492ebc85994e625ae/FLAG6300b496c [2021-06-05 19:57:48,808 INFO L306 CDTParser]: Found 1 translation units. [2021-06-05 19:57:48,809 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.oepc.i [2021-06-05 19:57:48,826 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b94bd3b76/c42e3c7d3fc6464492ebc85994e625ae/FLAG6300b496c [2021-06-05 19:57:48,984 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b94bd3b76/c42e3c7d3fc6464492ebc85994e625ae [2021-06-05 19:57:48,987 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 19:57:48,988 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-05 19:57:48,991 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-05 19:57:48,991 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-05 19:57:48,994 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-05 19:57:48,995 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 07:57:48" (1/1) ... [2021-06-05 19:57:48,996 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4086c66c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:57:48, skipping insertion in model container [2021-06-05 19:57:48,996 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 07:57:48" (1/1) ... [2021-06-05 19:57:49,002 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-05 19:57:49,082 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-05 19:57:49,283 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.oepc.i[952,965] [2021-06-05 19:57:49,433 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 19:57:49,441 INFO L203 MainTranslator]: Completed pre-run [2021-06-05 19:57:49,451 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.oepc.i[952,965] [2021-06-05 19:57:49,500 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 19:57:49,557 INFO L208 MainTranslator]: Completed translation [2021-06-05 19:57:49,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:57:49 WrapperNode [2021-06-05 19:57:49,558 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-05 19:57:49,559 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 19:57:49,559 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 19:57:49,559 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 19:57:49,565 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:57:49" (1/1) ... [2021-06-05 19:57:49,590 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:57:49" (1/1) ... [2021-06-05 19:57:49,638 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 19:57:49,639 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 19:57:49,639 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 19:57:49,639 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 19:57:49,647 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:57:49" (1/1) ... [2021-06-05 19:57:49,648 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:57:49" (1/1) ... [2021-06-05 19:57:49,662 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:57:49" (1/1) ... [2021-06-05 19:57:49,663 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:57:49" (1/1) ... [2021-06-05 19:57:49,669 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:57:49" (1/1) ... [2021-06-05 19:57:49,672 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:57:49" (1/1) ... [2021-06-05 19:57:49,675 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:57:49" (1/1) ... [2021-06-05 19:57:49,679 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 19:57:49,680 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 19:57:49,680 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 19:57:49,680 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 19:57:49,681 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:57:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 19:57:49,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-05 19:57:49,778 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-05 19:57:49,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-05 19:57:49,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-05 19:57:49,778 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-05 19:57:49,778 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-05 19:57:49,779 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-05 19:57:49,779 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-05 19:57:49,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-05 19:57:49,779 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-05 19:57:49,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 19:57:49,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 19:57:49,781 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-05 19:57:51,237 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 19:57:51,237 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-05 19:57:51,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 07:57:51 BoogieIcfgContainer [2021-06-05 19:57:51,239 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 19:57:51,241 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 19:57:51,241 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 19:57:51,243 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 19:57:51,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.06 07:57:48" (1/3) ... [2021-06-05 19:57:51,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46c96a32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 07:57:51, skipping insertion in model container [2021-06-05 19:57:51,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:57:49" (2/3) ... [2021-06-05 19:57:51,247 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46c96a32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 07:57:51, skipping insertion in model container [2021-06-05 19:57:51,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 07:57:51" (3/3) ... [2021-06-05 19:57:51,248 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_power.oepc.i [2021-06-05 19:57:51,254 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 19:57:51,254 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 19:57:51,254 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-05 19:57:51,254 INFO L471 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 19:57:51,281 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,281 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,282 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,282 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,282 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,282 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,282 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,282 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,282 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,282 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,283 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,283 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,283 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,283 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,283 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,283 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,283 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,283 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,283 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,284 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,284 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,284 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,284 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,284 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,284 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,284 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,285 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,285 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,285 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,285 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,285 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,285 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,285 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,286 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,286 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,286 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,286 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,286 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,286 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,286 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,287 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,287 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,287 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,287 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,287 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,287 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,287 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,287 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,287 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,291 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,291 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,293 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,293 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,294 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,294 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,294 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,294 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,294 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,294 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,294 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,294 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,294 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,294 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:57:51,296 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 19:57:51,313 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 19:57:51,329 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 19:57:51,329 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 19:57:51,329 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 19:57:51,329 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 19:57:51,329 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 19:57:51,329 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 19:57:51,329 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 19:57:51,329 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P0======== [2021-06-05 19:57:51,338 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 90 places, 85 transitions, 180 flow [2021-06-05 19:57:51,417 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1898 states, 1894 states have (on average 2.746040126715945) internal successors, (5201), 1897 states have internal predecessors, (5201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:57:51,423 INFO L276 IsEmpty]: Start isEmpty. Operand has 1898 states, 1894 states have (on average 2.746040126715945) internal successors, (5201), 1897 states have internal predecessors, (5201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:57:51,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-05 19:57:51,453 INFO L301 ceAbstractionStarter]: Result for error location P0 was SAFE (1/3) [2021-06-05 19:57:51,455 INFO L255 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-06-05 19:57:51,457 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 19:57:51,457 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 19:57:51,457 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 19:57:51,457 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 19:57:51,457 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 19:57:51,457 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 19:57:51,457 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 19:57:51,457 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-06-05 19:57:51,459 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 90 places, 85 transitions, 180 flow [2021-06-05 19:57:51,497 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1898 states, 1894 states have (on average 2.746040126715945) internal successors, (5201), 1897 states have internal predecessors, (5201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:57:51,502 INFO L276 IsEmpty]: Start isEmpty. Operand has 1898 states, 1894 states have (on average 2.746040126715945) internal successors, (5201), 1897 states have internal predecessors, (5201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:57:51,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-06-05 19:57:51,506 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:57:51,507 INFO L554 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] [2021-06-05 19:57:51,507 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:57:51,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:57:51,511 INFO L82 PathProgramCache]: Analyzing trace with hash 85745205, now seen corresponding path program 1 times [2021-06-05 19:57:51,518 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:57:51,519 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894078015] [2021-06-05 19:57:51,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:57:51,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:57:51,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 19:57:51,936 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:57:51,937 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894078015] [2021-06-05 19:57:51,938 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894078015] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:57:51,938 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:57:51,938 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 19:57:51,938 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521362942] [2021-06-05 19:57:51,942 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 19:57:51,942 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:57:51,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 19:57:51,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 19:57:51,961 INFO L87 Difference]: Start difference. First operand has 1898 states, 1894 states have (on average 2.746040126715945) internal successors, (5201), 1897 states have internal predecessors, (5201), 0 states have call successors, (0), 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 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:57:52,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:57:52,132 INFO L93 Difference]: Finished difference Result 2578 states and 6846 transitions. [2021-06-05 19:57:52,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 19:57:52,134 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2021-06-05 19:57:52,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:57:52,155 INFO L225 Difference]: With dead ends: 2578 [2021-06-05 19:57:52,155 INFO L226 Difference]: Without dead ends: 1130 [2021-06-05 19:57:52,156 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 100.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 19:57:52,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2021-06-05 19:57:52,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1130. [2021-06-05 19:57:52,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1130 states, 1128 states have (on average 2.5913120567375887) internal successors, (2923), 1129 states have internal predecessors, (2923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:57:52,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 2923 transitions. [2021-06-05 19:57:52,240 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 2923 transitions. Word has length 56 [2021-06-05 19:57:52,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:57:52,241 INFO L482 AbstractCegarLoop]: Abstraction has 1130 states and 2923 transitions. [2021-06-05 19:57:52,241 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:57:52,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 2923 transitions. [2021-06-05 19:57:52,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-06-05 19:57:52,244 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:57:52,245 INFO L554 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-06-05 19:57:52,245 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 19:57:52,245 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:57:52,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:57:52,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1550290026, now seen corresponding path program 1 times [2021-06-05 19:57:52,246 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:57:52,246 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167883187] [2021-06-05 19:57:52,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:57:52,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:57:52,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 19:57:52,508 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:57:52,508 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167883187] [2021-06-05 19:57:52,509 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167883187] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:57:52,509 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:57:52,509 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 19:57:52,509 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52213813] [2021-06-05 19:57:52,510 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 19:57:52,510 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:57:52,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 19:57:52,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-06-05 19:57:52,511 INFO L87 Difference]: Start difference. First operand 1130 states and 2923 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 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-06-05 19:57:52,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:57:52,716 INFO L93 Difference]: Finished difference Result 1344 states and 3440 transitions. [2021-06-05 19:57:52,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 19:57:52,717 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 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-06-05 19:57:52,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:57:52,722 INFO L225 Difference]: With dead ends: 1344 [2021-06-05 19:57:52,722 INFO L226 Difference]: Without dead ends: 1088 [2021-06-05 19:57:52,723 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 165.4ms TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-06-05 19:57:52,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2021-06-05 19:57:52,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 1088. [2021-06-05 19:57:52,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 1086 states have (on average 2.5755064456721914) internal successors, (2797), 1087 states have internal predecessors, (2797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:57:52,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 2797 transitions. [2021-06-05 19:57:52,753 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 2797 transitions. Word has length 58 [2021-06-05 19:57:52,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:57:52,754 INFO L482 AbstractCegarLoop]: Abstraction has 1088 states and 2797 transitions. [2021-06-05 19:57:52,754 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 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-06-05 19:57:52,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 2797 transitions. [2021-06-05 19:57:52,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-06-05 19:57:52,756 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:57:52,757 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 19:57:52,757 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 19:57:52,757 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:57:52,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:57:52,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1756957986, now seen corresponding path program 1 times [2021-06-05 19:57:52,758 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:57:52,758 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753438787] [2021-06-05 19:57:52,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:57:52,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:57:52,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 19:57:52,925 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:57:52,925 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753438787] [2021-06-05 19:57:52,925 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753438787] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:57:52,925 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:57:52,925 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 19:57:52,926 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206465296] [2021-06-05 19:57:52,926 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 19:57:52,926 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:57:52,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 19:57:52,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 19:57:52,927 INFO L87 Difference]: Start difference. First operand 1088 states and 2797 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:57:53,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:57:53,212 INFO L93 Difference]: Finished difference Result 1127 states and 2854 transitions. [2021-06-05 19:57:53,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 19:57:53,213 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-06-05 19:57:53,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:57:53,218 INFO L225 Difference]: With dead ends: 1127 [2021-06-05 19:57:53,218 INFO L226 Difference]: Without dead ends: 967 [2021-06-05 19:57:53,219 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 214.7ms TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2021-06-05 19:57:53,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2021-06-05 19:57:53,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 967. [2021-06-05 19:57:53,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 967 states, 966 states have (on average 2.550724637681159) internal successors, (2464), 966 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:57:53,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 2464 transitions. [2021-06-05 19:57:53,241 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 2464 transitions. Word has length 59 [2021-06-05 19:57:53,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:57:53,242 INFO L482 AbstractCegarLoop]: Abstraction has 967 states and 2464 transitions. [2021-06-05 19:57:53,243 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:57:53,245 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 2464 transitions. [2021-06-05 19:57:53,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-06-05 19:57:53,247 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:57:53,248 INFO L554 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-06-05 19:57:53,252 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 19:57:53,252 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:57:53,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:57:53,255 INFO L82 PathProgramCache]: Analyzing trace with hash 696872629, now seen corresponding path program 1 times [2021-06-05 19:57:53,255 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:57:53,256 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70149938] [2021-06-05 19:57:53,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:57:53,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:57:53,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 19:57:53,476 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:57:53,476 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70149938] [2021-06-05 19:57:53,476 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70149938] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:57:53,476 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:57:53,476 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 19:57:53,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103224080] [2021-06-05 19:57:53,477 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 19:57:53,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:57:53,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 19:57:53,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-05 19:57:53,478 INFO L87 Difference]: Start difference. First operand 967 states and 2464 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-06-05 19:57:53,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:57:53,658 INFO L93 Difference]: Finished difference Result 1049 states and 2648 transitions. [2021-06-05 19:57:53,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 19:57:53,659 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-06-05 19:57:53,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:57:53,665 INFO L225 Difference]: With dead ends: 1049 [2021-06-05 19:57:53,665 INFO L226 Difference]: Without dead ends: 921 [2021-06-05 19:57:53,666 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 165.8ms TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-06-05 19:57:53,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2021-06-05 19:57:53,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 919. [2021-06-05 19:57:53,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 918 states have (on average 2.5403050108932463) internal successors, (2332), 918 states have internal predecessors, (2332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:57:53,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 2332 transitions. [2021-06-05 19:57:53,686 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 2332 transitions. Word has length 60 [2021-06-05 19:57:53,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:57:53,686 INFO L482 AbstractCegarLoop]: Abstraction has 919 states and 2332 transitions. [2021-06-05 19:57:53,686 INFO L483 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-06-05 19:57:53,686 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 2332 transitions. [2021-06-05 19:57:53,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-06-05 19:57:53,689 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:57:53,689 INFO L554 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-06-05 19:57:53,689 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-05 19:57:53,690 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:57:53,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:57:53,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1303999016, now seen corresponding path program 1 times [2021-06-05 19:57:53,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:57:53,690 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056343878] [2021-06-05 19:57:53,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:57:53,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:57:53,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 19:57:53,834 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:57:53,834 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056343878] [2021-06-05 19:57:53,835 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056343878] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:57:53,835 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:57:53,835 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 19:57:53,835 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920405591] [2021-06-05 19:57:53,836 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 19:57:53,837 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:57:53,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 19:57:53,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 19:57:53,838 INFO L87 Difference]: Start difference. First operand 919 states and 2332 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:57:53,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:57:53,939 INFO L93 Difference]: Finished difference Result 1535 states and 3862 transitions. [2021-06-05 19:57:53,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 19:57:53,939 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-06-05 19:57:53,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:57:53,943 INFO L225 Difference]: With dead ends: 1535 [2021-06-05 19:57:53,943 INFO L226 Difference]: Without dead ends: 1021 [2021-06-05 19:57:53,944 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 85.7ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 19:57:53,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2021-06-05 19:57:53,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 871. [2021-06-05 19:57:53,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 870 states have (on average 2.466666666666667) internal successors, (2146), 870 states have internal predecessors, (2146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:57:53,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 2146 transitions. [2021-06-05 19:57:53,963 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 2146 transitions. Word has length 60 [2021-06-05 19:57:53,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:57:53,963 INFO L482 AbstractCegarLoop]: Abstraction has 871 states and 2146 transitions. [2021-06-05 19:57:53,963 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:57:53,964 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 2146 transitions. [2021-06-05 19:57:53,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-06-05 19:57:53,965 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:57:53,965 INFO L554 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-06-05 19:57:53,965 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-05 19:57:53,965 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:57:53,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:57:53,966 INFO L82 PathProgramCache]: Analyzing trace with hash -638334108, now seen corresponding path program 1 times [2021-06-05 19:57:53,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:57:53,966 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746709015] [2021-06-05 19:57:53,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:57:53,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:57:54,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 19:57:54,193 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:57:54,194 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746709015] [2021-06-05 19:57:54,194 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746709015] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:57:54,194 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:57:54,194 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 19:57:54,194 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585930355] [2021-06-05 19:57:54,194 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 19:57:54,194 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:57:54,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 19:57:54,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-06-05 19:57:54,195 INFO L87 Difference]: Start difference. First operand 871 states and 2146 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 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-06-05 19:57:54,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:57:54,540 INFO L93 Difference]: Finished difference Result 1130 states and 2759 transitions. [2021-06-05 19:57:54,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 19:57:54,540 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 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-06-05 19:57:54,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:57:54,544 INFO L225 Difference]: With dead ends: 1130 [2021-06-05 19:57:54,544 INFO L226 Difference]: Without dead ends: 870 [2021-06-05 19:57:54,545 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 277.7ms TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2021-06-05 19:57:54,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2021-06-05 19:57:54,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 808. [2021-06-05 19:57:54,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 807 states have (on average 2.422552664188352) internal successors, (1955), 807 states have internal predecessors, (1955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:57:54,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1955 transitions. [2021-06-05 19:57:54,562 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1955 transitions. Word has length 61 [2021-06-05 19:57:54,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:57:54,563 INFO L482 AbstractCegarLoop]: Abstraction has 808 states and 1955 transitions. [2021-06-05 19:57:54,563 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 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-06-05 19:57:54,563 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1955 transitions. [2021-06-05 19:57:54,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-06-05 19:57:54,564 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:57:54,564 INFO L554 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-06-05 19:57:54,565 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-05 19:57:54,565 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:57:54,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:57:54,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1801678580, now seen corresponding path program 2 times [2021-06-05 19:57:54,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:57:54,565 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445702243] [2021-06-05 19:57:54,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:57:54,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:57:54,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 19:57:54,725 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:57:54,725 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445702243] [2021-06-05 19:57:54,725 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445702243] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:57:54,725 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:57:54,725 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 19:57:54,726 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886840176] [2021-06-05 19:57:54,726 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 19:57:54,726 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:57:54,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 19:57:54,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-06-05 19:57:54,727 INFO L87 Difference]: Start difference. First operand 808 states and 1955 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 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-06-05 19:57:55,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:57:55,072 INFO L93 Difference]: Finished difference Result 992 states and 2408 transitions. [2021-06-05 19:57:55,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 19:57:55,073 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 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-06-05 19:57:55,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:57:55,076 INFO L225 Difference]: With dead ends: 992 [2021-06-05 19:57:55,076 INFO L226 Difference]: Without dead ends: 856 [2021-06-05 19:57:55,077 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 313.2ms TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2021-06-05 19:57:55,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2021-06-05 19:57:55,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 823. [2021-06-05 19:57:55,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 823 states, 822 states have (on average 2.429440389294404) internal successors, (1997), 822 states have internal predecessors, (1997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:57:55,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1997 transitions. [2021-06-05 19:57:55,094 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1997 transitions. Word has length 61 [2021-06-05 19:57:55,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:57:55,094 INFO L482 AbstractCegarLoop]: Abstraction has 823 states and 1997 transitions. [2021-06-05 19:57:55,095 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 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-06-05 19:57:55,095 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1997 transitions. [2021-06-05 19:57:55,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-06-05 19:57:55,096 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:57:55,096 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 19:57:55,096 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-05 19:57:55,097 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:57:55,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:57:55,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1930029783, now seen corresponding path program 1 times [2021-06-05 19:57:55,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:57:55,097 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517192093] [2021-06-05 19:57:55,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:57:55,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:57:55,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 19:57:55,380 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:57:55,380 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517192093] [2021-06-05 19:57:55,380 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517192093] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:57:55,380 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:57:55,380 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-06-05 19:57:55,380 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999655495] [2021-06-05 19:57:55,380 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 19:57:55,380 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:57:55,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 19:57:55,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2021-06-05 19:57:55,381 INFO L87 Difference]: Start difference. First operand 823 states and 1997 transitions. Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:57:55,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:57:55,787 INFO L93 Difference]: Finished difference Result 966 states and 2303 transitions. [2021-06-05 19:57:55,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 19:57:55,788 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-06-05 19:57:55,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:57:55,792 INFO L225 Difference]: With dead ends: 966 [2021-06-05 19:57:55,792 INFO L226 Difference]: Without dead ends: 805 [2021-06-05 19:57:55,792 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 455.1ms TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2021-06-05 19:57:55,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2021-06-05 19:57:55,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 805. [2021-06-05 19:57:55,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 804 states have (on average 2.4191542288557213) internal successors, (1945), 804 states have internal predecessors, (1945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:57:55,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1945 transitions. [2021-06-05 19:57:55,809 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1945 transitions. Word has length 62 [2021-06-05 19:57:55,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:57:55,809 INFO L482 AbstractCegarLoop]: Abstraction has 805 states and 1945 transitions. [2021-06-05 19:57:55,809 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:57:55,809 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1945 transitions. [2021-06-05 19:57:55,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-06-05 19:57:55,811 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:57:55,811 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 19:57:55,811 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-05 19:57:55,811 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:57:55,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:57:55,811 INFO L82 PathProgramCache]: Analyzing trace with hash 695919513, now seen corresponding path program 2 times [2021-06-05 19:57:55,812 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:57:55,812 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492982689] [2021-06-05 19:57:55,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:57:55,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:57:56,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 19:57:56,042 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:57:56,042 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492982689] [2021-06-05 19:57:56,042 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492982689] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:57:56,042 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:57:56,043 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-05 19:57:56,043 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204013117] [2021-06-05 19:57:56,043 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 19:57:56,043 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:57:56,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 19:57:56,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-06-05 19:57:56,044 INFO L87 Difference]: Start difference. First operand 805 states and 1945 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:57:56,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:57:56,355 INFO L93 Difference]: Finished difference Result 1179 states and 2843 transitions. [2021-06-05 19:57:56,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 19:57:56,355 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-06-05 19:57:56,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:57:56,359 INFO L225 Difference]: With dead ends: 1179 [2021-06-05 19:57:56,359 INFO L226 Difference]: Without dead ends: 1055 [2021-06-05 19:57:56,360 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 308.1ms TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2021-06-05 19:57:56,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2021-06-05 19:57:56,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 807. [2021-06-05 19:57:56,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 806 states have (on average 2.4081885856079404) internal successors, (1941), 806 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:57:56,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1941 transitions. [2021-06-05 19:57:56,378 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1941 transitions. Word has length 62 [2021-06-05 19:57:56,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:57:56,378 INFO L482 AbstractCegarLoop]: Abstraction has 807 states and 1941 transitions. [2021-06-05 19:57:56,378 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:57:56,378 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1941 transitions. [2021-06-05 19:57:56,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-06-05 19:57:56,380 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:57:56,380 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 19:57:56,380 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-05 19:57:56,380 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:57:56,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:57:56,380 INFO L82 PathProgramCache]: Analyzing trace with hash 981807643, now seen corresponding path program 3 times [2021-06-05 19:57:56,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:57:56,381 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506759154] [2021-06-05 19:57:56,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:57:56,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:57:56,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 19:57:56,561 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:57:56,561 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506759154] [2021-06-05 19:57:56,561 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506759154] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:57:56,561 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:57:56,561 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 19:57:56,562 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670317688] [2021-06-05 19:57:56,562 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 19:57:56,562 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:57:56,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 19:57:56,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-06-05 19:57:56,563 INFO L87 Difference]: Start difference. First operand 807 states and 1941 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:57:56,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:57:56,770 INFO L93 Difference]: Finished difference Result 1183 states and 2831 transitions. [2021-06-05 19:57:56,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 19:57:56,781 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-06-05 19:57:56,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:57:56,784 INFO L225 Difference]: With dead ends: 1183 [2021-06-05 19:57:56,784 INFO L226 Difference]: Without dead ends: 774 [2021-06-05 19:57:56,785 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 193.6ms TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2021-06-05 19:57:56,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2021-06-05 19:57:56,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 649. [2021-06-05 19:57:56,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 648 states have (on average 2.3580246913580245) internal successors, (1528), 648 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:57:56,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 1528 transitions. [2021-06-05 19:57:56,800 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 1528 transitions. Word has length 62 [2021-06-05 19:57:56,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:57:56,800 INFO L482 AbstractCegarLoop]: Abstraction has 649 states and 1528 transitions. [2021-06-05 19:57:56,800 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:57:56,800 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 1528 transitions. [2021-06-05 19:57:56,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-06-05 19:57:56,802 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:57:56,802 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 19:57:56,802 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-05 19:57:56,802 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:57:56,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:57:56,803 INFO L82 PathProgramCache]: Analyzing trace with hash -80791419, now seen corresponding path program 1 times [2021-06-05 19:57:56,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:57:56,803 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884177824] [2021-06-05 19:57:56,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:57:56,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:57:56,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-06-05 19:57:56,909 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:57:56,910 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884177824] [2021-06-05 19:57:56,910 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884177824] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:57:56,910 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:57:56,910 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 19:57:56,910 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322280397] [2021-06-05 19:57:56,910 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 19:57:56,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:57:56,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 19:57:56,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 19:57:56,911 INFO L87 Difference]: Start difference. First operand 649 states and 1528 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:57:56,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:57:56,989 INFO L93 Difference]: Finished difference Result 719 states and 1652 transitions. [2021-06-05 19:57:56,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 19:57:56,990 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-06-05 19:57:56,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:57:56,992 INFO L225 Difference]: With dead ends: 719 [2021-06-05 19:57:56,992 INFO L226 Difference]: Without dead ends: 535 [2021-06-05 19:57:56,993 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 73.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 19:57:56,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2021-06-05 19:57:57,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2021-06-05 19:57:57,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 534 states have (on average 2.2659176029962547) internal successors, (1210), 534 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:57:57,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 1210 transitions. [2021-06-05 19:57:57,002 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 1210 transitions. Word has length 62 [2021-06-05 19:57:57,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:57:57,003 INFO L482 AbstractCegarLoop]: Abstraction has 535 states and 1210 transitions. [2021-06-05 19:57:57,003 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:57:57,003 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 1210 transitions. [2021-06-05 19:57:57,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 19:57:57,004 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:57:57,004 INFO L554 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-06-05 19:57:57,004 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-05 19:57:57,004 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:57:57,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:57:57,005 INFO L82 PathProgramCache]: Analyzing trace with hash -615861270, now seen corresponding path program 1 times [2021-06-05 19:57:57,005 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:57:57,005 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066140601] [2021-06-05 19:57:57,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:57:57,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:57:57,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 19:57:57,082 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:57:57,082 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066140601] [2021-06-05 19:57:57,082 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066140601] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:57:57,082 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:57:57,082 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 19:57:57,082 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423297645] [2021-06-05 19:57:57,083 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 19:57:57,083 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:57:57,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 19:57:57,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 19:57:57,083 INFO L87 Difference]: Start difference. First operand 535 states and 1210 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-06-05 19:57:57,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:57:57,184 INFO L93 Difference]: Finished difference Result 457 states and 987 transitions. [2021-06-05 19:57:57,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 19:57:57,185 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-06-05 19:57:57,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:57:57,186 INFO L225 Difference]: With dead ends: 457 [2021-06-05 19:57:57,186 INFO L226 Difference]: Without dead ends: 273 [2021-06-05 19:57:57,186 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 93.4ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-06-05 19:57:57,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-06-05 19:57:57,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2021-06-05 19:57:57,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 272 states have (on average 2.0588235294117645) internal successors, (560), 272 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:57:57,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 560 transitions. [2021-06-05 19:57:57,192 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 560 transitions. Word has length 63 [2021-06-05 19:57:57,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:57:57,192 INFO L482 AbstractCegarLoop]: Abstraction has 273 states and 560 transitions. [2021-06-05 19:57:57,192 INFO L483 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-06-05 19:57:57,192 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 560 transitions. [2021-06-05 19:57:57,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-06-05 19:57:57,193 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:57:57,193 INFO L554 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-06-05 19:57:57,193 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-05 19:57:57,193 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:57:57,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:57:57,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1463907637, now seen corresponding path program 1 times [2021-06-05 19:57:57,194 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:57:57,194 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782239121] [2021-06-05 19:57:57,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:57:57,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 19:57:57,219 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 19:57:57,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 19:57:57,252 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 19:57:57,279 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 19:57:57,279 INFO L655 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 19:57:57,279 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-05 19:57:57,279 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/3) [2021-06-05 19:57:57,281 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 19:57:57,281 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 19:57:57,282 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 19:57:57,282 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 19:57:57,282 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 19:57:57,282 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 19:57:57,282 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 19:57:57,282 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 19:57:57,282 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P0Thread1of1ForFork1======== [2021-06-05 19:57:57,283 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 90 places, 85 transitions, 180 flow [2021-06-05 19:57:57,316 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1898 states, 1894 states have (on average 2.746040126715945) internal successors, (5201), 1897 states have internal predecessors, (5201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:57:57,319 INFO L276 IsEmpty]: Start isEmpty. Operand has 1898 states, 1894 states have (on average 2.746040126715945) internal successors, (5201), 1897 states have internal predecessors, (5201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:57:57,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 19:57:57,320 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:57:57,320 INFO L554 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] [2021-06-05 19:57:57,320 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:57:57,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:57:57,320 INFO L82 PathProgramCache]: Analyzing trace with hash 182407281, now seen corresponding path program 1 times [2021-06-05 19:57:57,320 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:57:57,320 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114269890] [2021-06-05 19:57:57,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:57:57,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:57:57,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 19:57:57,337 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:57:57,337 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114269890] [2021-06-05 19:57:57,337 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114269890] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:57:57,337 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:57:57,338 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 19:57:57,338 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068837395] [2021-06-05 19:57:57,338 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 19:57:57,338 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:57:57,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 19:57:57,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 19:57:57,342 INFO L87 Difference]: Start difference. First operand has 1898 states, 1894 states have (on average 2.746040126715945) internal successors, (5201), 1897 states have internal predecessors, (5201), 0 states have call successors, (0), 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 18.5) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:57:57,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:57:57,375 INFO L93 Difference]: Finished difference Result 1627 states and 4300 transitions. [2021-06-05 19:57:57,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 19:57:57,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2021-06-05 19:57:57,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:57:57,376 INFO L225 Difference]: With dead ends: 1627 [2021-06-05 19:57:57,376 INFO L226 Difference]: Without dead ends: 0 [2021-06-05 19:57:57,377 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 19:57:57,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-05 19:57:57,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-05 19:57:57,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:57:57,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-05 19:57:57,377 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2021-06-05 19:57:57,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:57:57,377 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-05 19:57:57,377 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 19:57:57,377 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-05 19:57:57,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-05 19:57:57,378 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-05 19:57:57,378 INFO L301 ceAbstractionStarter]: Result for error location P0Thread1of1ForFork1 was SAFE (3/3) [2021-06-05 19:57:57,378 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-05 19:57:57,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 07:57:57 BasicIcfg [2021-06-05 19:57:57,451 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 19:57:57,452 INFO L168 Benchmark]: Toolchain (without parser) took 8463.86 ms. Allocated memory was 392.2 MB in the beginning and 501.2 MB in the end (delta: 109.1 MB). Free memory was 354.6 MB in the beginning and 320.9 MB in the end (delta: 33.8 MB). Peak memory consumption was 144.4 MB. Max. memory is 16.0 GB. [2021-06-05 19:57:57,452 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 392.2 MB. Free memory is still 373.0 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 19:57:57,452 INFO L168 Benchmark]: CACSL2BoogieTranslator took 567.31 ms. Allocated memory is still 392.2 MB. Free memory was 354.5 MB in the beginning and 350.7 MB in the end (delta: 3.8 MB). Peak memory consumption was 5.1 MB. Max. memory is 16.0 GB. [2021-06-05 19:57:57,452 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.14 ms. Allocated memory is still 392.2 MB. Free memory was 350.7 MB in the beginning and 348.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 19:57:57,453 INFO L168 Benchmark]: Boogie Preprocessor took 40.46 ms. Allocated memory is still 392.2 MB. Free memory was 348.6 MB in the beginning and 346.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 19:57:57,453 INFO L168 Benchmark]: RCFGBuilder took 1559.90 ms. Allocated memory is still 392.2 MB. Free memory was 346.5 MB in the beginning and 305.1 MB in the end (delta: 41.4 MB). Peak memory consumption was 142.0 MB. Max. memory is 16.0 GB. [2021-06-05 19:57:57,453 INFO L168 Benchmark]: TraceAbstraction took 6210.65 ms. Allocated memory was 392.2 MB in the beginning and 501.2 MB in the end (delta: 109.1 MB). Free memory was 304.1 MB in the beginning and 320.9 MB in the end (delta: -16.8 MB). Peak memory consumption was 93.3 MB. Max. memory is 16.0 GB. [2021-06-05 19:57:57,454 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.15 ms. Allocated memory is still 392.2 MB. Free memory is still 373.0 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 567.31 ms. Allocated memory is still 392.2 MB. Free memory was 354.5 MB in the beginning and 350.7 MB in the end (delta: 3.8 MB). Peak memory consumption was 5.1 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 79.14 ms. Allocated memory is still 392.2 MB. Free memory was 350.7 MB in the beginning and 348.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 40.46 ms. Allocated memory is still 392.2 MB. Free memory was 348.6 MB in the beginning and 346.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1559.90 ms. Allocated memory is still 392.2 MB. Free memory was 346.5 MB in the beginning and 305.1 MB in the end (delta: 41.4 MB). Peak memory consumption was 142.0 MB. Max. memory is 16.0 GB. * TraceAbstraction took 6210.65 ms. Allocated memory was 392.2 MB in the beginning and 501.2 MB in the end (delta: 109.1 MB). Free memory was 304.1 MB in the beginning and 320.9 MB in the end (delta: -16.8 MB). Peak memory consumption was 93.3 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L709] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L710] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L712] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L714] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L715] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L716] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L717] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L718] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L719] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L720] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L721] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L722] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L723] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L724] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L725] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L726] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L727] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L728] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L729] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L730] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L790] 0 pthread_t t2473; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] FCALL, FORK 0 pthread_create(&t2473, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L792] 0 pthread_t t2474; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L793] FCALL, FORK 0 pthread_create(&t2474, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 y$w_buff1 = y$w_buff0 [L735] 1 y$w_buff0 = 2 [L736] 1 y$w_buff1_used = y$w_buff0_used [L737] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L739] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L740] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L741] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L742] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L745] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L748] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L750] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L752] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L770] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L772] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L799] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L799] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L799] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L800] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L800] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L801] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L802] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L803] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 y$flush_delayed = weak$$choice2 [L809] 0 y$mem_tmp = y [L810] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L810] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L811] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L811] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L812] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L812] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L813] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L813] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L814] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L815] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L816] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L818] 0 y = y$flush_delayed ? y$mem_tmp : y [L819] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] 0 reach_error() VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P0 with 1 thread instances CFG has 5 procedures, 103 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 125.9ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 34.8ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 87.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1898occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 103 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 5822.6ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 28.6ms, AutomataDifference: 2850.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 40.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1269 SDtfs, 1972 SDslu, 5144 SDs, 0 SdLazy, 858 SolverSat, 186 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 869.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 183 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 2447.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1898occurred in iteration=0, InterpolantAutomatonStates: 137, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 262.4ms AutomataMinimizationTime, 12 MinimizatonAttempts, 620 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 45.1ms SsaConstructionTime, 531.9ms SatisfiabilityAnalysisTime, 1817.9ms InterpolantComputationTime, 792 NumberOfCodeBlocks, 792 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 714 ConstructedInterpolants, 0 QuantifiedInterpolants, 3966 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P0Thread1of1ForFork1 with 1 thread instances CFG has 5 procedures, 103 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 96.2ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 2.8ms, AutomataDifference: 38.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 34.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 75 SDtfs, 34 SDslu, 61 SDs, 0 SdLazy, 9 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1898occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 0.4ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.0ms SsaConstructionTime, 2.3ms SatisfiabilityAnalysisTime, 11.0ms InterpolantComputationTime, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 36 ConstructedInterpolants, 0 QuantifiedInterpolants, 62 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...