/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-a47a088281b0b97d17910950432b7c5b5bc3adeb-a47a088 [2021-07-13 18:54:15,362 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-13 18:54:15,363 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-13 18:54:15,388 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-13 18:54:15,388 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-13 18:54:15,389 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-13 18:54:15,390 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-13 18:54:15,391 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-13 18:54:15,393 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-13 18:54:15,393 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-13 18:54:15,394 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-13 18:54:15,395 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-13 18:54:15,395 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-13 18:54:15,396 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-13 18:54:15,397 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-13 18:54:15,397 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-13 18:54:15,398 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-13 18:54:15,399 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-13 18:54:15,400 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-13 18:54:15,402 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-13 18:54:15,403 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-13 18:54:15,414 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-13 18:54:15,414 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-13 18:54:15,415 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-13 18:54:15,417 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-13 18:54:15,417 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-13 18:54:15,418 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-13 18:54:15,418 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-13 18:54:15,419 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-13 18:54:15,419 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-13 18:54:15,419 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-13 18:54:15,420 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-13 18:54:15,421 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-13 18:54:15,421 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-13 18:54:15,422 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-13 18:54:15,422 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-13 18:54:15,423 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-13 18:54:15,423 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-13 18:54:15,423 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-13 18:54:15,424 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-13 18:54:15,424 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-13 18:54:15,425 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-07-13 18:54:15,466 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-13 18:54:15,467 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-13 18:54:15,467 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-07-13 18:54:15,467 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-07-13 18:54:15,468 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-13 18:54:15,468 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-13 18:54:15,468 INFO L138 SettingsManager]: * Use SBE=true [2021-07-13 18:54:15,468 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-13 18:54:15,468 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-13 18:54:15,468 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-13 18:54:15,469 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-13 18:54:15,469 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-13 18:54:15,469 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-07-13 18:54:15,469 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-07-13 18:54:15,469 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-07-13 18:54:15,469 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-13 18:54:15,469 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-13 18:54:15,469 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-13 18:54:15,470 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-07-13 18:54:15,470 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-13 18:54:15,470 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-13 18:54:15,470 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-07-13 18:54:15,470 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-07-13 18:54:15,470 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-13 18:54:15,470 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-13 18:54:15,470 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-07-13 18:54:15,471 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-07-13 18:54:15,471 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-13 18:54:15,471 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-07-13 18:54:15,471 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-07-13 18:54:15,471 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-07-13 18:54:15,471 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-07-13 18:54:15,684 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-13 18:54:15,705 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-13 18:54:15,706 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-13 18:54:15,707 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-13 18:54:15,710 INFO L275 PluginConnector]: CDTParser initialized [2021-07-13 18:54:15,711 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt.i [2021-07-13 18:54:15,770 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b266af792/3ad5ef6d0eea4c7c8229b4b83db8d34e/FLAG5405225f6 [2021-07-13 18:54:16,139 INFO L306 CDTParser]: Found 1 translation units. [2021-07-13 18:54:16,139 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.opt.i [2021-07-13 18:54:16,153 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b266af792/3ad5ef6d0eea4c7c8229b4b83db8d34e/FLAG5405225f6 [2021-07-13 18:54:16,165 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b266af792/3ad5ef6d0eea4c7c8229b4b83db8d34e [2021-07-13 18:54:16,168 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-13 18:54:16,170 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-07-13 18:54:16,171 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-13 18:54:16,172 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-13 18:54:16,174 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-13 18:54:16,175 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 06:54:16" (1/1) ... [2021-07-13 18:54:16,176 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@761e6f00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:54:16, skipping insertion in model container [2021-07-13 18:54:16,176 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 06:54:16" (1/1) ... [2021-07-13 18:54:16,180 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-13 18:54:16,212 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-13 18:54:16,301 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.opt.i[951,964] [2021-07-13 18:54:16,462 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-13 18:54:16,467 INFO L203 MainTranslator]: Completed pre-run [2021-07-13 18:54:16,474 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.opt.i[951,964] [2021-07-13 18:54:16,519 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-13 18:54:16,557 INFO L208 MainTranslator]: Completed translation [2021-07-13 18:54:16,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:54:16 WrapperNode [2021-07-13 18:54:16,557 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-13 18:54:16,558 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-13 18:54:16,559 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-13 18:54:16,559 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-13 18:54:16,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:54:16" (1/1) ... [2021-07-13 18:54:16,591 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:54:16" (1/1) ... [2021-07-13 18:54:16,623 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-13 18:54:16,624 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-13 18:54:16,624 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-13 18:54:16,624 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-13 18:54:16,630 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:54:16" (1/1) ... [2021-07-13 18:54:16,630 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:54:16" (1/1) ... [2021-07-13 18:54:16,644 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:54:16" (1/1) ... [2021-07-13 18:54:16,645 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:54:16" (1/1) ... [2021-07-13 18:54:16,650 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:54:16" (1/1) ... [2021-07-13 18:54:16,652 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:54:16" (1/1) ... [2021-07-13 18:54:16,653 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:54:16" (1/1) ... [2021-07-13 18:54:16,656 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-13 18:54:16,656 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-13 18:54:16,672 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-13 18:54:16,672 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-13 18:54:16,673 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:54:16" (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-07-13 18:54:16,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-07-13 18:54:16,739 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-07-13 18:54:16,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-13 18:54:16,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-07-13 18:54:16,739 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-07-13 18:54:16,741 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-07-13 18:54:16,741 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-07-13 18:54:16,741 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-07-13 18:54:16,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-13 18:54:16,741 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-07-13 18:54:16,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-13 18:54:16,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-13 18:54:16,742 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-07-13 18:54:18,223 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-13 18:54:18,223 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-07-13 18:54:18,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:54:18 BoogieIcfgContainer [2021-07-13 18:54:18,225 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-13 18:54:18,226 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-07-13 18:54:18,226 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-07-13 18:54:18,228 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-07-13 18:54:18,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 06:54:16" (1/3) ... [2021-07-13 18:54:18,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@509bfe8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 06:54:18, skipping insertion in model container [2021-07-13 18:54:18,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:54:16" (2/3) ... [2021-07-13 18:54:18,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@509bfe8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 06:54:18, skipping insertion in model container [2021-07-13 18:54:18,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:54:18" (3/3) ... [2021-07-13 18:54:18,230 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_power.opt.i [2021-07-13 18:54:18,234 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-07-13 18:54:18,234 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-07-13 18:54:18,234 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-07-13 18:54:18,235 INFO L474 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-07-13 18:54:18,255 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,256 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,256 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,256 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,256 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,256 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,256 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,256 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,257 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,257 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,257 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,257 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,257 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,257 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,257 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,257 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,258 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,258 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,258 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,258 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,258 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,258 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,259 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,259 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,259 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,259 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,259 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,259 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,259 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,260 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,260 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,260 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,260 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,260 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,260 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,260 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,260 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,261 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,261 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,261 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,261 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,261 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,261 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,261 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,261 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,262 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,262 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,262 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,262 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,262 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,262 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,262 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,262 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,263 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,263 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,263 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,263 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,263 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,263 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,263 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,265 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,265 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,265 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,265 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,265 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,265 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,266 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,266 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,266 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,266 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,266 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,266 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,267 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,268 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,268 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,268 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,268 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,268 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,268 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,268 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,268 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,268 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:18,270 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-07-13 18:54:18,291 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-07-13 18:54:18,307 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-13 18:54:18,307 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-13 18:54:18,307 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-13 18:54:18,307 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-13 18:54:18,307 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-13 18:54:18,307 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-13 18:54:18,308 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-13 18:54:18,308 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P1Thread1of1ForFork0======== [2021-07-13 18:54:18,317 INFO L110 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 90 places, 85 transitions, 180 flow [2021-07-13 18:54:18,352 INFO L132 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 691 states, 689 states have (on average 2.451378809869376) internal successors, (1689), 690 states have internal predecessors, (1689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:54:18,363 INFO L276 IsEmpty]: Start isEmpty. Operand has 691 states, 689 states have (on average 2.451378809869376) internal successors, (1689), 690 states have internal predecessors, (1689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:54:18,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-07-13 18:54:18,370 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:54:18,370 INFO L508 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] [2021-07-13 18:54:18,371 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:54:18,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:54:18,375 INFO L82 PathProgramCache]: Analyzing trace with hash 100820283, now seen corresponding path program 1 times [2021-07-13 18:54:18,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:54:18,382 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803220013] [2021-07-13 18:54:18,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:54:18,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:54:18,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:54:18,615 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:54:18,615 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803220013] [2021-07-13 18:54:18,615 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803220013] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:54:18,615 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:54:18,615 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-07-13 18:54:18,616 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103567254] [2021-07-13 18:54:18,618 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-13 18:54:18,619 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:54:18,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-13 18:54:18,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-13 18:54:18,631 INFO L87 Difference]: Start difference. First operand has 691 states, 689 states have (on average 2.451378809869376) internal successors, (1689), 690 states have internal predecessors, (1689), 0 states have call successors, (0), 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 22.0) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:54:18,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:54:18,675 INFO L93 Difference]: Finished difference Result 475 states and 1036 transitions. [2021-07-13 18:54:18,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-13 18:54:18,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2021-07-13 18:54:18,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:54:18,680 INFO L225 Difference]: With dead ends: 475 [2021-07-13 18:54:18,680 INFO L226 Difference]: Without dead ends: 0 [2021-07-13 18:54:18,681 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-13 18:54:18,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-07-13 18:54:18,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-07-13 18:54:18,695 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-07-13 18:54:18,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-07-13 18:54:18,696 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2021-07-13 18:54:18,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:54:18,696 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-07-13 18:54:18,696 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:54:18,696 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-07-13 18:54:18,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-07-13 18:54:18,697 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-07-13 18:54:18,697 INFO L301 ceAbstractionStarter]: Result for error location P1Thread1of1ForFork0 was SAFE (1/2) [2021-07-13 18:54:18,698 INFO L255 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-07-13 18:54:18,703 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-13 18:54:18,704 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-13 18:54:18,704 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-13 18:54:18,704 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-13 18:54:18,704 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-13 18:54:18,704 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-13 18:54:18,704 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-13 18:54:18,704 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-07-13 18:54:18,706 INFO L110 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 90 places, 85 transitions, 180 flow [2021-07-13 18:54:18,724 INFO L132 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1243 states, 1241 states have (on average 2.678485092667204) internal successors, (3324), 1242 states have internal predecessors, (3324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:54:18,726 INFO L276 IsEmpty]: Start isEmpty. Operand has 1243 states, 1241 states have (on average 2.678485092667204) internal successors, (3324), 1242 states have internal predecessors, (3324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:54:18,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-07-13 18:54:18,734 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:54:18,734 INFO L508 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-07-13 18:54:18,734 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:54:18,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:54:18,734 INFO L82 PathProgramCache]: Analyzing trace with hash 453548779, now seen corresponding path program 1 times [2021-07-13 18:54:18,734 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:54:18,735 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056826995] [2021-07-13 18:54:18,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:54:18,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:54:18,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:54:18,956 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:54:18,956 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056826995] [2021-07-13 18:54:18,956 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056826995] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:54:18,956 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:54:18,956 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-07-13 18:54:18,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181743531] [2021-07-13 18:54:18,957 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-07-13 18:54:18,957 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:54:18,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-07-13 18:54:18,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-07-13 18:54:18,960 INFO L87 Difference]: Start difference. First operand has 1243 states, 1241 states have (on average 2.678485092667204) internal successors, (3324), 1242 states have internal predecessors, (3324), 0 states have call successors, (0), 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 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 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-07-13 18:54:19,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:54:19,318 INFO L93 Difference]: Finished difference Result 1441 states and 3718 transitions. [2021-07-13 18:54:19,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-07-13 18:54:19,320 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 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-07-13 18:54:19,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:54:19,330 INFO L225 Difference]: With dead ends: 1441 [2021-07-13 18:54:19,330 INFO L226 Difference]: Without dead ends: 1096 [2021-07-13 18:54:19,331 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 236.8ms TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2021-07-13 18:54:19,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1096 states. [2021-07-13 18:54:19,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1096 to 1090. [2021-07-13 18:54:19,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1090 states, 1088 states have (on average 2.5854779411764706) internal successors, (2813), 1089 states have internal predecessors, (2813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:54:19,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 2813 transitions. [2021-07-13 18:54:19,385 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 2813 transitions. Word has length 56 [2021-07-13 18:54:19,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:54:19,385 INFO L482 AbstractCegarLoop]: Abstraction has 1090 states and 2813 transitions. [2021-07-13 18:54:19,385 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 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-07-13 18:54:19,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 2813 transitions. [2021-07-13 18:54:19,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-07-13 18:54:19,394 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:54:19,394 INFO L508 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-07-13 18:54:19,394 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-07-13 18:54:19,394 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:54:19,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:54:19,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1763939253, now seen corresponding path program 1 times [2021-07-13 18:54:19,394 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:54:19,395 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244913471] [2021-07-13 18:54:19,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:54:19,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:54:19,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:54:19,490 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:54:19,490 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244913471] [2021-07-13 18:54:19,490 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244913471] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:54:19,490 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:54:19,491 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-13 18:54:19,491 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271379521] [2021-07-13 18:54:19,492 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-13 18:54:19,492 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:54:19,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-13 18:54:19,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-13 18:54:19,492 INFO L87 Difference]: Start difference. First operand 1090 states and 2813 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:54:19,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:54:19,598 INFO L93 Difference]: Finished difference Result 1270 states and 3251 transitions. [2021-07-13 18:54:19,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-13 18:54:19,599 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-07-13 18:54:19,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:54:19,602 INFO L225 Difference]: With dead ends: 1270 [2021-07-13 18:54:19,603 INFO L226 Difference]: Without dead ends: 1078 [2021-07-13 18:54:19,603 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 83.1ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-13 18:54:19,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2021-07-13 18:54:19,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 1078. [2021-07-13 18:54:19,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 1076 states have (on average 2.5808550185873607) internal successors, (2777), 1077 states have internal predecessors, (2777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:54:19,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 2777 transitions. [2021-07-13 18:54:19,636 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 2777 transitions. Word has length 58 [2021-07-13 18:54:19,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:54:19,637 INFO L482 AbstractCegarLoop]: Abstraction has 1078 states and 2777 transitions. [2021-07-13 18:54:19,637 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:54:19,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 2777 transitions. [2021-07-13 18:54:19,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-07-13 18:54:19,643 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:54:19,643 INFO L508 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-07-13 18:54:19,647 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-07-13 18:54:19,647 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:54:19,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:54:19,648 INFO L82 PathProgramCache]: Analyzing trace with hash 175149714, now seen corresponding path program 1 times [2021-07-13 18:54:19,648 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:54:19,648 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241725605] [2021-07-13 18:54:19,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:54:19,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:54:19,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:54:19,827 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:54:19,827 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241725605] [2021-07-13 18:54:19,827 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241725605] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:54:19,827 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:54:19,827 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-07-13 18:54:19,827 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278616322] [2021-07-13 18:54:19,828 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-07-13 18:54:19,828 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:54:19,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-07-13 18:54:19,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-07-13 18:54:19,828 INFO L87 Difference]: Start difference. First operand 1078 states and 2777 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 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-07-13 18:54:20,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:54:20,030 INFO L93 Difference]: Finished difference Result 1103 states and 2802 transitions. [2021-07-13 18:54:20,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-07-13 18:54:20,031 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 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-07-13 18:54:20,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:54:20,034 INFO L225 Difference]: With dead ends: 1103 [2021-07-13 18:54:20,034 INFO L226 Difference]: Without dead ends: 943 [2021-07-13 18:54:20,034 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 155.2ms TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-07-13 18:54:20,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2021-07-13 18:54:20,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 943. [2021-07-13 18:54:20,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 942 states have (on average 2.552016985138004) internal successors, (2404), 942 states have internal predecessors, (2404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:54:20,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 2404 transitions. [2021-07-13 18:54:20,051 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 2404 transitions. Word has length 59 [2021-07-13 18:54:20,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:54:20,052 INFO L482 AbstractCegarLoop]: Abstraction has 943 states and 2404 transitions. [2021-07-13 18:54:20,052 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 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-07-13 18:54:20,052 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 2404 transitions. [2021-07-13 18:54:20,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-07-13 18:54:20,053 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:54:20,053 INFO L508 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-07-13 18:54:20,053 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-07-13 18:54:20,053 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:54:20,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:54:20,054 INFO L82 PathProgramCache]: Analyzing trace with hash -838949141, now seen corresponding path program 1 times [2021-07-13 18:54:20,054 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:54:20,054 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267624785] [2021-07-13 18:54:20,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:54:20,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:54:20,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:54:20,149 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:54:20,149 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267624785] [2021-07-13 18:54:20,149 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267624785] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:54:20,149 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:54:20,149 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-13 18:54:20,149 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873962704] [2021-07-13 18:54:20,150 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-13 18:54:20,150 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:54:20,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-13 18:54:20,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-13 18:54:20,150 INFO L87 Difference]: Start difference. First operand 943 states and 2404 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:54:20,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:54:20,230 INFO L93 Difference]: Finished difference Result 1613 states and 4075 transitions. [2021-07-13 18:54:20,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-13 18:54:20,231 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-07-13 18:54:20,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:54:20,234 INFO L225 Difference]: With dead ends: 1613 [2021-07-13 18:54:20,234 INFO L226 Difference]: Without dead ends: 1063 [2021-07-13 18:54:20,234 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 79.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-13 18:54:20,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2021-07-13 18:54:20,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 883. [2021-07-13 18:54:20,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 882 states have (on average 2.473922902494331) internal successors, (2182), 882 states have internal predecessors, (2182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:54:20,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 2182 transitions. [2021-07-13 18:54:20,249 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 2182 transitions. Word has length 59 [2021-07-13 18:54:20,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:54:20,250 INFO L482 AbstractCegarLoop]: Abstraction has 883 states and 2182 transitions. [2021-07-13 18:54:20,250 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:54:20,250 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 2182 transitions. [2021-07-13 18:54:20,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-07-13 18:54:20,251 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:54:20,251 INFO L508 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-07-13 18:54:20,251 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-07-13 18:54:20,251 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:54:20,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:54:20,251 INFO L82 PathProgramCache]: Analyzing trace with hash -939360214, now seen corresponding path program 1 times [2021-07-13 18:54:20,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:54:20,252 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524148100] [2021-07-13 18:54:20,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:54:20,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:54:20,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:54:20,414 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:54:20,417 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524148100] [2021-07-13 18:54:20,417 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524148100] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:54:20,417 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:54:20,417 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-07-13 18:54:20,417 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62927651] [2021-07-13 18:54:20,417 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-07-13 18:54:20,418 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:54:20,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-07-13 18:54:20,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-07-13 18:54:20,418 INFO L87 Difference]: Start difference. First operand 883 states and 2182 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-07-13 18:54:20,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:54:20,589 INFO L93 Difference]: Finished difference Result 1015 states and 2496 transitions. [2021-07-13 18:54:20,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-07-13 18:54:20,589 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-07-13 18:54:20,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:54:20,592 INFO L225 Difference]: With dead ends: 1015 [2021-07-13 18:54:20,592 INFO L226 Difference]: Without dead ends: 871 [2021-07-13 18:54:20,592 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 128.4ms TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2021-07-13 18:54:20,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2021-07-13 18:54:20,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 871. [2021-07-13 18:54:20,604 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-07-13 18:54:20,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 2146 transitions. [2021-07-13 18:54:20,606 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 2146 transitions. Word has length 60 [2021-07-13 18:54:20,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:54:20,606 INFO L482 AbstractCegarLoop]: Abstraction has 871 states and 2146 transitions. [2021-07-13 18:54:20,606 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-07-13 18:54:20,606 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 2146 transitions. [2021-07-13 18:54:20,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-07-13 18:54:20,607 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:54:20,607 INFO L508 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-07-13 18:54:20,607 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-07-13 18:54:20,607 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:54:20,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:54:20,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1277498930, now seen corresponding path program 1 times [2021-07-13 18:54:20,608 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:54:20,608 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720093605] [2021-07-13 18:54:20,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:54:20,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:54:20,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:54:20,744 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:54:20,744 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720093605] [2021-07-13 18:54:20,744 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720093605] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:54:20,744 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:54:20,744 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-07-13 18:54:20,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951588341] [2021-07-13 18:54:20,745 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-07-13 18:54:20,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:54:20,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-07-13 18:54:20,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-07-13 18:54:20,745 INFO L87 Difference]: Start difference. First operand 871 states and 2146 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:54:20,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:54:20,981 INFO L93 Difference]: Finished difference Result 1002 states and 2454 transitions. [2021-07-13 18:54:20,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-07-13 18:54:20,981 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-07-13 18:54:20,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:54:20,984 INFO L225 Difference]: With dead ends: 1002 [2021-07-13 18:54:20,984 INFO L226 Difference]: Without dead ends: 882 [2021-07-13 18:54:20,984 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 144.3ms TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2021-07-13 18:54:20,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2021-07-13 18:54:20,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 882. [2021-07-13 18:54:20,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 881 states have (on average 2.4597048808172532) internal successors, (2167), 881 states have internal predecessors, (2167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:54:20,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 2167 transitions. [2021-07-13 18:54:20,999 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 2167 transitions. Word has length 61 [2021-07-13 18:54:20,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:54:21,000 INFO L482 AbstractCegarLoop]: Abstraction has 882 states and 2167 transitions. [2021-07-13 18:54:21,000 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:54:21,000 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 2167 transitions. [2021-07-13 18:54:21,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-07-13 18:54:21,001 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:54:21,001 INFO L508 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-07-13 18:54:21,001 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-07-13 18:54:21,001 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:54:21,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:54:21,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1722238560, now seen corresponding path program 2 times [2021-07-13 18:54:21,002 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:54:21,002 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104220663] [2021-07-13 18:54:21,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:54:21,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:54:21,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:54:21,157 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:54:21,157 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104220663] [2021-07-13 18:54:21,157 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104220663] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:54:21,158 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:54:21,158 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-07-13 18:54:21,158 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839877142] [2021-07-13 18:54:21,158 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-07-13 18:54:21,158 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:54:21,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-07-13 18:54:21,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-07-13 18:54:21,159 INFO L87 Difference]: Start difference. First operand 882 states and 2167 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-07-13 18:54:21,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:54:21,393 INFO L93 Difference]: Finished difference Result 1003 states and 2455 transitions. [2021-07-13 18:54:21,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-07-13 18:54:21,394 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-07-13 18:54:21,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:54:21,397 INFO L225 Difference]: With dead ends: 1003 [2021-07-13 18:54:21,397 INFO L226 Difference]: Without dead ends: 883 [2021-07-13 18:54:21,397 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 187.2ms TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2021-07-13 18:54:21,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2021-07-13 18:54:21,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 880. [2021-07-13 18:54:21,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 879 states have (on average 2.460750853242321) internal successors, (2163), 879 states have internal predecessors, (2163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:54:21,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 2163 transitions. [2021-07-13 18:54:21,410 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 2163 transitions. Word has length 61 [2021-07-13 18:54:21,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:54:21,410 INFO L482 AbstractCegarLoop]: Abstraction has 880 states and 2163 transitions. [2021-07-13 18:54:21,410 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-07-13 18:54:21,411 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 2163 transitions. [2021-07-13 18:54:21,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-07-13 18:54:21,411 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:54:21,412 INFO L508 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-07-13 18:54:21,412 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-07-13 18:54:21,412 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:54:21,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:54:21,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1297301004, now seen corresponding path program 3 times [2021-07-13 18:54:21,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:54:21,412 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781759569] [2021-07-13 18:54:21,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:54:21,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:54:21,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:54:21,548 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:54:21,548 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781759569] [2021-07-13 18:54:21,548 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781759569] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:54:21,548 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:54:21,548 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-07-13 18:54:21,548 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990391944] [2021-07-13 18:54:21,549 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-07-13 18:54:21,549 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:54:21,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-07-13 18:54:21,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-07-13 18:54:21,549 INFO L87 Difference]: Start difference. First operand 880 states and 2163 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:54:21,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:54:21,795 INFO L93 Difference]: Finished difference Result 1064 states and 2616 transitions. [2021-07-13 18:54:21,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-07-13 18:54:21,795 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-07-13 18:54:21,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:54:21,799 INFO L225 Difference]: With dead ends: 1064 [2021-07-13 18:54:21,799 INFO L226 Difference]: Without dead ends: 928 [2021-07-13 18:54:21,799 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 175.1ms TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2021-07-13 18:54:21,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2021-07-13 18:54:21,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 895. [2021-07-13 18:54:21,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 895 states, 894 states have (on average 2.466442953020134) internal successors, (2205), 894 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:54:21,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 2205 transitions. [2021-07-13 18:54:21,812 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 2205 transitions. Word has length 61 [2021-07-13 18:54:21,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:54:21,812 INFO L482 AbstractCegarLoop]: Abstraction has 895 states and 2205 transitions. [2021-07-13 18:54:21,812 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:54:21,812 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 2205 transitions. [2021-07-13 18:54:21,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-07-13 18:54:21,814 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:54:21,814 INFO L508 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-07-13 18:54:21,814 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-07-13 18:54:21,814 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:54:21,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:54:21,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1213648905, now seen corresponding path program 1 times [2021-07-13 18:54:21,814 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:54:21,814 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472039098] [2021-07-13 18:54:21,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:54:21,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:54:22,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:54:22,003 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:54:22,003 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472039098] [2021-07-13 18:54:22,003 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472039098] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:54:22,003 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:54:22,004 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-07-13 18:54:22,004 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660243582] [2021-07-13 18:54:22,004 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-07-13 18:54:22,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:54:22,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-07-13 18:54:22,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-07-13 18:54:22,004 INFO L87 Difference]: Start difference. First operand 895 states and 2205 transitions. Second operand has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 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-07-13 18:54:22,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:54:22,535 INFO L93 Difference]: Finished difference Result 1040 states and 2517 transitions. [2021-07-13 18:54:22,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-07-13 18:54:22,536 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 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-07-13 18:54:22,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:54:22,538 INFO L225 Difference]: With dead ends: 1040 [2021-07-13 18:54:22,538 INFO L226 Difference]: Without dead ends: 899 [2021-07-13 18:54:22,539 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 422.5ms TimeCoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2021-07-13 18:54:22,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2021-07-13 18:54:22,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 899. [2021-07-13 18:54:22,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 898 states have (on average 2.4443207126948776) internal successors, (2195), 898 states have internal predecessors, (2195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:54:22,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 2195 transitions. [2021-07-13 18:54:22,551 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 2195 transitions. Word has length 62 [2021-07-13 18:54:22,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:54:22,551 INFO L482 AbstractCegarLoop]: Abstraction has 899 states and 2195 transitions. [2021-07-13 18:54:22,551 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 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-07-13 18:54:22,551 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 2195 transitions. [2021-07-13 18:54:22,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-07-13 18:54:22,552 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:54:22,553 INFO L508 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-07-13 18:54:22,553 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-07-13 18:54:22,553 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:54:22,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:54:22,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1658388535, now seen corresponding path program 2 times [2021-07-13 18:54:22,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:54:22,553 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688686588] [2021-07-13 18:54:22,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:54:22,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:54:22,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:54:22,724 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:54:22,724 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688686588] [2021-07-13 18:54:22,725 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688686588] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:54:22,725 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:54:22,725 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-07-13 18:54:22,725 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096203569] [2021-07-13 18:54:22,725 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-07-13 18:54:22,725 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:54:22,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-07-13 18:54:22,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2021-07-13 18:54:22,726 INFO L87 Difference]: Start difference. First operand 899 states and 2195 transitions. Second operand has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 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-07-13 18:54:23,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:54:23,176 INFO L93 Difference]: Finished difference Result 1024 states and 2467 transitions. [2021-07-13 18:54:23,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-07-13 18:54:23,176 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 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-07-13 18:54:23,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:54:23,179 INFO L225 Difference]: With dead ends: 1024 [2021-07-13 18:54:23,179 INFO L226 Difference]: Without dead ends: 796 [2021-07-13 18:54:23,179 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 379.6ms TimeCoverageRelationStatistics Valid=193, Invalid=737, Unknown=0, NotChecked=0, Total=930 [2021-07-13 18:54:23,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2021-07-13 18:54:23,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 795. [2021-07-13 18:54:23,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 795 states, 794 states have (on average 2.4319899244332492) internal successors, (1931), 794 states have internal predecessors, (1931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:54:23,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1931 transitions. [2021-07-13 18:54:23,216 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1931 transitions. Word has length 62 [2021-07-13 18:54:23,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:54:23,216 INFO L482 AbstractCegarLoop]: Abstraction has 795 states and 1931 transitions. [2021-07-13 18:54:23,216 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 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-07-13 18:54:23,216 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1931 transitions. [2021-07-13 18:54:23,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-07-13 18:54:23,217 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:54:23,217 INFO L508 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-07-13 18:54:23,217 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-07-13 18:54:23,217 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:54:23,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:54:23,218 INFO L82 PathProgramCache]: Analyzing trace with hash -221375873, now seen corresponding path program 3 times [2021-07-13 18:54:23,218 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:54:23,218 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414654496] [2021-07-13 18:54:23,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:54:23,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:54:23,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:54:23,417 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:54:23,417 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414654496] [2021-07-13 18:54:23,417 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414654496] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:54:23,418 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:54:23,418 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-07-13 18:54:23,418 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562445298] [2021-07-13 18:54:23,418 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-07-13 18:54:23,418 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:54:23,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-07-13 18:54:23,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2021-07-13 18:54:23,419 INFO L87 Difference]: Start difference. First operand 795 states and 1931 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-07-13 18:54:23,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:54:23,637 INFO L93 Difference]: Finished difference Result 896 states and 2163 transitions. [2021-07-13 18:54:23,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-07-13 18:54:23,637 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-07-13 18:54:23,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:54:23,640 INFO L225 Difference]: With dead ends: 896 [2021-07-13 18:54:23,640 INFO L226 Difference]: Without dead ends: 770 [2021-07-13 18:54:23,640 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 248.0ms TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2021-07-13 18:54:23,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2021-07-13 18:54:23,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 770. [2021-07-13 18:54:23,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 769 states have (on average 2.4382314694408325) internal successors, (1875), 769 states have internal predecessors, (1875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:54:23,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1875 transitions. [2021-07-13 18:54:23,650 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1875 transitions. Word has length 62 [2021-07-13 18:54:23,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:54:23,650 INFO L482 AbstractCegarLoop]: Abstraction has 770 states and 1875 transitions. [2021-07-13 18:54:23,651 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-07-13 18:54:23,651 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1875 transitions. [2021-07-13 18:54:23,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-07-13 18:54:23,652 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:54:23,652 INFO L508 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-07-13 18:54:23,652 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-07-13 18:54:23,652 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:54:23,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:54:23,652 INFO L82 PathProgramCache]: Analyzing trace with hash -14122231, now seen corresponding path program 4 times [2021-07-13 18:54:23,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:54:23,652 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700086920] [2021-07-13 18:54:23,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:54:23,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:54:23,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:54:23,780 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:54:23,780 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700086920] [2021-07-13 18:54:23,780 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700086920] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:54:23,780 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:54:23,780 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-07-13 18:54:23,780 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171846479] [2021-07-13 18:54:23,781 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-07-13 18:54:23,781 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:54:23,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-07-13 18:54:23,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-07-13 18:54:23,781 INFO L87 Difference]: Start difference. First operand 770 states and 1875 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-07-13 18:54:23,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:54:23,986 INFO L93 Difference]: Finished difference Result 1146 states and 2765 transitions. [2021-07-13 18:54:23,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-07-13 18:54:23,987 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-07-13 18:54:23,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:54:23,989 INFO L225 Difference]: With dead ends: 1146 [2021-07-13 18:54:23,989 INFO L226 Difference]: Without dead ends: 727 [2021-07-13 18:54:23,989 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 170.7ms TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2021-07-13 18:54:23,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2021-07-13 18:54:23,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 607. [2021-07-13 18:54:23,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 606 states have (on average 2.382838283828383) internal successors, (1444), 606 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:54:23,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 1444 transitions. [2021-07-13 18:54:23,998 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 1444 transitions. Word has length 62 [2021-07-13 18:54:23,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:54:23,998 INFO L482 AbstractCegarLoop]: Abstraction has 607 states and 1444 transitions. [2021-07-13 18:54:23,998 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-07-13 18:54:23,998 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 1444 transitions. [2021-07-13 18:54:23,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-07-13 18:54:23,999 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:54:23,999 INFO L508 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-07-13 18:54:23,999 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-07-13 18:54:23,999 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:54:24,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:54:24,000 INFO L82 PathProgramCache]: Analyzing trace with hash 702918489, now seen corresponding path program 1 times [2021-07-13 18:54:24,000 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:54:24,000 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102815266] [2021-07-13 18:54:24,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:54:24,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:54:24,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:54:24,074 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:54:24,074 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102815266] [2021-07-13 18:54:24,074 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102815266] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:54:24,075 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:54:24,075 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-13 18:54:24,075 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804023875] [2021-07-13 18:54:24,075 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-13 18:54:24,075 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:54:24,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-13 18:54:24,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-13 18:54:24,076 INFO L87 Difference]: Start difference. First operand 607 states and 1444 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-07-13 18:54:24,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:54:24,141 INFO L93 Difference]: Finished difference Result 677 states and 1568 transitions. [2021-07-13 18:54:24,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-13 18:54:24,142 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-07-13 18:54:24,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:54:24,143 INFO L225 Difference]: With dead ends: 677 [2021-07-13 18:54:24,143 INFO L226 Difference]: Without dead ends: 493 [2021-07-13 18:54:24,143 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 62.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-13 18:54:24,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2021-07-13 18:54:24,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2021-07-13 18:54:24,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 492 states have (on average 2.2886178861788617) internal successors, (1126), 492 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:54:24,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 1126 transitions. [2021-07-13 18:54:24,150 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 1126 transitions. Word has length 62 [2021-07-13 18:54:24,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:54:24,150 INFO L482 AbstractCegarLoop]: Abstraction has 493 states and 1126 transitions. [2021-07-13 18:54:24,150 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-07-13 18:54:24,150 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 1126 transitions. [2021-07-13 18:54:24,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-07-13 18:54:24,151 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:54:24,151 INFO L508 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-07-13 18:54:24,151 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-07-13 18:54:24,152 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:54:24,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:54:24,152 INFO L82 PathProgramCache]: Analyzing trace with hash -66572615, now seen corresponding path program 1 times [2021-07-13 18:54:24,152 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:54:24,152 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384838898] [2021-07-13 18:54:24,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:54:24,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:54:24,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:54:24,208 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:54:24,209 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384838898] [2021-07-13 18:54:24,209 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384838898] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:54:24,209 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:54:24,209 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-13 18:54:24,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509920941] [2021-07-13 18:54:24,209 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-13 18:54:24,209 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:54:24,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-13 18:54:24,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-07-13 18:54:24,210 INFO L87 Difference]: Start difference. First operand 493 states and 1126 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-07-13 18:54:24,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:54:24,288 INFO L93 Difference]: Finished difference Result 415 states and 903 transitions. [2021-07-13 18:54:24,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-07-13 18:54:24,288 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-07-13 18:54:24,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:54:24,289 INFO L225 Difference]: With dead ends: 415 [2021-07-13 18:54:24,289 INFO L226 Difference]: Without dead ends: 259 [2021-07-13 18:54:24,290 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 75.7ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-07-13 18:54:24,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-07-13 18:54:24,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2021-07-13 18:54:24,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 258 states have (on average 2.062015503875969) internal successors, (532), 258 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:54:24,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 532 transitions. [2021-07-13 18:54:24,293 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 532 transitions. Word has length 63 [2021-07-13 18:54:24,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:54:24,294 INFO L482 AbstractCegarLoop]: Abstraction has 259 states and 532 transitions. [2021-07-13 18:54:24,294 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-07-13 18:54:24,294 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 532 transitions. [2021-07-13 18:54:24,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-07-13 18:54:24,294 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:54:24,294 INFO L508 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-07-13 18:54:24,294 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-07-13 18:54:24,294 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:54:24,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:54:24,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1262077414, now seen corresponding path program 1 times [2021-07-13 18:54:24,295 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:54:24,295 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199058075] [2021-07-13 18:54:24,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:54:24,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-13 18:54:24,313 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-13 18:54:24,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-13 18:54:24,336 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-13 18:54:24,356 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-13 18:54:24,356 INFO L609 BasicCegarLoop]: Counterexample might be feasible [2021-07-13 18:54:24,357 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-07-13 18:54:24,357 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2021-07-13 18:54:24,358 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-07-13 18:54:24,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 06:54:24 BasicIcfg [2021-07-13 18:54:24,409 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-07-13 18:54:24,410 INFO L168 Benchmark]: Toolchain (without parser) took 8239.60 ms. Allocated memory was 127.9 MB in the beginning and 306.2 MB in the end (delta: 178.3 MB). Free memory was 101.8 MB in the beginning and 105.0 MB in the end (delta: -3.2 MB). Peak memory consumption was 174.5 MB. Max. memory is 8.0 GB. [2021-07-13 18:54:24,410 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 127.9 MB. Free memory is still 109.0 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-07-13 18:54:24,410 INFO L168 Benchmark]: CACSL2BoogieTranslator took 386.28 ms. Allocated memory was 127.9 MB in the beginning and 186.6 MB in the end (delta: 58.7 MB). Free memory was 101.8 MB in the beginning and 156.9 MB in the end (delta: -55.1 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2021-07-13 18:54:24,410 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.10 ms. Allocated memory is still 186.6 MB. Free memory was 156.9 MB in the beginning and 154.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-07-13 18:54:24,410 INFO L168 Benchmark]: Boogie Preprocessor took 31.84 ms. Allocated memory is still 186.6 MB. Free memory was 154.0 MB in the beginning and 151.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-07-13 18:54:24,410 INFO L168 Benchmark]: RCFGBuilder took 1568.49 ms. Allocated memory was 186.6 MB in the beginning and 224.4 MB in the end (delta: 37.7 MB). Free memory was 151.9 MB in the beginning and 182.6 MB in the end (delta: -30.7 MB). Peak memory consumption was 62.0 MB. Max. memory is 8.0 GB. [2021-07-13 18:54:24,410 INFO L168 Benchmark]: TraceAbstraction took 6183.43 ms. Allocated memory was 224.4 MB in the beginning and 306.2 MB in the end (delta: 81.8 MB). Free memory was 182.1 MB in the beginning and 105.0 MB in the end (delta: 77.0 MB). Peak memory consumption was 158.8 MB. Max. memory is 8.0 GB. [2021-07-13 18:54:24,411 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 127.9 MB. Free memory is still 109.0 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 386.28 ms. Allocated memory was 127.9 MB in the beginning and 186.6 MB in the end (delta: 58.7 MB). Free memory was 101.8 MB in the beginning and 156.9 MB in the end (delta: -55.1 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 65.10 ms. Allocated memory is still 186.6 MB. Free memory was 156.9 MB in the beginning and 154.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 31.84 ms. Allocated memory is still 186.6 MB. Free memory was 154.0 MB in the beginning and 151.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1568.49 ms. Allocated memory was 186.6 MB in the beginning and 224.4 MB in the end (delta: 37.7 MB). Free memory was 151.9 MB in the beginning and 182.6 MB in the end (delta: -30.7 MB). Peak memory consumption was 62.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 6183.43 ms. Allocated memory was 224.4 MB in the beginning and 306.2 MB in the end (delta: 81.8 MB). Free memory was 182.1 MB in the beginning and 105.0 MB in the end (delta: 77.0 MB). Peak memory consumption was 158.8 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [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] [L713] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L714] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L715] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L716] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L717] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L718] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L719] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L720] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L721] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L722] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L723] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L724] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L725] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L726] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L728] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L729] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L790] 0 pthread_t t2475; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L791] FCALL, FORK 0 pthread_create(&t2475, ((void *)0), P0, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L792] 0 pthread_t t2476; 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L793] FCALL, FORK 0 pthread_create(&t2476, ((void *)0), P1, ((void *)0)) 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L754] 2 x$w_buff1 = x$w_buff0 [L755] 2 x$w_buff0 = 2 [L756] 2 x$w_buff1_used = x$w_buff0_used [L757] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L759] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L760] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L761] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L762] 2 x$r_buff0_thd2 = (_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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L734] 1 y = 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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L740] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L740] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L741] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L742] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L743] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L743] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L744] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L747] 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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L768] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L770] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L771] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L772] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L772] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L799] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L799] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L800] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L800] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L801] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L802] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L802] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L803] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L803] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 x$flush_delayed = weak$$choice2 [L809] 0 x$mem_tmp = x [L810] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L810] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L811] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L811] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L812] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L812] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L813] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L813] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L814] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L815] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L816] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L818] 0 x = x$flush_delayed ? x$mem_tmp : x [L819] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [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=50, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L18] 0 reach_error() VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P1Thread1of1ForFork0 with 1 thread instances CFG has 5 procedures, 103 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 392.2ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 18.0ms, AutomataDifference: 61.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 44.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 70 SDtfs, 27 SDslu, 22 SDs, 0 SdLazy, 3 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=691occurred 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: 6.1ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 7.2ms SsaConstructionTime, 54.4ms SatisfiabilityAnalysisTime, 114.2ms InterpolantComputationTime, 44 NumberOfCodeBlocks, 44 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 43 ConstructedInterpolants, 0 QuantifiedInterpolants, 85 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 103 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 5653.2ms, OverallIterations: 15, TraceHistogramMax: 1, EmptinessCheckTime: 32.5ms, AutomataDifference: 3245.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 20.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1430 SDtfs, 2135 SDslu, 6675 SDs, 0 SdLazy, 1436 SolverSat, 255 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1172.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 246 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 716 ImplicationChecksByTransitivity, 2549.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1243occurred in iteration=0, InterpolantAutomatonStates: 190, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 251.1ms AutomataMinimizationTime, 14 MinimizatonAttempts, 343 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 36.9ms SsaConstructionTime, 289.9ms SatisfiabilityAnalysisTime, 1634.6ms InterpolantComputationTime, 914 NumberOfCodeBlocks, 914 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 834 ConstructedInterpolants, 0 QuantifiedInterpolants, 5877 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...