/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/safe011_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2cf4d3f9dd5fed411db405f577e28237a543b59a-2cf4d3f [2021-08-12 17:20:07,286 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-12 17:20:07,288 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-12 17:20:07,322 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-12 17:20:07,322 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-12 17:20:07,324 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-12 17:20:07,326 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-12 17:20:07,330 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-12 17:20:07,332 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-12 17:20:07,335 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-12 17:20:07,336 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-12 17:20:07,336 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-12 17:20:07,337 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-12 17:20:07,338 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-12 17:20:07,339 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-12 17:20:07,342 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-12 17:20:07,345 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-12 17:20:07,345 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-12 17:20:07,347 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-12 17:20:07,359 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-12 17:20:07,360 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-12 17:20:07,365 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-12 17:20:07,365 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-12 17:20:07,366 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-12 17:20:07,367 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-12 17:20:07,368 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-12 17:20:07,368 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-12 17:20:07,368 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-12 17:20:07,368 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-12 17:20:07,369 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-12 17:20:07,369 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-12 17:20:07,370 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-12 17:20:07,370 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-12 17:20:07,370 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-12 17:20:07,371 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-12 17:20:07,371 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-12 17:20:07,372 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-12 17:20:07,372 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-12 17:20:07,372 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-12 17:20:07,372 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-12 17:20:07,373 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-12 17:20:07,374 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-12 17:20:07,389 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-12 17:20:07,389 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-12 17:20:07,389 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-12 17:20:07,389 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-12 17:20:07,390 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-12 17:20:07,390 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-12 17:20:07,390 INFO L138 SettingsManager]: * Use SBE=true [2021-08-12 17:20:07,390 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-12 17:20:07,391 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-12 17:20:07,391 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-12 17:20:07,391 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-12 17:20:07,391 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-12 17:20:07,391 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-12 17:20:07,391 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-12 17:20:07,391 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-12 17:20:07,392 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-12 17:20:07,392 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-12 17:20:07,392 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-12 17:20:07,392 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-12 17:20:07,392 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-12 17:20:07,392 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-12 17:20:07,392 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-12 17:20:07,393 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-12 17:20:07,393 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-12 17:20:07,393 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-12 17:20:07,393 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-12 17:20:07,393 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-12 17:20:07,393 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-12 17:20:07,393 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-12 17:20:07,394 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-12 17:20:07,394 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-12 17:20:07,628 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-12 17:20:07,642 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-12 17:20:07,644 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-12 17:20:07,644 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-12 17:20:07,645 INFO L275 PluginConnector]: CDTParser initialized [2021-08-12 17:20:07,645 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_power.oepc.i [2021-08-12 17:20:07,688 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca13478ea/971e4c72e0f7404a814c60c91504dd08/FLAGb01b1f5c2 [2021-08-12 17:20:08,102 INFO L306 CDTParser]: Found 1 translation units. [2021-08-12 17:20:08,103 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.oepc.i [2021-08-12 17:20:08,118 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca13478ea/971e4c72e0f7404a814c60c91504dd08/FLAGb01b1f5c2 [2021-08-12 17:20:08,436 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca13478ea/971e4c72e0f7404a814c60c91504dd08 [2021-08-12 17:20:08,438 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-12 17:20:08,439 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-12 17:20:08,442 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-12 17:20:08,443 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-12 17:20:08,445 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-12 17:20:08,445 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.08 05:20:08" (1/1) ... [2021-08-12 17:20:08,446 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bbdb69e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:20:08, skipping insertion in model container [2021-08-12 17:20:08,447 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.08 05:20:08" (1/1) ... [2021-08-12 17:20:08,451 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-12 17:20:08,487 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-12 17:20:08,579 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.oepc.i[952,965] [2021-08-12 17:20:08,764 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-12 17:20:08,773 INFO L203 MainTranslator]: Completed pre-run [2021-08-12 17:20:08,782 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.oepc.i[952,965] [2021-08-12 17:20:08,825 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-12 17:20:08,869 INFO L208 MainTranslator]: Completed translation [2021-08-12 17:20:08,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:20:08 WrapperNode [2021-08-12 17:20:08,870 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-12 17:20:08,870 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-12 17:20:08,874 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-12 17:20:08,874 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-12 17:20:08,880 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:20:08" (1/1) ... [2021-08-12 17:20:08,904 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:20:08" (1/1) ... [2021-08-12 17:20:08,922 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-12 17:20:08,922 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-12 17:20:08,922 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-12 17:20:08,927 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-12 17:20:08,932 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:20:08" (1/1) ... [2021-08-12 17:20:08,933 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:20:08" (1/1) ... [2021-08-12 17:20:08,941 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:20:08" (1/1) ... [2021-08-12 17:20:08,941 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:20:08" (1/1) ... [2021-08-12 17:20:08,947 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:20:08" (1/1) ... [2021-08-12 17:20:08,949 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:20:08" (1/1) ... [2021-08-12 17:20:08,951 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:20:08" (1/1) ... [2021-08-12 17:20:08,953 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-12 17:20:08,954 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-12 17:20:08,954 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-12 17:20:08,954 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-12 17:20:08,954 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:20:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-12 17:20:09,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-12 17:20:09,039 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-12 17:20:09,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-12 17:20:09,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-12 17:20:09,040 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-12 17:20:09,040 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-12 17:20:09,041 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-12 17:20:09,041 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-12 17:20:09,041 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-08-12 17:20:09,041 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-08-12 17:20:09,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-12 17:20:09,041 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-12 17:20:09,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-12 17:20:09,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-12 17:20:09,043 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-12 17:20:10,398 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-12 17:20:10,399 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-12 17:20:10,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.08 05:20:10 BoogieIcfgContainer [2021-08-12 17:20:10,400 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-12 17:20:10,401 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-12 17:20:10,401 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-12 17:20:10,403 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-12 17:20:10,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.08 05:20:08" (1/3) ... [2021-08-12 17:20:10,403 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45b0f806 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.08 05:20:10, skipping insertion in model container [2021-08-12 17:20:10,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:20:08" (2/3) ... [2021-08-12 17:20:10,404 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45b0f806 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.08 05:20:10, skipping insertion in model container [2021-08-12 17:20:10,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.08 05:20:10" (3/3) ... [2021-08-12 17:20:10,405 INFO L111 eAbstractionObserver]: Analyzing ICFG safe011_power.oepc.i [2021-08-12 17:20:10,409 INFO L206 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-12 17:20:10,409 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-12 17:20:10,409 INFO L445 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-12 17:20:10,429 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,429 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,429 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,429 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,429 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,429 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,429 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,429 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,430 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,430 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,430 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,430 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,430 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,430 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,430 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,430 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,430 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,430 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,431 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,431 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,431 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,431 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,431 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,431 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,431 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,431 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,431 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,431 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,432 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,432 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,432 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,432 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,432 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,432 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,432 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,433 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,433 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,433 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,433 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,433 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,433 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,433 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,433 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,433 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,433 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,433 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,434 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,434 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,434 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,434 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,434 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,434 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,434 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,434 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,434 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,434 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,435 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,435 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,435 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,435 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,435 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,435 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,435 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,435 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,436 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,436 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,438 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,438 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,438 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,438 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,439 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,439 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,439 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,439 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,439 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,440 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,440 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,440 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,440 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,440 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,440 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,440 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,441 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,441 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,442 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,442 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,442 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,442 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,442 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,442 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,442 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,442 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,444 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,444 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:20:10,445 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-12 17:20:10,458 INFO L255 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-08-12 17:20:10,470 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-08-12 17:20:10,471 INFO L379 AbstractCegarLoop]: Hoare is true [2021-08-12 17:20:10,471 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-08-12 17:20:10,471 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-12 17:20:10,471 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-12 17:20:10,471 INFO L383 AbstractCegarLoop]: Difference is false [2021-08-12 17:20:10,471 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-12 17:20:10,471 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-08-12 17:20:10,484 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 114 places, 106 transitions, 227 flow [2021-08-12 17:20:11,368 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 16158 states, 16154 states have (on average 3.63495109570385) internal successors, (58719), 16157 states have internal predecessors, (58719), 0 states have call successors, (0), 0 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-12 17:20:11,419 INFO L276 IsEmpty]: Start isEmpty. Operand has 16158 states, 16154 states have (on average 3.63495109570385) internal successors, (58719), 16157 states have internal predecessors, (58719), 0 states have call successors, (0), 0 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-12 17:20:11,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-08-12 17:20:11,470 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:20:11,471 INFO L550 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] [2021-08-12 17:20:11,471 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:20:11,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:20:11,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1091169302, now seen corresponding path program 1 times [2021-08-12 17:20:11,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:20:11,489 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695577820] [2021-08-12 17:20:11,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:20:11,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:20:11,649 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-12 17:20:11,649 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:20:11,649 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695577820] [2021-08-12 17:20:11,650 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695577820] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:20:11,650 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:20:11,650 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-12 17:20:11,650 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214883505] [2021-08-12 17:20:11,653 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-08-12 17:20:11,653 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:20:11,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-12 17:20:11,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-12 17:20:11,693 INFO L87 Difference]: Start difference. First operand has 16158 states, 16154 states have (on average 3.63495109570385) internal successors, (58719), 16157 states have internal predecessors, (58719), 0 states have call successors, (0), 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 20.5) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 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-12 17:20:12,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:20:12,238 INFO L93 Difference]: Finished difference Result 25374 states and 93279 transitions. [2021-08-12 17:20:12,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-12 17:20:12,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2021-08-12 17:20:12,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:20:12,343 INFO L225 Difference]: With dead ends: 25374 [2021-08-12 17:20:12,343 INFO L226 Difference]: Without dead ends: 8223 [2021-08-12 17:20:12,370 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-12 17:20:12,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8223 states. [2021-08-12 17:20:12,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8223 to 8223. [2021-08-12 17:20:12,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8223 states, 8222 states have (on average 3.4911213816589637) internal successors, (28704), 8222 states have internal predecessors, (28704), 0 states have call successors, (0), 0 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-12 17:20:12,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8223 states to 8223 states and 28704 transitions. [2021-08-12 17:20:12,734 INFO L78 Accepts]: Start accepts. Automaton has 8223 states and 28704 transitions. Word has length 41 [2021-08-12 17:20:12,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:20:12,736 INFO L482 AbstractCegarLoop]: Abstraction has 8223 states and 28704 transitions. [2021-08-12 17:20:12,736 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 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-12 17:20:12,737 INFO L276 IsEmpty]: Start isEmpty. Operand 8223 states and 28704 transitions. [2021-08-12 17:20:12,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-08-12 17:20:12,751 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:20:12,751 INFO L550 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-12 17:20:12,751 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-12 17:20:12,751 INFO L430 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:20:12,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:20:12,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1685543287, now seen corresponding path program 1 times [2021-08-12 17:20:12,754 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:20:12,755 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305555618] [2021-08-12 17:20:12,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:20:12,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:20:12,946 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-12 17:20:12,946 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:20:12,946 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305555618] [2021-08-12 17:20:12,946 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305555618] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:20:12,947 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:20:12,947 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-12 17:20:12,947 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144074998] [2021-08-12 17:20:12,949 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-12 17:20:12,949 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:20:12,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-12 17:20:12,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-12 17:20:12,951 INFO L87 Difference]: Start difference. First operand 8223 states and 28704 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-12 17:20:13,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:20:13,313 INFO L93 Difference]: Finished difference Result 10527 states and 36576 transitions. [2021-08-12 17:20:13,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-12 17:20:13,314 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-08-12 17:20:13,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:20:13,368 INFO L225 Difference]: With dead ends: 10527 [2021-08-12 17:20:13,369 INFO L226 Difference]: Without dead ends: 7455 [2021-08-12 17:20:13,377 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 67.7ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-12 17:20:13,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7455 states. [2021-08-12 17:20:13,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7455 to 7455. [2021-08-12 17:20:13,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7455 states, 7454 states have (on average 3.464448618191575) internal successors, (25824), 7454 states have internal predecessors, (25824), 0 states have call successors, (0), 0 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-12 17:20:13,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7455 states to 7455 states and 25824 transitions. [2021-08-12 17:20:13,617 INFO L78 Accepts]: Start accepts. Automaton has 7455 states and 25824 transitions. Word has length 67 [2021-08-12 17:20:13,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:20:13,618 INFO L482 AbstractCegarLoop]: Abstraction has 7455 states and 25824 transitions. [2021-08-12 17:20:13,618 INFO L483 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-12 17:20:13,618 INFO L276 IsEmpty]: Start isEmpty. Operand 7455 states and 25824 transitions. [2021-08-12 17:20:13,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-08-12 17:20:13,631 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:20:13,631 INFO L550 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-12 17:20:13,631 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-12 17:20:13,631 INFO L430 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:20:13,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:20:13,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1808289174, now seen corresponding path program 1 times [2021-08-12 17:20:13,637 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:20:13,638 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98002168] [2021-08-12 17:20:13,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:20:13,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:20:13,795 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-12 17:20:13,796 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:20:13,796 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98002168] [2021-08-12 17:20:13,796 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98002168] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:20:13,796 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:20:13,796 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-12 17:20:13,798 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436347694] [2021-08-12 17:20:13,798 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-12 17:20:13,799 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:20:13,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-12 17:20:13,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-12 17:20:13,803 INFO L87 Difference]: Start difference. First operand 7455 states and 25824 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 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-12 17:20:14,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:20:14,097 INFO L93 Difference]: Finished difference Result 9543 states and 32904 transitions. [2021-08-12 17:20:14,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-12 17:20:14,098 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 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-12 17:20:14,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:20:14,136 INFO L225 Difference]: With dead ends: 9543 [2021-08-12 17:20:14,136 INFO L226 Difference]: Without dead ends: 7239 [2021-08-12 17:20:14,143 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 67.5ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-12 17:20:14,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7239 states. [2021-08-12 17:20:14,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7239 to 7239. [2021-08-12 17:20:14,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7239 states, 7238 states have (on average 3.453440176844432) internal successors, (24996), 7238 states have internal predecessors, (24996), 0 states have call successors, (0), 0 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-12 17:20:14,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7239 states to 7239 states and 24996 transitions. [2021-08-12 17:20:14,411 INFO L78 Accepts]: Start accepts. Automaton has 7239 states and 24996 transitions. Word has length 69 [2021-08-12 17:20:14,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:20:14,412 INFO L482 AbstractCegarLoop]: Abstraction has 7239 states and 24996 transitions. [2021-08-12 17:20:14,412 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 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-12 17:20:14,412 INFO L276 IsEmpty]: Start isEmpty. Operand 7239 states and 24996 transitions. [2021-08-12 17:20:14,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-08-12 17:20:14,422 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:20:14,422 INFO L550 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-12 17:20:14,422 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-12 17:20:14,422 INFO L430 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:20:14,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:20:14,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1248901623, now seen corresponding path program 1 times [2021-08-12 17:20:14,423 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:20:14,423 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862544047] [2021-08-12 17:20:14,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:20:14,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:20:14,554 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-12 17:20:14,554 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:20:14,555 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862544047] [2021-08-12 17:20:14,555 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862544047] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:20:14,555 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:20:14,555 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-12 17:20:14,555 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047249139] [2021-08-12 17:20:14,555 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-12 17:20:14,555 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:20:14,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-12 17:20:14,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-12 17:20:14,556 INFO L87 Difference]: Start difference. First operand 7239 states and 24996 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 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-12 17:20:14,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:20:14,862 INFO L93 Difference]: Finished difference Result 10839 states and 37386 transitions. [2021-08-12 17:20:14,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-12 17:20:14,863 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 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-12 17:20:14,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:20:14,896 INFO L225 Difference]: With dead ends: 10839 [2021-08-12 17:20:14,896 INFO L226 Difference]: Without dead ends: 5295 [2021-08-12 17:20:14,904 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 97.7ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-08-12 17:20:14,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5295 states. [2021-08-12 17:20:15,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5295 to 5295. [2021-08-12 17:20:15,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5295 states, 5294 states have (on average 3.3513411409142426) internal successors, (17742), 5294 states have internal predecessors, (17742), 0 states have call successors, (0), 0 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-12 17:20:15,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5295 states to 5295 states and 17742 transitions. [2021-08-12 17:20:15,077 INFO L78 Accepts]: Start accepts. Automaton has 5295 states and 17742 transitions. Word has length 71 [2021-08-12 17:20:15,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:20:15,077 INFO L482 AbstractCegarLoop]: Abstraction has 5295 states and 17742 transitions. [2021-08-12 17:20:15,077 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 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-12 17:20:15,077 INFO L276 IsEmpty]: Start isEmpty. Operand 5295 states and 17742 transitions. [2021-08-12 17:20:15,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-08-12 17:20:15,086 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:20:15,086 INFO L550 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-12 17:20:15,086 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-12 17:20:15,086 INFO L430 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:20:15,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:20:15,087 INFO L82 PathProgramCache]: Analyzing trace with hash -237206411, now seen corresponding path program 1 times [2021-08-12 17:20:15,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:20:15,087 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617372815] [2021-08-12 17:20:15,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:20:15,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:20:15,265 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-12 17:20:15,265 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:20:15,265 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617372815] [2021-08-12 17:20:15,265 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617372815] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:20:15,266 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:20:15,266 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-12 17:20:15,266 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466390896] [2021-08-12 17:20:15,267 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-08-12 17:20:15,267 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:20:15,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-12 17:20:15,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-08-12 17:20:15,268 INFO L87 Difference]: Start difference. First operand 5295 states and 17742 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-12 17:20:15,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:20:15,667 INFO L93 Difference]: Finished difference Result 6997 states and 23454 transitions. [2021-08-12 17:20:15,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-12 17:20:15,668 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-12 17:20:15,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:20:15,692 INFO L225 Difference]: With dead ends: 6997 [2021-08-12 17:20:15,693 INFO L226 Difference]: Without dead ends: 5525 [2021-08-12 17:20:15,695 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 193.9ms TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2021-08-12 17:20:15,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5525 states. [2021-08-12 17:20:15,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5525 to 5235. [2021-08-12 17:20:15,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5235 states, 5234 states have (on average 3.34619793656859) internal successors, (17514), 5234 states have internal predecessors, (17514), 0 states have call successors, (0), 0 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-12 17:20:15,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5235 states to 5235 states and 17514 transitions. [2021-08-12 17:20:15,810 INFO L78 Accepts]: Start accepts. Automaton has 5235 states and 17514 transitions. Word has length 72 [2021-08-12 17:20:15,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:20:15,810 INFO L482 AbstractCegarLoop]: Abstraction has 5235 states and 17514 transitions. [2021-08-12 17:20:15,810 INFO L483 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-12 17:20:15,810 INFO L276 IsEmpty]: Start isEmpty. Operand 5235 states and 17514 transitions. [2021-08-12 17:20:15,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-08-12 17:20:15,818 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:20:15,818 INFO L550 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-12 17:20:15,818 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-12 17:20:15,818 INFO L430 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:20:15,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:20:15,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1067583572, now seen corresponding path program 1 times [2021-08-12 17:20:15,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:20:15,818 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128101561] [2021-08-12 17:20:15,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:20:15,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:20:15,926 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-12 17:20:15,926 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:20:15,926 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128101561] [2021-08-12 17:20:15,927 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128101561] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:20:15,927 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:20:15,927 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-12 17:20:15,927 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055472395] [2021-08-12 17:20:15,927 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-08-12 17:20:15,927 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:20:15,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-12 17:20:15,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-08-12 17:20:15,928 INFO L87 Difference]: Start difference. First operand 5235 states and 17514 transitions. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 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-12 17:20:16,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:20:16,343 INFO L93 Difference]: Finished difference Result 6527 states and 21828 transitions. [2021-08-12 17:20:16,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-12 17:20:16,344 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 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-12 17:20:16,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:20:16,375 INFO L225 Difference]: With dead ends: 6527 [2021-08-12 17:20:16,376 INFO L226 Difference]: Without dead ends: 5295 [2021-08-12 17:20:16,379 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 177.1ms TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2021-08-12 17:20:16,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5295 states. [2021-08-12 17:20:16,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5295 to 5295. [2021-08-12 17:20:16,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5295 states, 5294 states have (on average 3.34869663770306) internal successors, (17728), 5294 states have internal predecessors, (17728), 0 states have call successors, (0), 0 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-12 17:20:16,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5295 states to 5295 states and 17728 transitions. [2021-08-12 17:20:16,549 INFO L78 Accepts]: Start accepts. Automaton has 5295 states and 17728 transitions. Word has length 73 [2021-08-12 17:20:16,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:20:16,549 INFO L482 AbstractCegarLoop]: Abstraction has 5295 states and 17728 transitions. [2021-08-12 17:20:16,550 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 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-12 17:20:16,550 INFO L276 IsEmpty]: Start isEmpty. Operand 5295 states and 17728 transitions. [2021-08-12 17:20:16,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-08-12 17:20:16,558 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:20:16,558 INFO L550 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-12 17:20:16,558 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-12 17:20:16,558 INFO L430 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:20:16,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:20:16,559 INFO L82 PathProgramCache]: Analyzing trace with hash 2056322931, now seen corresponding path program 1 times [2021-08-12 17:20:16,559 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:20:16,559 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799783124] [2021-08-12 17:20:16,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:20:16,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:20:16,705 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-12 17:20:16,706 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:20:16,706 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799783124] [2021-08-12 17:20:16,706 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799783124] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:20:16,706 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:20:16,706 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-12 17:20:16,706 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044131546] [2021-08-12 17:20:16,706 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-08-12 17:20:16,706 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:20:16,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-12 17:20:16,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-08-12 17:20:16,707 INFO L87 Difference]: Start difference. First operand 5295 states and 17728 transitions. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 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-12 17:20:17,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:20:17,187 INFO L93 Difference]: Finished difference Result 6411 states and 21414 transitions. [2021-08-12 17:20:17,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-12 17:20:17,188 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 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-12 17:20:17,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:20:17,224 INFO L225 Difference]: With dead ends: 6411 [2021-08-12 17:20:17,224 INFO L226 Difference]: Without dead ends: 5331 [2021-08-12 17:20:17,228 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 238.1ms TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2021-08-12 17:20:17,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5331 states. [2021-08-12 17:20:17,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5331 to 5331. [2021-08-12 17:20:17,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5331 states, 5330 states have (on average 3.348217636022514) internal successors, (17846), 5330 states have internal predecessors, (17846), 0 states have call successors, (0), 0 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-12 17:20:17,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5331 states to 5331 states and 17846 transitions. [2021-08-12 17:20:17,423 INFO L78 Accepts]: Start accepts. Automaton has 5331 states and 17846 transitions. Word has length 74 [2021-08-12 17:20:17,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:20:17,424 INFO L482 AbstractCegarLoop]: Abstraction has 5331 states and 17846 transitions. [2021-08-12 17:20:17,424 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 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-12 17:20:17,424 INFO L276 IsEmpty]: Start isEmpty. Operand 5331 states and 17846 transitions. [2021-08-12 17:20:17,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-08-12 17:20:17,431 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:20:17,431 INFO L550 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-12 17:20:17,431 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-12 17:20:17,431 INFO L430 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:20:17,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:20:17,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1139599989, now seen corresponding path program 2 times [2021-08-12 17:20:17,432 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:20:17,432 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333946620] [2021-08-12 17:20:17,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:20:17,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:20:17,560 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-12 17:20:17,560 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:20:17,560 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333946620] [2021-08-12 17:20:17,560 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333946620] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:20:17,560 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:20:17,561 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-12 17:20:17,561 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658302864] [2021-08-12 17:20:17,561 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-08-12 17:20:17,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:20:17,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-12 17:20:17,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-08-12 17:20:17,561 INFO L87 Difference]: Start difference. First operand 5331 states and 17846 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 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-12 17:20:17,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:20:17,800 INFO L93 Difference]: Finished difference Result 6399 states and 21364 transitions. [2021-08-12 17:20:17,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-12 17:20:17,801 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 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-12 17:20:17,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:20:17,833 INFO L225 Difference]: With dead ends: 6399 [2021-08-12 17:20:17,833 INFO L226 Difference]: Without dead ends: 5319 [2021-08-12 17:20:17,837 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 121.3ms TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-08-12 17:20:17,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5319 states. [2021-08-12 17:20:17,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5319 to 5319. [2021-08-12 17:20:17,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5319 states, 5318 states have (on average 3.3467468973298233) internal successors, (17798), 5318 states have internal predecessors, (17798), 0 states have call successors, (0), 0 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-12 17:20:17,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5319 states to 5319 states and 17798 transitions. [2021-08-12 17:20:17,977 INFO L78 Accepts]: Start accepts. Automaton has 5319 states and 17798 transitions. Word has length 74 [2021-08-12 17:20:17,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:20:17,978 INFO L482 AbstractCegarLoop]: Abstraction has 5319 states and 17798 transitions. [2021-08-12 17:20:17,978 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 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-12 17:20:17,978 INFO L276 IsEmpty]: Start isEmpty. Operand 5319 states and 17798 transitions. [2021-08-12 17:20:17,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-08-12 17:20:17,985 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:20:17,985 INFO L550 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-12 17:20:17,985 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-12 17:20:17,985 INFO L430 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:20:17,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:20:17,986 INFO L82 PathProgramCache]: Analyzing trace with hash 468080022, now seen corresponding path program 1 times [2021-08-12 17:20:17,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:20:17,986 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157992456] [2021-08-12 17:20:17,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:20:18,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:20:18,118 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-12 17:20:18,119 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:20:18,119 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157992456] [2021-08-12 17:20:18,119 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157992456] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:20:18,119 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:20:18,119 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-12 17:20:18,119 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724551662] [2021-08-12 17:20:18,119 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-08-12 17:20:18,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:20:18,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-12 17:20:18,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-08-12 17:20:18,120 INFO L87 Difference]: Start difference. First operand 5319 states and 17798 transitions. Second operand has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 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-12 17:20:18,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:20:18,433 INFO L93 Difference]: Finished difference Result 6183 states and 20606 transitions. [2021-08-12 17:20:18,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-12 17:20:18,434 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 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-12 17:20:18,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:20:18,465 INFO L225 Difference]: With dead ends: 6183 [2021-08-12 17:20:18,465 INFO L226 Difference]: Without dead ends: 5031 [2021-08-12 17:20:18,469 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 156.7ms TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2021-08-12 17:20:18,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5031 states. [2021-08-12 17:20:18,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5031 to 4959. [2021-08-12 17:20:18,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4959 states, 4958 states have (on average 3.328761597418314) internal successors, (16504), 4958 states have internal predecessors, (16504), 0 states have call successors, (0), 0 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-12 17:20:18,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4959 states to 4959 states and 16504 transitions. [2021-08-12 17:20:18,637 INFO L78 Accepts]: Start accepts. Automaton has 4959 states and 16504 transitions. Word has length 74 [2021-08-12 17:20:18,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:20:18,638 INFO L482 AbstractCegarLoop]: Abstraction has 4959 states and 16504 transitions. [2021-08-12 17:20:18,638 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 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-12 17:20:18,638 INFO L276 IsEmpty]: Start isEmpty. Operand 4959 states and 16504 transitions. [2021-08-12 17:20:18,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-08-12 17:20:18,645 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:20:18,645 INFO L550 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] [2021-08-12 17:20:18,645 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-12 17:20:18,646 INFO L430 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:20:18,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:20:18,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1588688614, now seen corresponding path program 1 times [2021-08-12 17:20:18,646 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:20:18,646 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250022485] [2021-08-12 17:20:18,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:20:18,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:20:18,859 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-12 17:20:18,859 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:20:18,859 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250022485] [2021-08-12 17:20:18,859 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250022485] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:20:18,860 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:20:18,860 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-12 17:20:18,860 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100255715] [2021-08-12 17:20:18,860 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-08-12 17:20:18,860 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:20:18,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-12 17:20:18,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-08-12 17:20:18,860 INFO L87 Difference]: Start difference. First operand 4959 states and 16504 transitions. Second operand has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-12 17:20:19,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:20:19,199 INFO L93 Difference]: Finished difference Result 5775 states and 19140 transitions. [2021-08-12 17:20:19,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-12 17:20:19,200 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2021-08-12 17:20:19,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:20:19,229 INFO L225 Difference]: With dead ends: 5775 [2021-08-12 17:20:19,229 INFO L226 Difference]: Without dead ends: 4911 [2021-08-12 17:20:19,232 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 234.6ms TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2021-08-12 17:20:19,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4911 states. [2021-08-12 17:20:19,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4911 to 4911. [2021-08-12 17:20:19,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4911 states, 4910 states have (on average 3.324643584521385) internal successors, (16324), 4910 states have internal predecessors, (16324), 0 states have call successors, (0), 0 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-12 17:20:19,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4911 states to 4911 states and 16324 transitions. [2021-08-12 17:20:19,359 INFO L78 Accepts]: Start accepts. Automaton has 4911 states and 16324 transitions. Word has length 75 [2021-08-12 17:20:19,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:20:19,359 INFO L482 AbstractCegarLoop]: Abstraction has 4911 states and 16324 transitions. [2021-08-12 17:20:19,359 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-12 17:20:19,359 INFO L276 IsEmpty]: Start isEmpty. Operand 4911 states and 16324 transitions. [2021-08-12 17:20:19,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-08-12 17:20:19,366 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:20:19,366 INFO L550 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] [2021-08-12 17:20:19,366 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-12 17:20:19,367 INFO L430 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:20:19,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:20:19,367 INFO L82 PathProgramCache]: Analyzing trace with hash 63554272, now seen corresponding path program 1 times [2021-08-12 17:20:19,367 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:20:19,367 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373214183] [2021-08-12 17:20:19,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:20:19,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:20:19,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:20:19,490 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:20:19,490 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373214183] [2021-08-12 17:20:19,490 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373214183] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:20:19,491 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:20:19,491 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-12 17:20:19,491 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941439908] [2021-08-12 17:20:19,491 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-08-12 17:20:19,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:20:19,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-12 17:20:19,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-08-12 17:20:19,491 INFO L87 Difference]: Start difference. First operand 4911 states and 16324 transitions. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-12 17:20:19,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:20:19,851 INFO L93 Difference]: Finished difference Result 5991 states and 19930 transitions. [2021-08-12 17:20:19,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-12 17:20:19,852 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2021-08-12 17:20:19,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:20:19,881 INFO L225 Difference]: With dead ends: 5991 [2021-08-12 17:20:19,881 INFO L226 Difference]: Without dead ends: 5059 [2021-08-12 17:20:19,884 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 154.4ms TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2021-08-12 17:20:19,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5059 states. [2021-08-12 17:20:20,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5059 to 5041. [2021-08-12 17:20:20,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5041 states, 5040 states have (on average 3.3313492063492065) internal successors, (16790), 5040 states have internal predecessors, (16790), 0 states have call successors, (0), 0 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-12 17:20:20,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5041 states to 5041 states and 16790 transitions. [2021-08-12 17:20:20,074 INFO L78 Accepts]: Start accepts. Automaton has 5041 states and 16790 transitions. Word has length 75 [2021-08-12 17:20:20,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:20:20,075 INFO L482 AbstractCegarLoop]: Abstraction has 5041 states and 16790 transitions. [2021-08-12 17:20:20,075 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-12 17:20:20,075 INFO L276 IsEmpty]: Start isEmpty. Operand 5041 states and 16790 transitions. [2021-08-12 17:20:20,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-08-12 17:20:20,082 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:20:20,083 INFO L550 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] [2021-08-12 17:20:20,083 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-12 17:20:20,083 INFO L430 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:20:20,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:20:20,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1096641518, now seen corresponding path program 2 times [2021-08-12 17:20:20,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:20:20,083 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738080830] [2021-08-12 17:20:20,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:20:20,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:20:20,262 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-12 17:20:20,262 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:20:20,262 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738080830] [2021-08-12 17:20:20,265 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738080830] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:20:20,265 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:20:20,265 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-12 17:20:20,265 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753559088] [2021-08-12 17:20:20,265 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-08-12 17:20:20,265 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:20:20,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-12 17:20:20,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-08-12 17:20:20,266 INFO L87 Difference]: Start difference. First operand 5041 states and 16790 transitions. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-12 17:20:20,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:20:20,738 INFO L93 Difference]: Finished difference Result 6421 states and 21425 transitions. [2021-08-12 17:20:20,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-12 17:20:20,738 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2021-08-12 17:20:20,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:20:20,768 INFO L225 Difference]: With dead ends: 6421 [2021-08-12 17:20:20,768 INFO L226 Difference]: Without dead ends: 5409 [2021-08-12 17:20:20,772 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 256.2ms TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2021-08-12 17:20:20,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5409 states. [2021-08-12 17:20:20,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5409 to 5187. [2021-08-12 17:20:20,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5187 states, 5186 states have (on average 3.3360971847281142) internal successors, (17301), 5186 states have internal predecessors, (17301), 0 states have call successors, (0), 0 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-12 17:20:20,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5187 states to 5187 states and 17301 transitions. [2021-08-12 17:20:20,940 INFO L78 Accepts]: Start accepts. Automaton has 5187 states and 17301 transitions. Word has length 75 [2021-08-12 17:20:20,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:20:20,940 INFO L482 AbstractCegarLoop]: Abstraction has 5187 states and 17301 transitions. [2021-08-12 17:20:20,940 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-12 17:20:20,940 INFO L276 IsEmpty]: Start isEmpty. Operand 5187 states and 17301 transitions. [2021-08-12 17:20:20,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-08-12 17:20:20,948 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:20:20,948 INFO L550 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-12 17:20:20,949 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-12 17:20:20,949 INFO L430 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:20:20,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:20:20,949 INFO L82 PathProgramCache]: Analyzing trace with hash 838493874, now seen corresponding path program 1 times [2021-08-12 17:20:20,949 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:20:20,949 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334709619] [2021-08-12 17:20:20,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:20:20,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:20:21,009 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-12 17:20:21,010 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:20:21,010 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334709619] [2021-08-12 17:20:21,010 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334709619] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:20:21,010 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:20:21,010 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-12 17:20:21,010 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057755146] [2021-08-12 17:20:21,011 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-12 17:20:21,011 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:20:21,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-12 17:20:21,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-12 17:20:21,011 INFO L87 Difference]: Start difference. First operand 5187 states and 17301 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-12 17:20:21,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:20:21,274 INFO L93 Difference]: Finished difference Result 8031 states and 26763 transitions. [2021-08-12 17:20:21,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-12 17:20:21,275 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-12 17:20:21,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:20:21,301 INFO L225 Difference]: With dead ends: 8031 [2021-08-12 17:20:21,302 INFO L226 Difference]: Without dead ends: 4599 [2021-08-12 17:20:21,309 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 65.3ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-12 17:20:21,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4599 states. [2021-08-12 17:20:21,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4599 to 4599. [2021-08-12 17:20:21,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4599 states, 4598 states have (on average 3.2707698999565027) internal successors, (15039), 4598 states have internal predecessors, (15039), 0 states have call successors, (0), 0 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-12 17:20:21,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4599 states to 4599 states and 15039 transitions. [2021-08-12 17:20:21,457 INFO L78 Accepts]: Start accepts. Automaton has 4599 states and 15039 transitions. Word has length 76 [2021-08-12 17:20:21,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:20:21,458 INFO L482 AbstractCegarLoop]: Abstraction has 4599 states and 15039 transitions. [2021-08-12 17:20:21,458 INFO L483 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-12 17:20:21,458 INFO L276 IsEmpty]: Start isEmpty. Operand 4599 states and 15039 transitions. [2021-08-12 17:20:21,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-08-12 17:20:21,466 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:20:21,466 INFO L550 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-12 17:20:21,467 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-12 17:20:21,467 INFO L430 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:20:21,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:20:21,467 INFO L82 PathProgramCache]: Analyzing trace with hash -902903539, now seen corresponding path program 1 times [2021-08-12 17:20:21,467 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:20:21,467 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040774791] [2021-08-12 17:20:21,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:20:21,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:20:21,536 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-12 17:20:21,537 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:20:21,537 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040774791] [2021-08-12 17:20:21,537 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040774791] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:20:21,537 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:20:21,537 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-12 17:20:21,537 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120013850] [2021-08-12 17:20:21,537 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-12 17:20:21,537 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:20:21,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-12 17:20:21,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-12 17:20:21,538 INFO L87 Difference]: Start difference. First operand 4599 states and 15039 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 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-12 17:20:21,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:20:21,775 INFO L93 Difference]: Finished difference Result 6057 states and 19647 transitions. [2021-08-12 17:20:21,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-12 17:20:21,775 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 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-12 17:20:21,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:20:21,801 INFO L225 Difference]: With dead ends: 6057 [2021-08-12 17:20:21,801 INFO L226 Difference]: Without dead ends: 3213 [2021-08-12 17:20:21,806 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 72.3ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-08-12 17:20:21,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3213 states. [2021-08-12 17:20:21,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3213 to 3153. [2021-08-12 17:20:21,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3153 states, 3152 states have (on average 3.111040609137056) internal successors, (9806), 3152 states have internal predecessors, (9806), 0 states have call successors, (0), 0 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-12 17:20:21,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3153 states to 3153 states and 9806 transitions. [2021-08-12 17:20:21,911 INFO L78 Accepts]: Start accepts. Automaton has 3153 states and 9806 transitions. Word has length 77 [2021-08-12 17:20:21,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:20:21,911 INFO L482 AbstractCegarLoop]: Abstraction has 3153 states and 9806 transitions. [2021-08-12 17:20:21,911 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 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-12 17:20:21,911 INFO L276 IsEmpty]: Start isEmpty. Operand 3153 states and 9806 transitions. [2021-08-12 17:20:21,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-08-12 17:20:21,916 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:20:21,917 INFO L550 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] [2021-08-12 17:20:21,917 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-12 17:20:21,917 INFO L430 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:20:21,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:20:21,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1895442222, now seen corresponding path program 1 times [2021-08-12 17:20:21,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:20:21,918 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270017357] [2021-08-12 17:20:21,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:20:21,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:20:21,998 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-12 17:20:21,998 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:20:21,998 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270017357] [2021-08-12 17:20:21,999 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270017357] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:20:21,999 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:20:21,999 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-12 17:20:21,999 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36894256] [2021-08-12 17:20:21,999 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-08-12 17:20:21,999 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:20:21,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-12 17:20:21,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-12 17:20:22,000 INFO L87 Difference]: Start difference. First operand 3153 states and 9806 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 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-12 17:20:22,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:20:22,194 INFO L93 Difference]: Finished difference Result 3477 states and 10751 transitions. [2021-08-12 17:20:22,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-12 17:20:22,195 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2021-08-12 17:20:22,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:20:22,220 INFO L225 Difference]: With dead ends: 3477 [2021-08-12 17:20:22,220 INFO L226 Difference]: Without dead ends: 2019 [2021-08-12 17:20:22,224 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 83.3ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-08-12 17:20:22,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2019 states. [2021-08-12 17:20:22,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2019 to 1971. [2021-08-12 17:20:22,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1971 states, 1970 states have (on average 2.981725888324873) internal successors, (5874), 1970 states have internal predecessors, (5874), 0 states have call successors, (0), 0 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-12 17:20:22,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1971 states to 1971 states and 5874 transitions. [2021-08-12 17:20:22,303 INFO L78 Accepts]: Start accepts. Automaton has 1971 states and 5874 transitions. Word has length 79 [2021-08-12 17:20:22,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:20:22,305 INFO L482 AbstractCegarLoop]: Abstraction has 1971 states and 5874 transitions. [2021-08-12 17:20:22,305 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 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-12 17:20:22,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1971 states and 5874 transitions. [2021-08-12 17:20:22,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-08-12 17:20:22,308 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:20:22,308 INFO L550 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, 1] [2021-08-12 17:20:22,308 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-12 17:20:22,308 INFO L430 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:20:22,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:20:22,309 INFO L82 PathProgramCache]: Analyzing trace with hash -575909962, now seen corresponding path program 1 times [2021-08-12 17:20:22,309 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:20:22,309 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559631158] [2021-08-12 17:20:22,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:20:22,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:20:22,658 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-12 17:20:22,658 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:20:22,658 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559631158] [2021-08-12 17:20:22,658 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559631158] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:20:22,658 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:20:22,658 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-08-12 17:20:22,658 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920308022] [2021-08-12 17:20:22,659 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-08-12 17:20:22,659 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:20:22,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-12 17:20:22,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2021-08-12 17:20:22,659 INFO L87 Difference]: Start difference. First operand 1971 states and 5874 transitions. Second operand has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 15 states have internal predecessors, (82), 0 states have call successors, (0), 0 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-12 17:20:23,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:20:23,151 INFO L93 Difference]: Finished difference Result 2745 states and 8241 transitions. [2021-08-12 17:20:23,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-12 17:20:23,152 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 15 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2021-08-12 17:20:23,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:20:23,170 INFO L225 Difference]: With dead ends: 2745 [2021-08-12 17:20:23,170 INFO L226 Difference]: Without dead ends: 1617 [2021-08-12 17:20:23,171 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 467.9ms TimeCoverageRelationStatistics Valid=128, Invalid=292, Unknown=0, NotChecked=0, Total=420 [2021-08-12 17:20:23,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2021-08-12 17:20:23,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1467. [2021-08-12 17:20:23,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1467 states, 1466 states have (on average 2.9481582537517053) internal successors, (4322), 1466 states have internal predecessors, (4322), 0 states have call successors, (0), 0 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-12 17:20:23,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1467 states to 1467 states and 4322 transitions. [2021-08-12 17:20:23,224 INFO L78 Accepts]: Start accepts. Automaton has 1467 states and 4322 transitions. Word has length 82 [2021-08-12 17:20:23,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:20:23,224 INFO L482 AbstractCegarLoop]: Abstraction has 1467 states and 4322 transitions. [2021-08-12 17:20:23,224 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 15 states have internal predecessors, (82), 0 states have call successors, (0), 0 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-12 17:20:23,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 4322 transitions. [2021-08-12 17:20:23,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-08-12 17:20:23,227 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:20:23,227 INFO L550 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, 1] [2021-08-12 17:20:23,227 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-12 17:20:23,227 INFO L430 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:20:23,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:20:23,227 INFO L82 PathProgramCache]: Analyzing trace with hash 2009377846, now seen corresponding path program 2 times [2021-08-12 17:20:23,227 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:20:23,227 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062373266] [2021-08-12 17:20:23,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:20:23,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-12 17:20:23,252 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-12 17:20:23,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-12 17:20:23,282 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-12 17:20:23,307 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-12 17:20:23,307 INFO L651 BasicCegarLoop]: Counterexample might be feasible [2021-08-12 17:20:23,307 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-12 17:20:23,309 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-12 17:20:23,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.08 05:20:23 BasicIcfg [2021-08-12 17:20:23,379 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-12 17:20:23,380 INFO L168 Benchmark]: Toolchain (without parser) took 14941.35 ms. Allocated memory was 178.3 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 141.7 MB in the beginning and 2.1 GB in the end (delta: -1.9 GB). Peak memory consumption was 388.0 MB. Max. memory is 8.0 GB. [2021-08-12 17:20:23,380 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 178.3 MB. Free memory was 159.8 MB in the beginning and 159.7 MB in the end (delta: 83.5 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-08-12 17:20:23,380 INFO L168 Benchmark]: CACSL2BoogieTranslator took 427.44 ms. Allocated memory is still 178.3 MB. Free memory was 141.6 MB in the beginning and 136.8 MB in the end (delta: 4.7 MB). Peak memory consumption was 13.4 MB. Max. memory is 8.0 GB. [2021-08-12 17:20:23,380 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.62 ms. Allocated memory is still 178.3 MB. Free memory was 136.8 MB in the beginning and 134.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-12 17:20:23,380 INFO L168 Benchmark]: Boogie Preprocessor took 30.86 ms. Allocated memory is still 178.3 MB. Free memory was 134.2 MB in the beginning and 132.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-12 17:20:23,385 INFO L168 Benchmark]: RCFGBuilder took 1446.32 ms. Allocated memory was 178.3 MB in the beginning and 215.0 MB in the end (delta: 36.7 MB). Free memory was 131.6 MB in the beginning and 133.2 MB in the end (delta: -1.6 MB). Peak memory consumption was 80.2 MB. Max. memory is 8.0 GB. [2021-08-12 17:20:23,385 INFO L168 Benchmark]: TraceAbstraction took 12978.46 ms. Allocated memory was 215.0 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 132.7 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 341.5 MB. Max. memory is 8.0 GB. [2021-08-12 17:20:23,386 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.13 ms. Allocated memory is still 178.3 MB. Free memory was 159.8 MB in the beginning and 159.7 MB in the end (delta: 83.5 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 427.44 ms. Allocated memory is still 178.3 MB. Free memory was 141.6 MB in the beginning and 136.8 MB in the end (delta: 4.7 MB). Peak memory consumption was 13.4 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 51.62 ms. Allocated memory is still 178.3 MB. Free memory was 136.8 MB in the beginning and 134.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 30.86 ms. Allocated memory is still 178.3 MB. Free memory was 134.2 MB in the beginning and 132.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1446.32 ms. Allocated memory was 178.3 MB in the beginning and 215.0 MB in the end (delta: 36.7 MB). Free memory was 131.6 MB in the beginning and 133.2 MB in the end (delta: -1.6 MB). Peak memory consumption was 80.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 12978.46 ms. Allocated memory was 215.0 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 132.7 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 341.5 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L712] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L713] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L715] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L719] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L720] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L721] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L722] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L723] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L724] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L725] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L726] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L727] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L728] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L729] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L730] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L731] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L732] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L733] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L734] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L735] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 pthread_t t2025; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L819] FCALL, FORK 0 pthread_create(&t2025, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 2 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 pthread_t t2026; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] FCALL, FORK 0 pthread_create(&t2026, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 0 pthread_t t2027; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L823] FCALL, FORK 0 pthread_create(&t2027, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L796] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L796] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L797] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L798] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L799] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L800] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L800] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L776] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L776] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L777] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L778] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L779] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L780] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L829] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L829] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L830] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L831] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L832] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L833] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L833] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 z$flush_delayed = weak$$choice2 [L839] 0 z$mem_tmp = z [L840] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L840] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L841] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L841] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L842] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L842] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L843] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L843] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L844] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L845] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L846] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L848] 0 z = z$flush_delayed ? z$mem_tmp : z [L849] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 133 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12838.6ms, OverallIterations: 17, TraceHistogramMax: 1, EmptinessCheckTime: 207.9ms, AutomataDifference: 6439.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 916.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2073 SDtfs, 3459 SDslu, 8511 SDs, 0 SdLazy, 1399 SolverSat, 289 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1259.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 243 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 2467.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=16158occurred in iteration=0, InterpolantAutomatonStates: 186, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 2384.3ms AutomataMinimizationTime, 16 MinimizatonAttempts, 860 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 42.8ms SsaConstructionTime, 422.8ms SatisfiabilityAnalysisTime, 1856.0ms InterpolantComputationTime, 1236 NumberOfCodeBlocks, 1236 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1138 ConstructedInterpolants, 0 QuantifiedInterpolants, 7815 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! Received shutdown request...