/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/mix056_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-87fd7473a0bda1db0ad7f77f2116346063730f21-87fd747 [2021-08-21 11:37:14,461 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-21 11:37:14,463 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-21 11:37:14,495 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-21 11:37:14,496 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-21 11:37:14,498 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-21 11:37:14,500 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-21 11:37:14,505 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-21 11:37:14,506 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-21 11:37:14,510 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-21 11:37:14,511 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-21 11:37:14,512 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-21 11:37:14,512 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-21 11:37:14,518 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-21 11:37:14,519 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-21 11:37:14,524 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-21 11:37:14,525 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-21 11:37:14,526 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-21 11:37:14,528 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-21 11:37:14,532 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-21 11:37:14,533 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-21 11:37:14,534 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-21 11:37:14,534 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-21 11:37:14,536 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-21 11:37:14,541 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-21 11:37:14,541 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-21 11:37:14,541 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-21 11:37:14,543 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-21 11:37:14,543 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-21 11:37:14,543 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-21 11:37:14,544 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-21 11:37:14,544 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-21 11:37:14,545 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-21 11:37:14,546 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-21 11:37:14,547 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-21 11:37:14,547 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-21 11:37:14,548 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-21 11:37:14,549 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-21 11:37:14,549 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-21 11:37:14,549 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-21 11:37:14,550 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-21 11:37:14,553 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-08-21 11:37:14,583 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-21 11:37:14,584 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-21 11:37:14,584 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-21 11:37:14,584 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-21 11:37:14,587 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-21 11:37:14,587 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-21 11:37:14,587 INFO L138 SettingsManager]: * Use SBE=true [2021-08-21 11:37:14,587 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-21 11:37:14,587 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-21 11:37:14,587 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-21 11:37:14,588 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-21 11:37:14,588 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-21 11:37:14,588 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-21 11:37:14,588 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-21 11:37:14,588 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-21 11:37:14,588 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-21 11:37:14,589 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-21 11:37:14,589 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-21 11:37:14,589 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-21 11:37:14,589 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-21 11:37:14,589 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-21 11:37:14,589 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-21 11:37:14,589 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-21 11:37:14,589 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-21 11:37:14,589 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-21 11:37:14,589 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-21 11:37:14,590 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-21 11:37:14,590 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-21 11:37:14,590 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-21 11:37:14,590 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-21 11:37:14,590 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-21 11:37:14,590 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-08-21 11:37:14,866 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-21 11:37:14,879 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-21 11:37:14,881 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-21 11:37:14,881 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-21 11:37:14,882 INFO L275 PluginConnector]: CDTParser initialized [2021-08-21 11:37:14,882 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_tso.opt.i [2021-08-21 11:37:14,920 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bec6ab17/7552faa46b454824928d5100cc676a6a/FLAG9a7b3c9db [2021-08-21 11:37:15,429 INFO L306 CDTParser]: Found 1 translation units. [2021-08-21 11:37:15,429 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_tso.opt.i [2021-08-21 11:37:15,450 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bec6ab17/7552faa46b454824928d5100cc676a6a/FLAG9a7b3c9db [2021-08-21 11:37:15,917 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bec6ab17/7552faa46b454824928d5100cc676a6a [2021-08-21 11:37:15,919 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-21 11:37:15,920 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-21 11:37:15,921 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-21 11:37:15,921 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-21 11:37:15,923 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-21 11:37:15,924 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 11:37:15" (1/1) ... [2021-08-21 11:37:15,924 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bb78b2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:37:15, skipping insertion in model container [2021-08-21 11:37:15,924 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 11:37:15" (1/1) ... [2021-08-21 11:37:15,944 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-21 11:37:16,003 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-21 11:37:16,181 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_tso.opt.i[948,961] [2021-08-21 11:37:16,309 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-21 11:37:16,314 INFO L203 MainTranslator]: Completed pre-run [2021-08-21 11:37:16,322 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_tso.opt.i[948,961] [2021-08-21 11:37:16,351 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-21 11:37:16,383 INFO L208 MainTranslator]: Completed translation [2021-08-21 11:37:16,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:37:16 WrapperNode [2021-08-21 11:37:16,384 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-21 11:37:16,385 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-21 11:37:16,385 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-21 11:37:16,385 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-21 11:37:16,390 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:37:16" (1/1) ... [2021-08-21 11:37:16,415 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:37:16" (1/1) ... [2021-08-21 11:37:16,460 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-21 11:37:16,461 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-21 11:37:16,461 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-21 11:37:16,461 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-21 11:37:16,466 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:37:16" (1/1) ... [2021-08-21 11:37:16,466 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:37:16" (1/1) ... [2021-08-21 11:37:16,468 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:37:16" (1/1) ... [2021-08-21 11:37:16,468 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:37:16" (1/1) ... [2021-08-21 11:37:16,478 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:37:16" (1/1) ... [2021-08-21 11:37:16,480 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:37:16" (1/1) ... [2021-08-21 11:37:16,482 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:37:16" (1/1) ... [2021-08-21 11:37:16,494 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-21 11:37:16,495 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-21 11:37:16,495 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-21 11:37:16,495 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-21 11:37:16,495 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:37:16" (1/1) ... [2021-08-21 11:37:16,511 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-21 11:37:16,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-21 11:37:16,558 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-21 11:37:16,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-21 11:37:16,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-21 11:37:16,640 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-21 11:37:16,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-21 11:37:16,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-21 11:37:16,640 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-21 11:37:16,640 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-21 11:37:16,640 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-21 11:37:16,640 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-21 11:37:16,640 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-08-21 11:37:16,641 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-08-21 11:37:16,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-21 11:37:16,641 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-21 11:37:16,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-21 11:37:16,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-21 11:37:16,642 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-21 11:37:18,245 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-21 11:37:18,246 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-21 11:37:18,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 11:37:18 BoogieIcfgContainer [2021-08-21 11:37:18,247 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-21 11:37:18,248 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-21 11:37:18,249 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-21 11:37:18,250 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-21 11:37:18,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.08 11:37:15" (1/3) ... [2021-08-21 11:37:18,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@548ad53d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 11:37:18, skipping insertion in model container [2021-08-21 11:37:18,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:37:16" (2/3) ... [2021-08-21 11:37:18,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@548ad53d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 11:37:18, skipping insertion in model container [2021-08-21 11:37:18,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 11:37:18" (3/3) ... [2021-08-21 11:37:18,252 INFO L111 eAbstractionObserver]: Analyzing ICFG mix056_tso.opt.i [2021-08-21 11:37:18,255 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-08-21 11:37:18,255 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-21 11:37:18,255 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-21 11:37:18,255 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-21 11:37:18,285 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,286 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,286 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,286 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,286 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,286 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,286 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,286 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,286 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,287 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,287 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,287 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,287 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,287 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,287 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,287 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,287 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,287 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,287 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,287 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,290 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,290 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,290 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,290 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,290 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,290 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,290 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,290 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,290 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,290 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,291 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,291 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,291 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,291 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,291 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,291 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,291 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,291 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,291 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,292 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,292 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,292 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,292 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,292 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,292 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,292 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,292 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,292 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,292 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,293 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,293 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,293 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,293 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,293 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,293 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,293 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,295 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,295 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,296 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,296 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,296 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,296 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,296 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,296 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,296 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,296 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,297 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,297 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,299 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,299 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,299 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,299 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,301 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,301 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,301 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,301 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,301 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,301 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,301 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,301 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,301 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,301 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:37:18,303 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-21 11:37:18,328 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-21 11:37:18,332 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-21 11:37:18,332 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-08-21 11:37:18,339 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 113 places, 105 transitions, 225 flow [2021-08-21 11:37:18,539 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 10392 states, 10389 states have (on average 3.547020887477139) internal successors, (36850), 10391 states have internal predecessors, (36850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:37:18,569 INFO L276 IsEmpty]: Start isEmpty. Operand has 10392 states, 10389 states have (on average 3.547020887477139) internal successors, (36850), 10391 states have internal predecessors, (36850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:37:18,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-08-21 11:37:18,579 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:37:18,579 INFO L512 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] [2021-08-21 11:37:18,580 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:37:18,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:37:18,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1597922012, now seen corresponding path program 1 times [2021-08-21 11:37:18,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:37:18,589 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835380589] [2021-08-21 11:37:18,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:37:18,589 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:37:18,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:37:18,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:37:18,875 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:37:18,875 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835380589] [2021-08-21 11:37:18,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835380589] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:37:18,876 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:37:18,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-21 11:37:18,877 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758116551] [2021-08-21 11:37:18,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-21 11:37:18,880 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:37:18,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-21 11:37:18,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-21 11:37:18,905 INFO L87 Difference]: Start difference. First operand has 10392 states, 10389 states have (on average 3.547020887477139) internal successors, (36850), 10391 states have internal predecessors, (36850), 0 states have call successors, (0), 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 27.5) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:37:19,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:37:19,031 INFO L93 Difference]: Finished difference Result 8768 states and 30229 transitions. [2021-08-21 11:37:19,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-21 11:37:19,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 27.5) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2021-08-21 11:37:19,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:37:19,172 INFO L225 Difference]: With dead ends: 8768 [2021-08-21 11:37:19,172 INFO L226 Difference]: Without dead ends: 7200 [2021-08-21 11:37:19,173 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-21 11:37:19,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7200 states. [2021-08-21 11:37:19,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7200 to 7200. [2021-08-21 11:37:19,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7200 states, 7199 states have (on average 3.471732185025698) internal successors, (24993), 7199 states have internal predecessors, (24993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:37:19,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7200 states to 7200 states and 24993 transitions. [2021-08-21 11:37:19,601 INFO L78 Accepts]: Start accepts. Automaton has 7200 states and 24993 transitions. Word has length 55 [2021-08-21 11:37:19,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:37:19,602 INFO L470 AbstractCegarLoop]: Abstraction has 7200 states and 24993 transitions. [2021-08-21 11:37:19,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 27.5) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:37:19,603 INFO L276 IsEmpty]: Start isEmpty. Operand 7200 states and 24993 transitions. [2021-08-21 11:37:19,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-08-21 11:37:19,633 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:37:19,633 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:37:19,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-21 11:37:19,634 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:37:19,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:37:19,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1989832496, now seen corresponding path program 1 times [2021-08-21 11:37:19,635 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:37:19,635 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327207233] [2021-08-21 11:37:19,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:37:19,635 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:37:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:37:19,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:37:19,954 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:37:19,955 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327207233] [2021-08-21 11:37:19,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327207233] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:37:19,955 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:37:19,955 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-21 11:37:19,955 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658732370] [2021-08-21 11:37:19,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-21 11:37:19,956 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:37:19,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-21 11:37:19,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-21 11:37:19,957 INFO L87 Difference]: Start difference. First operand 7200 states and 24993 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:37:20,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:37:20,197 INFO L93 Difference]: Finished difference Result 8704 states and 29941 transitions. [2021-08-21 11:37:20,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-21 11:37:20,198 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-08-21 11:37:20,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:37:20,235 INFO L225 Difference]: With dead ends: 8704 [2021-08-21 11:37:20,235 INFO L226 Difference]: Without dead ends: 6912 [2021-08-21 11:37:20,236 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 163.1ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-21 11:37:20,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6912 states. [2021-08-21 11:37:20,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6912 to 6912. [2021-08-21 11:37:20,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6912 states, 6911 states have (on average 3.4549269280856607) internal successors, (23877), 6911 states have internal predecessors, (23877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:37:20,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6912 states to 6912 states and 23877 transitions. [2021-08-21 11:37:20,538 INFO L78 Accepts]: Start accepts. Automaton has 6912 states and 23877 transitions. Word has length 67 [2021-08-21 11:37:20,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:37:20,538 INFO L470 AbstractCegarLoop]: Abstraction has 6912 states and 23877 transitions. [2021-08-21 11:37:20,539 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:37:20,539 INFO L276 IsEmpty]: Start isEmpty. Operand 6912 states and 23877 transitions. [2021-08-21 11:37:20,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-08-21 11:37:20,548 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:37:20,548 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:37:20,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-21 11:37:20,549 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:37:20,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:37:20,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1351557189, now seen corresponding path program 1 times [2021-08-21 11:37:20,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:37:20,550 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744288512] [2021-08-21 11:37:20,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:37:20,550 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:37:20,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:37:20,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:37:20,931 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:37:20,931 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744288512] [2021-08-21 11:37:20,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744288512] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:37:20,931 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:37:20,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-21 11:37:20,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961053487] [2021-08-21 11:37:20,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-21 11:37:20,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:37:20,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-21 11:37:20,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-21 11:37:20,933 INFO L87 Difference]: Start difference. First operand 6912 states and 23877 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:37:21,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:37:21,557 INFO L93 Difference]: Finished difference Result 8374 states and 28693 transitions. [2021-08-21 11:37:21,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-21 11:37:21,558 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2021-08-21 11:37:21,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:37:21,602 INFO L225 Difference]: With dead ends: 8374 [2021-08-21 11:37:21,603 INFO L226 Difference]: Without dead ends: 6774 [2021-08-21 11:37:21,603 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 346.1ms TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2021-08-21 11:37:21,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6774 states. [2021-08-21 11:37:21,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6774 to 6732. [2021-08-21 11:37:21,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6732 states, 6731 states have (on average 3.4456990046055562) internal successors, (23193), 6731 states have internal predecessors, (23193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:37:21,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6732 states to 6732 states and 23193 transitions. [2021-08-21 11:37:21,883 INFO L78 Accepts]: Start accepts. Automaton has 6732 states and 23193 transitions. Word has length 69 [2021-08-21 11:37:21,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:37:21,883 INFO L470 AbstractCegarLoop]: Abstraction has 6732 states and 23193 transitions. [2021-08-21 11:37:21,883 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:37:21,884 INFO L276 IsEmpty]: Start isEmpty. Operand 6732 states and 23193 transitions. [2021-08-21 11:37:21,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-08-21 11:37:21,895 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:37:21,895 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:37:21,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-21 11:37:21,896 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:37:21,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:37:21,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1224633164, now seen corresponding path program 1 times [2021-08-21 11:37:21,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:37:21,897 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054127395] [2021-08-21 11:37:21,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:37:21,897 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:37:21,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:37:22,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:37:22,153 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:37:22,154 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054127395] [2021-08-21 11:37:22,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054127395] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:37:22,154 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:37:22,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-21 11:37:22,154 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71615548] [2021-08-21 11:37:22,154 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-21 11:37:22,154 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:37:22,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-21 11:37:22,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-21 11:37:22,155 INFO L87 Difference]: Start difference. First operand 6732 states and 23193 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:37:22,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:37:22,475 INFO L93 Difference]: Finished difference Result 7866 states and 26923 transitions. [2021-08-21 11:37:22,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-21 11:37:22,476 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-08-21 11:37:22,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:37:22,498 INFO L225 Difference]: With dead ends: 7866 [2021-08-21 11:37:22,498 INFO L226 Difference]: Without dead ends: 6746 [2021-08-21 11:37:22,499 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 272.7ms TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2021-08-21 11:37:22,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6746 states. [2021-08-21 11:37:22,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6746 to 6746. [2021-08-21 11:37:22,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6746 states, 6745 states have (on average 3.444477390659748) internal successors, (23233), 6745 states have internal predecessors, (23233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:37:22,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6746 states to 6746 states and 23233 transitions. [2021-08-21 11:37:22,664 INFO L78 Accepts]: Start accepts. Automaton has 6746 states and 23233 transitions. Word has length 70 [2021-08-21 11:37:22,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:37:22,664 INFO L470 AbstractCegarLoop]: Abstraction has 6746 states and 23233 transitions. [2021-08-21 11:37:22,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:37:22,664 INFO L276 IsEmpty]: Start isEmpty. Operand 6746 states and 23233 transitions. [2021-08-21 11:37:22,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-08-21 11:37:22,675 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:37:22,675 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:37:22,675 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-21 11:37:22,675 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:37:22,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:37:22,676 INFO L82 PathProgramCache]: Analyzing trace with hash -682704952, now seen corresponding path program 2 times [2021-08-21 11:37:22,676 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:37:22,676 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413993068] [2021-08-21 11:37:22,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:37:22,676 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:37:22,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:37:23,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:37:23,052 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:37:23,052 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413993068] [2021-08-21 11:37:23,052 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413993068] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:37:23,052 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:37:23,052 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-21 11:37:23,053 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982247653] [2021-08-21 11:37:23,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-21 11:37:23,053 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:37:23,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-21 11:37:23,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2021-08-21 11:37:23,054 INFO L87 Difference]: Start difference. First operand 6746 states and 23233 transitions. Second operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:37:23,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:37:23,421 INFO L93 Difference]: Finished difference Result 7446 states and 25443 transitions. [2021-08-21 11:37:23,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-21 11:37:23,422 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-08-21 11:37:23,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:37:23,445 INFO L225 Difference]: With dead ends: 7446 [2021-08-21 11:37:23,446 INFO L226 Difference]: Without dead ends: 6326 [2021-08-21 11:37:23,446 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 324.4ms TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2021-08-21 11:37:23,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6326 states. [2021-08-21 11:37:23,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6326 to 6312. [2021-08-21 11:37:23,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6312 states, 6311 states have (on average 3.431627317382348) internal successors, (21657), 6311 states have internal predecessors, (21657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:37:23,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6312 states to 6312 states and 21657 transitions. [2021-08-21 11:37:23,695 INFO L78 Accepts]: Start accepts. Automaton has 6312 states and 21657 transitions. Word has length 70 [2021-08-21 11:37:23,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:37:23,695 INFO L470 AbstractCegarLoop]: Abstraction has 6312 states and 21657 transitions. [2021-08-21 11:37:23,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:37:23,696 INFO L276 IsEmpty]: Start isEmpty. Operand 6312 states and 21657 transitions. [2021-08-21 11:37:23,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-08-21 11:37:23,706 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:37:23,706 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:37:23,706 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-21 11:37:23,707 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:37:23,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:37:23,707 INFO L82 PathProgramCache]: Analyzing trace with hash -808983037, now seen corresponding path program 1 times [2021-08-21 11:37:23,707 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:37:23,707 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263526224] [2021-08-21 11:37:23,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:37:23,708 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:37:23,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:37:23,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:37:23,975 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:37:23,975 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263526224] [2021-08-21 11:37:23,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263526224] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:37:23,976 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:37:23,976 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-21 11:37:23,976 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016206793] [2021-08-21 11:37:23,983 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-21 11:37:23,983 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:37:23,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-21 11:37:23,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-08-21 11:37:23,984 INFO L87 Difference]: Start difference. First operand 6312 states and 21657 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:37:24,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:37:24,291 INFO L93 Difference]: Finished difference Result 7332 states and 24943 transitions. [2021-08-21 11:37:24,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-21 11:37:24,292 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2021-08-21 11:37:24,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:37:24,313 INFO L225 Difference]: With dead ends: 7332 [2021-08-21 11:37:24,313 INFO L226 Difference]: Without dead ends: 6132 [2021-08-21 11:37:24,314 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 207.7ms TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2021-08-21 11:37:24,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6132 states. [2021-08-21 11:37:24,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6132 to 6132. [2021-08-21 11:37:24,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6132 states, 6131 states have (on average 3.4208122655358015) internal successors, (20973), 6131 states have internal predecessors, (20973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:37:24,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6132 states to 6132 states and 20973 transitions. [2021-08-21 11:37:24,461 INFO L78 Accepts]: Start accepts. Automaton has 6132 states and 20973 transitions. Word has length 71 [2021-08-21 11:37:24,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:37:24,461 INFO L470 AbstractCegarLoop]: Abstraction has 6132 states and 20973 transitions. [2021-08-21 11:37:24,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:37:24,462 INFO L276 IsEmpty]: Start isEmpty. Operand 6132 states and 20973 transitions. [2021-08-21 11:37:24,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-08-21 11:37:24,512 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:37:24,512 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:37:24,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-21 11:37:24,512 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:37:24,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:37:24,513 INFO L82 PathProgramCache]: Analyzing trace with hash 518096566, now seen corresponding path program 1 times [2021-08-21 11:37:24,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:37:24,513 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635970104] [2021-08-21 11:37:24,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:37:24,513 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:37:24,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:37:24,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:37:24,778 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:37:24,778 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635970104] [2021-08-21 11:37:24,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635970104] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:37:24,778 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:37:24,778 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-21 11:37:24,779 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488478320] [2021-08-21 11:37:24,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-21 11:37:24,779 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:37:24,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-21 11:37:24,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-08-21 11:37:24,780 INFO L87 Difference]: Start difference. First operand 6132 states and 20973 transitions. Second operand has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:37:25,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:37:25,028 INFO L93 Difference]: Finished difference Result 7420 states and 25276 transitions. [2021-08-21 11:37:25,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-21 11:37:25,028 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-08-21 11:37:25,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:37:25,045 INFO L225 Difference]: With dead ends: 7420 [2021-08-21 11:37:25,045 INFO L226 Difference]: Without dead ends: 6580 [2021-08-21 11:37:25,045 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 179.1ms TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2021-08-21 11:37:25,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6580 states. [2021-08-21 11:37:25,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6580 to 6188. [2021-08-21 11:37:25,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6188 states, 6187 states have (on average 3.414578955875222) internal successors, (21126), 6187 states have internal predecessors, (21126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:37:25,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6188 states to 6188 states and 21126 transitions. [2021-08-21 11:37:25,166 INFO L78 Accepts]: Start accepts. Automaton has 6188 states and 21126 transitions. Word has length 72 [2021-08-21 11:37:25,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:37:25,167 INFO L470 AbstractCegarLoop]: Abstraction has 6188 states and 21126 transitions. [2021-08-21 11:37:25,167 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:37:25,167 INFO L276 IsEmpty]: Start isEmpty. Operand 6188 states and 21126 transitions. [2021-08-21 11:37:25,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-08-21 11:37:25,176 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:37:25,176 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:37:25,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-21 11:37:25,177 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:37:25,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:37:25,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1060024778, now seen corresponding path program 2 times [2021-08-21 11:37:25,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:37:25,177 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333837968] [2021-08-21 11:37:25,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:37:25,177 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:37:25,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:37:25,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:37:25,516 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:37:25,516 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333837968] [2021-08-21 11:37:25,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333837968] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:37:25,516 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:37:25,516 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-21 11:37:25,516 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726513767] [2021-08-21 11:37:25,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-21 11:37:25,517 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:37:25,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-21 11:37:25,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-08-21 11:37:25,518 INFO L87 Difference]: Start difference. First operand 6188 states and 21126 transitions. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:37:25,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:37:25,891 INFO L93 Difference]: Finished difference Result 7700 states and 26237 transitions. [2021-08-21 11:37:25,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-21 11:37:25,892 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-08-21 11:37:25,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:37:25,910 INFO L225 Difference]: With dead ends: 7700 [2021-08-21 11:37:25,910 INFO L226 Difference]: Without dead ends: 6748 [2021-08-21 11:37:25,910 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 263.3ms TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2021-08-21 11:37:25,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6748 states. [2021-08-21 11:37:26,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6748 to 6524. [2021-08-21 11:37:26,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6524 states, 6523 states have (on average 3.4287904338494557) internal successors, (22366), 6523 states have internal predecessors, (22366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:37:26,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6524 states to 6524 states and 22366 transitions. [2021-08-21 11:37:26,140 INFO L78 Accepts]: Start accepts. Automaton has 6524 states and 22366 transitions. Word has length 72 [2021-08-21 11:37:26,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:37:26,141 INFO L470 AbstractCegarLoop]: Abstraction has 6524 states and 22366 transitions. [2021-08-21 11:37:26,141 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:37:26,141 INFO L276 IsEmpty]: Start isEmpty. Operand 6524 states and 22366 transitions. [2021-08-21 11:37:26,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-08-21 11:37:26,151 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:37:26,151 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:37:26,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-21 11:37:26,152 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:37:26,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:37:26,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1879252750, now seen corresponding path program 3 times [2021-08-21 11:37:26,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:37:26,153 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545646082] [2021-08-21 11:37:26,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:37:26,153 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:37:26,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:37:26,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:37:26,379 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:37:26,380 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545646082] [2021-08-21 11:37:26,380 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545646082] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:37:26,380 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:37:26,380 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-21 11:37:26,380 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235208901] [2021-08-21 11:37:26,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-21 11:37:26,381 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:37:26,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-21 11:37:26,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-08-21 11:37:26,382 INFO L87 Difference]: Start difference. First operand 6524 states and 22366 transitions. Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:37:26,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:37:26,698 INFO L93 Difference]: Finished difference Result 7392 states and 25182 transitions. [2021-08-21 11:37:26,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-21 11:37:26,699 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-08-21 11:37:26,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:37:26,715 INFO L225 Difference]: With dead ends: 7392 [2021-08-21 11:37:26,715 INFO L226 Difference]: Without dead ends: 6552 [2021-08-21 11:37:26,716 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 211.7ms TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2021-08-21 11:37:26,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6552 states. [2021-08-21 11:37:26,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6552 to 6412. [2021-08-21 11:37:26,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6412 states, 6411 states have (on average 3.4213071283731087) internal successors, (21934), 6411 states have internal predecessors, (21934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:37:26,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6412 states to 6412 states and 21934 transitions. [2021-08-21 11:37:26,843 INFO L78 Accepts]: Start accepts. Automaton has 6412 states and 21934 transitions. Word has length 72 [2021-08-21 11:37:26,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:37:26,844 INFO L470 AbstractCegarLoop]: Abstraction has 6412 states and 21934 transitions. [2021-08-21 11:37:26,844 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:37:26,844 INFO L276 IsEmpty]: Start isEmpty. Operand 6412 states and 21934 transitions. [2021-08-21 11:37:26,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-08-21 11:37:26,853 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:37:26,853 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:37:26,853 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-21 11:37:26,854 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:37:26,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:37:26,854 INFO L82 PathProgramCache]: Analyzing trace with hash -354854744, now seen corresponding path program 4 times [2021-08-21 11:37:26,854 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:37:26,854 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420302854] [2021-08-21 11:37:26,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:37:26,854 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:37:26,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:37:27,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:37:27,107 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:37:27,107 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420302854] [2021-08-21 11:37:27,107 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420302854] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:37:27,108 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:37:27,108 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-21 11:37:27,108 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687240395] [2021-08-21 11:37:27,108 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-21 11:37:27,108 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:37:27,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-21 11:37:27,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-08-21 11:37:27,109 INFO L87 Difference]: Start difference. First operand 6412 states and 21934 transitions. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:37:27,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:37:27,558 INFO L93 Difference]: Finished difference Result 8022 states and 27388 transitions. [2021-08-21 11:37:27,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-21 11:37:27,558 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-08-21 11:37:27,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:37:27,576 INFO L225 Difference]: With dead ends: 8022 [2021-08-21 11:37:27,576 INFO L226 Difference]: Without dead ends: 6958 [2021-08-21 11:37:27,577 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 322.3ms TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2021-08-21 11:37:27,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6958 states. [2021-08-21 11:37:27,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6958 to 6804. [2021-08-21 11:37:27,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6804 states, 6803 states have (on average 3.42378362487138) internal successors, (23292), 6803 states have internal predecessors, (23292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:37:27,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6804 states to 6804 states and 23292 transitions. [2021-08-21 11:37:27,757 INFO L78 Accepts]: Start accepts. Automaton has 6804 states and 23292 transitions. Word has length 72 [2021-08-21 11:37:27,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:37:27,757 INFO L470 AbstractCegarLoop]: Abstraction has 6804 states and 23292 transitions. [2021-08-21 11:37:27,757 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:37:27,758 INFO L276 IsEmpty]: Start isEmpty. Operand 6804 states and 23292 transitions. [2021-08-21 11:37:27,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-08-21 11:37:27,768 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:37:27,768 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:37:27,769 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-21 11:37:27,769 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:37:27,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:37:27,769 INFO L82 PathProgramCache]: Analyzing trace with hash 574166594, now seen corresponding path program 1 times [2021-08-21 11:37:27,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:37:27,770 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794809659] [2021-08-21 11:37:27,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:37:27,770 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:37:27,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:37:27,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:37:27,869 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:37:27,869 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794809659] [2021-08-21 11:37:27,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794809659] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:37:27,869 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:37:27,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-21 11:37:27,869 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767944981] [2021-08-21 11:37:27,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-21 11:37:27,870 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:37:27,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-21 11:37:27,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-21 11:37:27,870 INFO L87 Difference]: Start difference. First operand 6804 states and 23292 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:37:28,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:37:28,034 INFO L93 Difference]: Finished difference Result 8128 states and 27332 transitions. [2021-08-21 11:37:28,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-21 11:37:28,035 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-08-21 11:37:28,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:37:28,049 INFO L225 Difference]: With dead ends: 8128 [2021-08-21 11:37:28,050 INFO L226 Difference]: Without dead ends: 6000 [2021-08-21 11:37:28,050 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 102.3ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-21 11:37:28,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6000 states. [2021-08-21 11:37:28,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6000 to 6000. [2021-08-21 11:37:28,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6000 states, 5999 states have (on average 3.3465577596266045) internal successors, (20076), 5999 states have internal predecessors, (20076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:37:28,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6000 states to 6000 states and 20076 transitions. [2021-08-21 11:37:28,179 INFO L78 Accepts]: Start accepts. Automaton has 6000 states and 20076 transitions. Word has length 73 [2021-08-21 11:37:28,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:37:28,179 INFO L470 AbstractCegarLoop]: Abstraction has 6000 states and 20076 transitions. [2021-08-21 11:37:28,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:37:28,180 INFO L276 IsEmpty]: Start isEmpty. Operand 6000 states and 20076 transitions. [2021-08-21 11:37:28,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-08-21 11:37:28,189 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:37:28,189 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:37:28,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-21 11:37:28,190 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:37:28,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:37:28,190 INFO L82 PathProgramCache]: Analyzing trace with hash 56164405, now seen corresponding path program 1 times [2021-08-21 11:37:28,190 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:37:28,190 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359709386] [2021-08-21 11:37:28,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:37:28,191 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:37:28,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:37:28,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:37:28,315 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:37:28,315 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359709386] [2021-08-21 11:37:28,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359709386] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:37:28,318 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:37:28,318 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-21 11:37:28,318 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567964971] [2021-08-21 11:37:28,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-21 11:37:28,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:37:28,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-21 11:37:28,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-21 11:37:28,319 INFO L87 Difference]: Start difference. First operand 6000 states and 20076 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:37:28,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:37:28,509 INFO L93 Difference]: Finished difference Result 5646 states and 18322 transitions. [2021-08-21 11:37:28,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-21 11:37:28,510 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2021-08-21 11:37:28,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:37:28,518 INFO L225 Difference]: With dead ends: 5646 [2021-08-21 11:37:28,518 INFO L226 Difference]: Without dead ends: 3966 [2021-08-21 11:37:28,519 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 127.7ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-08-21 11:37:28,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3966 states. [2021-08-21 11:37:28,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3966 to 3966. [2021-08-21 11:37:28,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3966 states, 3965 states have (on average 3.18234552332913) internal successors, (12618), 3965 states have internal predecessors, (12618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:37:28,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3966 states to 3966 states and 12618 transitions. [2021-08-21 11:37:28,592 INFO L78 Accepts]: Start accepts. Automaton has 3966 states and 12618 transitions. Word has length 74 [2021-08-21 11:37:28,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:37:28,592 INFO L470 AbstractCegarLoop]: Abstraction has 3966 states and 12618 transitions. [2021-08-21 11:37:28,592 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:37:28,592 INFO L276 IsEmpty]: Start isEmpty. Operand 3966 states and 12618 transitions. [2021-08-21 11:37:28,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-08-21 11:37:28,599 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:37:28,599 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:37:28,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-21 11:37:28,599 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:37:28,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:37:28,600 INFO L82 PathProgramCache]: Analyzing trace with hash 544169228, now seen corresponding path program 1 times [2021-08-21 11:37:28,600 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:37:28,600 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924142047] [2021-08-21 11:37:28,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:37:28,600 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:37:28,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:37:28,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:37:28,710 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:37:28,710 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924142047] [2021-08-21 11:37:28,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924142047] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:37:28,711 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:37:28,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-21 11:37:28,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622077488] [2021-08-21 11:37:28,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-21 11:37:28,711 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:37:28,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-21 11:37:28,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-21 11:37:28,712 INFO L87 Difference]: Start difference. First operand 3966 states and 12618 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:37:28,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:37:28,837 INFO L93 Difference]: Finished difference Result 6144 states and 19560 transitions. [2021-08-21 11:37:28,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-21 11:37:28,838 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2021-08-21 11:37:28,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:37:28,845 INFO L225 Difference]: With dead ends: 6144 [2021-08-21 11:37:28,845 INFO L226 Difference]: Without dead ends: 3754 [2021-08-21 11:37:28,846 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 99.9ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-08-21 11:37:28,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3754 states. [2021-08-21 11:37:28,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3754 to 3484. [2021-08-21 11:37:28,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3484 states, 3483 states have (on average 3.111972437553833) internal successors, (10839), 3483 states have internal predecessors, (10839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:37:28,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3484 states to 3484 states and 10839 transitions. [2021-08-21 11:37:28,900 INFO L78 Accepts]: Start accepts. Automaton has 3484 states and 10839 transitions. Word has length 76 [2021-08-21 11:37:28,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:37:28,900 INFO L470 AbstractCegarLoop]: Abstraction has 3484 states and 10839 transitions. [2021-08-21 11:37:28,901 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:37:28,901 INFO L276 IsEmpty]: Start isEmpty. Operand 3484 states and 10839 transitions. [2021-08-21 11:37:28,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-08-21 11:37:28,908 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:37:28,908 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:37:28,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-21 11:37:28,908 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:37:28,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:37:28,908 INFO L82 PathProgramCache]: Analyzing trace with hash 294235712, now seen corresponding path program 2 times [2021-08-21 11:37:28,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:37:28,909 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658748222] [2021-08-21 11:37:28,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:37:28,909 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:37:28,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:37:29,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:37:29,013 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:37:29,013 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658748222] [2021-08-21 11:37:29,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658748222] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:37:29,014 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:37:29,014 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-21 11:37:29,014 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917998210] [2021-08-21 11:37:29,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-21 11:37:29,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:37:29,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-21 11:37:29,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-21 11:37:29,015 INFO L87 Difference]: Start difference. First operand 3484 states and 10839 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:37:29,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:37:29,156 INFO L93 Difference]: Finished difference Result 5418 states and 16693 transitions. [2021-08-21 11:37:29,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-21 11:37:29,156 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2021-08-21 11:37:29,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:37:29,163 INFO L225 Difference]: With dead ends: 5418 [2021-08-21 11:37:29,163 INFO L226 Difference]: Without dead ends: 3446 [2021-08-21 11:37:29,164 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 105.7ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-21 11:37:29,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3446 states. [2021-08-21 11:37:29,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3446 to 3134. [2021-08-21 11:37:29,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3134 states, 3133 states have (on average 3.03511011809767) internal successors, (9509), 3133 states have internal predecessors, (9509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:37:29,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 9509 transitions. [2021-08-21 11:37:29,235 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 9509 transitions. Word has length 76 [2021-08-21 11:37:29,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:37:29,235 INFO L470 AbstractCegarLoop]: Abstraction has 3134 states and 9509 transitions. [2021-08-21 11:37:29,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:37:29,236 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 9509 transitions. [2021-08-21 11:37:29,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-08-21 11:37:29,242 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:37:29,242 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:37:29,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-21 11:37:29,242 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:37:29,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:37:29,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1114272407, now seen corresponding path program 1 times [2021-08-21 11:37:29,243 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:37:29,243 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794091186] [2021-08-21 11:37:29,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:37:29,243 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:37:29,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:37:29,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:37:29,582 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:37:29,582 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794091186] [2021-08-21 11:37:29,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794091186] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:37:29,582 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:37:29,582 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-21 11:37:29,582 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480348656] [2021-08-21 11:37:29,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-21 11:37:29,582 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:37:29,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-21 11:37:29,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-08-21 11:37:29,583 INFO L87 Difference]: Start difference. First operand 3134 states and 9509 transitions. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:37:29,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:37:29,919 INFO L93 Difference]: Finished difference Result 5981 states and 18250 transitions. [2021-08-21 11:37:29,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-21 11:37:29,920 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2021-08-21 11:37:29,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:37:29,928 INFO L225 Difference]: With dead ends: 5981 [2021-08-21 11:37:29,928 INFO L226 Difference]: Without dead ends: 4661 [2021-08-21 11:37:29,929 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 279.1ms TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2021-08-21 11:37:29,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4661 states. [2021-08-21 11:37:29,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4661 to 2996. [2021-08-21 11:37:29,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2996 states, 2995 states have (on average 2.9779632721202005) internal successors, (8919), 2995 states have internal predecessors, (8919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:37:29,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2996 states to 2996 states and 8919 transitions. [2021-08-21 11:37:29,973 INFO L78 Accepts]: Start accepts. Automaton has 2996 states and 8919 transitions. Word has length 77 [2021-08-21 11:37:29,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:37:29,973 INFO L470 AbstractCegarLoop]: Abstraction has 2996 states and 8919 transitions. [2021-08-21 11:37:29,973 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:37:29,974 INFO L276 IsEmpty]: Start isEmpty. Operand 2996 states and 8919 transitions. [2021-08-21 11:37:29,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-08-21 11:37:29,977 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:37:29,977 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:37:29,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-21 11:37:29,978 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:37:29,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:37:29,978 INFO L82 PathProgramCache]: Analyzing trace with hash 84379961, now seen corresponding path program 2 times [2021-08-21 11:37:29,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:37:29,978 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288606993] [2021-08-21 11:37:29,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:37:29,979 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:37:29,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:37:30,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:37:30,093 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:37:30,093 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288606993] [2021-08-21 11:37:30,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288606993] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:37:30,093 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:37:30,093 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-21 11:37:30,093 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498330263] [2021-08-21 11:37:30,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-21 11:37:30,094 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:37:30,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-21 11:37:30,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-21 11:37:30,094 INFO L87 Difference]: Start difference. First operand 2996 states and 8919 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:37:30,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:37:30,264 INFO L93 Difference]: Finished difference Result 2348 states and 6750 transitions. [2021-08-21 11:37:30,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-21 11:37:30,265 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2021-08-21 11:37:30,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:37:30,267 INFO L225 Difference]: With dead ends: 2348 [2021-08-21 11:37:30,267 INFO L226 Difference]: Without dead ends: 795 [2021-08-21 11:37:30,267 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 133.1ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-08-21 11:37:30,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2021-08-21 11:37:30,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 795. [2021-08-21 11:37:30,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 795 states, 794 states have (on average 2.7896725440806045) internal successors, (2215), 794 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:37:30,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 2215 transitions. [2021-08-21 11:37:30,276 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 2215 transitions. Word has length 77 [2021-08-21 11:37:30,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:37:30,276 INFO L470 AbstractCegarLoop]: Abstraction has 795 states and 2215 transitions. [2021-08-21 11:37:30,276 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:37:30,276 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 2215 transitions. [2021-08-21 11:37:30,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-08-21 11:37:30,277 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:37:30,277 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:37:30,278 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-21 11:37:30,278 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:37:30,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:37:30,278 INFO L82 PathProgramCache]: Analyzing trace with hash -750457221, now seen corresponding path program 1 times [2021-08-21 11:37:30,278 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:37:30,278 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230716405] [2021-08-21 11:37:30,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:37:30,278 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:37:30,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-21 11:37:30,313 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-21 11:37:30,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-21 11:37:30,385 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-21 11:37:30,385 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-21 11:37:30,386 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-21 11:37:30,387 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-21 11:37:30,388 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-08-21 11:37:30,390 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-08-21 11:37:30,390 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-08-21 11:37:30,390 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-21 11:37:30,390 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-21 11:37:30,396 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-21 11:37:30,396 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-21 11:37:30,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.08 11:37:30 BasicIcfg [2021-08-21 11:37:30,503 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-21 11:37:30,504 INFO L168 Benchmark]: Toolchain (without parser) took 14583.58 ms. Allocated memory was 162.5 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 125.1 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 443.0 MB. Max. memory is 8.0 GB. [2021-08-21 11:37:30,504 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 162.5 MB. Free memory is still 143.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-08-21 11:37:30,505 INFO L168 Benchmark]: CACSL2BoogieTranslator took 463.66 ms. Allocated memory is still 162.5 MB. Free memory was 125.0 MB in the beginning and 132.1 MB in the end (delta: -7.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. [2021-08-21 11:37:30,505 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.88 ms. Allocated memory is still 162.5 MB. Free memory was 132.1 MB in the beginning and 129.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-08-21 11:37:30,506 INFO L168 Benchmark]: Boogie Preprocessor took 33.40 ms. Allocated memory is still 162.5 MB. Free memory was 129.1 MB in the beginning and 127.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-21 11:37:30,506 INFO L168 Benchmark]: RCFGBuilder took 1752.82 ms. Allocated memory was 162.5 MB in the beginning and 196.1 MB in the end (delta: 33.6 MB). Free memory was 127.0 MB in the beginning and 171.5 MB in the end (delta: -44.5 MB). Peak memory consumption was 93.2 MB. Max. memory is 8.0 GB. [2021-08-21 11:37:30,507 INFO L168 Benchmark]: TraceAbstraction took 12254.58 ms. Allocated memory was 196.1 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 170.9 MB in the beginning and 1.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 454.6 MB. Max. memory is 8.0 GB. [2021-08-21 11:37:30,508 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.14 ms. Allocated memory is still 162.5 MB. Free memory is still 143.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 463.66 ms. Allocated memory is still 162.5 MB. Free memory was 125.0 MB in the beginning and 132.1 MB in the end (delta: -7.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 74.88 ms. Allocated memory is still 162.5 MB. Free memory was 132.1 MB in the beginning and 129.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 33.40 ms. Allocated memory is still 162.5 MB. Free memory was 129.1 MB in the beginning and 127.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1752.82 ms. Allocated memory was 162.5 MB in the beginning and 196.1 MB in the end (delta: 33.6 MB). Free memory was 127.0 MB in the beginning and 171.5 MB in the end (delta: -44.5 MB). Peak memory consumption was 93.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 12254.58 ms. Allocated memory was 196.1 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 170.9 MB in the beginning and 1.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 454.6 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L712] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L713] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L715] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L718] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L719] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L720] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L721] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L722] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L723] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L724] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L725] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L726] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L727] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L728] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L729] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L730] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L731] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L732] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L733] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L735] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 0 pthread_t t1510; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t1510, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 0 pthread_t t1511; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t1511, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 0 pthread_t t1512; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L818] FCALL, FORK 0 pthread_create(&t1512, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L776] 3 y$w_buff1 = y$w_buff0 [L777] 3 y$w_buff0 = 2 [L778] 3 y$w_buff1_used = y$w_buff0_used [L779] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L741] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 2 x = 2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L762] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L762] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L763] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L764] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L765] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L765] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L766] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) [L843] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 818]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 131 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 12065.9ms, OverallIterations: 17, TraceHistogramMax: 1, EmptinessCheckTime: 235.0ms, AutomataDifference: 4954.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 206.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2264 SDtfs, 3368 SDslu, 8823 SDs, 0 SdLazy, 1148 SolverSat, 220 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1411.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 228 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 3143.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=10392occurred in iteration=0, InterpolantAutomatonStates: 174, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 2598.7ms AutomataMinimizationTime, 16 MinimizatonAttempts, 3213 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 51.6ms SsaConstructionTime, 470.0ms SatisfiabilityAnalysisTime, 3255.8ms InterpolantComputationTime, 1224 NumberOfCodeBlocks, 1224 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1127 ConstructedInterpolants, 0 QuantifiedInterpolants, 5672 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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! [2021-08-21 11:37:30,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...