/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Separate.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-29289db [2021-06-05 07:43:15,343 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 07:43:15,346 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 07:43:15,383 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 07:43:15,383 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 07:43:15,386 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 07:43:15,388 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 07:43:15,393 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 07:43:15,395 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 07:43:15,399 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 07:43:15,400 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 07:43:15,401 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 07:43:15,401 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 07:43:15,403 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 07:43:15,404 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 07:43:15,417 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 07:43:15,420 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 07:43:15,421 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 07:43:15,423 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 07:43:15,428 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 07:43:15,429 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 07:43:15,430 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 07:43:15,431 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 07:43:15,433 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 07:43:15,439 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 07:43:15,439 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 07:43:15,439 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 07:43:15,440 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 07:43:15,441 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 07:43:15,442 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 07:43:15,442 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 07:43:15,442 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 07:43:15,444 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 07:43:15,444 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 07:43:15,445 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 07:43:15,445 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 07:43:15,446 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 07:43:15,446 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 07:43:15,446 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 07:43:15,447 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 07:43:15,447 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 07:43:15,450 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-Separate.epf [2021-06-05 07:43:15,483 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 07:43:15,483 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 07:43:15,483 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 07:43:15,484 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 07:43:15,486 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 07:43:15,486 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 07:43:15,486 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 07:43:15,486 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 07:43:15,486 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 07:43:15,486 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 07:43:15,487 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 07:43:15,487 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 07:43:15,487 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 07:43:15,487 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 07:43:15,487 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 07:43:15,488 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 07:43:15,488 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 07:43:15,488 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 07:43:15,488 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 07:43:15,488 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 07:43:15,488 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 07:43:15,488 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 07:43:15,488 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 07:43:15,489 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 07:43:15,489 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 07:43:15,489 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 07:43:15,489 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 07:43:15,489 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 07:43:15,489 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 07:43:15,489 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 07:43:15,490 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 07:43:15,490 INFO L138 SettingsManager]: * Check the insufficient thread errors last=true [2021-06-05 07:43:15,490 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-05 07:43:15,770 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 07:43:15,787 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 07:43:15,789 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 07:43:15,790 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-05 07:43:15,791 INFO L275 PluginConnector]: CDTParser initialized [2021-06-05 07:43:15,792 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue.i [2021-06-05 07:43:15,874 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b3f8c223/03da6856ca8f4e04973a5f1c2fc9224e/FLAG9d0913899 [2021-06-05 07:43:16,430 INFO L306 CDTParser]: Found 1 translation units. [2021-06-05 07:43:16,431 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i [2021-06-05 07:43:16,448 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b3f8c223/03da6856ca8f4e04973a5f1c2fc9224e/FLAG9d0913899 [2021-06-05 07:43:16,880 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b3f8c223/03da6856ca8f4e04973a5f1c2fc9224e [2021-06-05 07:43:16,887 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 07:43:16,889 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-05 07:43:16,901 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-05 07:43:16,901 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-05 07:43:16,904 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-05 07:43:16,904 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 07:43:16" (1/1) ... [2021-06-05 07:43:16,905 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab353a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:43:16, skipping insertion in model container [2021-06-05 07:43:16,905 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 07:43:16" (1/1) ... [2021-06-05 07:43:16,911 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-05 07:43:16,966 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-05 07:43:17,284 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/queue.i[43284,43297] [2021-06-05 07:43:17,288 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/queue.i[43491,43504] [2021-06-05 07:43:17,291 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/queue.i[43772,43785] [2021-06-05 07:43:17,294 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 07:43:17,301 INFO L203 MainTranslator]: Completed pre-run [2021-06-05 07:43:17,340 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/queue.i[43284,43297] [2021-06-05 07:43:17,342 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/queue.i[43491,43504] [2021-06-05 07:43:17,344 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/queue.i[43772,43785] [2021-06-05 07:43:17,346 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 07:43:17,462 INFO L208 MainTranslator]: Completed translation [2021-06-05 07:43:17,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:43:17 WrapperNode [2021-06-05 07:43:17,462 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-05 07:43:17,463 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 07:43:17,463 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 07:43:17,464 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 07:43:17,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:43:17" (1/1) ... [2021-06-05 07:43:17,494 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:43:17" (1/1) ... [2021-06-05 07:43:17,529 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 07:43:17,530 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 07:43:17,530 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 07:43:17,530 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 07:43:17,536 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:43:17" (1/1) ... [2021-06-05 07:43:17,537 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:43:17" (1/1) ... [2021-06-05 07:43:17,541 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:43:17" (1/1) ... [2021-06-05 07:43:17,541 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:43:17" (1/1) ... [2021-06-05 07:43:17,550 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:43:17" (1/1) ... [2021-06-05 07:43:17,553 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:43:17" (1/1) ... [2021-06-05 07:43:17,555 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:43:17" (1/1) ... [2021-06-05 07:43:17,559 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 07:43:17,559 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 07:43:17,559 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 07:43:17,560 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 07:43:17,560 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:43:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 07:43:17,621 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2021-06-05 07:43:17,622 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2021-06-05 07:43:17,622 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2021-06-05 07:43:17,622 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2021-06-05 07:43:17,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-05 07:43:17,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-05 07:43:17,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-06-05 07:43:17,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-05 07:43:17,624 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-06-05 07:43:17,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-05 07:43:17,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 07:43:17,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 07:43:17,625 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-05 07:43:18,260 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 07:43:18,261 INFO L299 CfgBuilder]: Removed 18 assume(true) statements. [2021-06-05 07:43:18,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 07:43:18 BoogieIcfgContainer [2021-06-05 07:43:18,262 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 07:43:18,266 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 07:43:18,266 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 07:43:18,268 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 07:43:18,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.06 07:43:16" (1/3) ... [2021-06-05 07:43:18,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b2359b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 07:43:18, skipping insertion in model container [2021-06-05 07:43:18,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:43:17" (2/3) ... [2021-06-05 07:43:18,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b2359b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 07:43:18, skipping insertion in model container [2021-06-05 07:43:18,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 07:43:18" (3/3) ... [2021-06-05 07:43:18,278 INFO L111 eAbstractionObserver]: Analyzing ICFG queue.i [2021-06-05 07:43:18,297 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 07:43:18,297 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 07:43:18,297 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2021-06-05 07:43:18,298 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 07:43:18,377 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,378 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,378 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,378 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,378 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,378 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,378 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,379 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,379 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,379 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,379 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,379 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,379 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,380 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,380 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,380 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,380 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,380 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,381 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,381 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,381 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,381 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,381 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,381 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,381 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,382 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,382 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,382 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,382 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,382 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,382 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,383 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,383 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,383 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,383 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,383 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,383 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,383 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,384 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,384 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,384 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,384 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,384 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,384 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,384 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,385 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,385 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,385 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,385 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,385 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,385 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,385 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,385 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,386 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,386 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,386 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,386 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,386 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,386 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,386 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,387 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,387 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,387 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,387 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,387 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,387 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,387 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,388 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,388 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,388 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,388 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,392 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,392 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,393 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,393 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,393 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,393 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,393 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,394 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,394 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,394 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,394 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,394 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,394 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,394 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,395 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,395 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,395 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,395 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,395 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,395 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,396 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,396 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,396 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,396 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,396 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,396 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,396 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,396 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,397 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,397 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,397 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,397 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,397 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,397 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,397 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,398 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,398 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,398 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,398 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,398 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,398 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,399 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,399 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,399 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,399 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,399 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,399 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,399 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,400 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,400 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,400 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,400 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,400 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,400 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,400 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,401 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,401 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,401 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,401 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,401 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,401 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,402 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,402 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,402 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,402 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,402 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,402 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,402 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,403 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,403 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,403 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,403 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,403 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,403 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,403 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,404 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,404 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,404 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,404 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,404 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,405 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,405 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,405 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,405 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,405 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,406 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,406 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,406 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,406 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,406 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,406 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,406 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,407 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,407 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,407 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,407 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,407 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,407 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,407 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,408 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,408 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,408 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,408 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,408 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,408 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,408 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,408 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,409 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,409 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,409 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,409 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,409 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,409 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,409 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,410 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,410 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,410 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,410 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,410 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,410 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,411 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,411 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,411 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,411 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,411 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,411 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,411 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,412 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,412 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,412 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,412 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,412 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,412 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,413 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,413 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,413 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,413 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,413 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,414 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,414 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,414 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,414 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,414 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,414 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,415 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,415 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,415 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,415 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,415 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,415 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,416 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,416 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,416 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,416 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,416 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,416 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,416 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,417 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,417 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,420 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,421 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,421 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,421 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,421 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,421 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,421 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,421 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,421 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,422 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,422 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,422 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,422 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,422 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,422 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,423 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,423 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,423 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,423 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,423 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,423 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,423 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,423 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,424 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,424 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,424 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,424 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,424 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,424 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,424 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,424 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,425 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,425 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,425 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,425 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,425 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,425 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,425 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,425 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,426 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,426 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,426 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,426 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,426 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,426 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,426 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,426 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,426 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,427 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,427 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,427 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,427 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,427 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,427 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,427 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,427 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,427 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,427 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,428 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,428 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,428 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,428 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,428 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,429 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,429 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,429 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,429 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,429 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,429 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,429 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,429 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,429 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,430 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,430 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,430 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,430 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,430 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,430 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,430 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,430 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,430 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,431 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,431 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,431 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,431 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,431 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,431 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,431 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,431 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,432 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,432 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,432 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,432 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,432 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,432 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,432 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,432 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,433 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,433 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,433 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,433 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,433 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,433 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,433 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,433 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,433 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,434 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,434 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,434 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,434 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,434 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,434 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,434 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,434 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,435 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,435 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,435 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,435 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,435 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,435 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,435 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,436 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,436 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,436 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,436 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,436 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,441 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,442 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,442 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,442 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,442 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,443 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,443 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,443 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,443 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,443 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,443 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,443 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,444 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,444 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,444 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,444 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,444 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,444 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,445 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,445 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,445 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,445 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,445 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,445 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,445 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,446 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,446 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,446 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,446 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,446 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,447 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,447 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,451 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,451 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,451 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,451 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,451 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,452 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,452 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,452 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,452 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,452 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,452 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,452 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,453 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,453 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,453 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,454 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,454 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,454 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,454 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,454 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,454 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,455 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,455 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,455 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,456 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,456 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,456 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,456 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,456 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,462 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,462 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,462 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,462 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,462 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,462 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,463 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,463 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,463 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,463 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,463 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,463 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,463 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,463 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,463 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,463 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,463 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,464 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,464 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,464 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,464 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,464 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,464 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,465 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,465 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,465 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,465 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,465 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,465 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,466 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,466 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,466 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,466 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,466 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,467 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,467 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,467 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,475 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,476 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,476 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,476 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,476 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,476 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,476 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,476 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,476 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,477 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,477 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,477 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,477 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,477 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,477 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,477 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,477 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,477 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,477 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,478 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,478 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,478 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,478 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,478 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,478 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,478 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,478 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,478 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,479 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,479 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,479 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,479 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,479 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,479 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,479 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,479 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,479 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,479 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,480 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,480 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,480 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,480 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,480 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,480 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,480 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,480 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,480 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,481 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,481 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,481 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,481 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,481 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,481 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,481 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,481 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,481 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,481 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,482 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,482 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,482 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,482 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,482 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,482 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,482 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,482 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,482 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,482 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,483 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,483 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,483 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,483 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,483 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,483 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,483 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,483 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,483 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,484 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,484 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,484 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,484 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,484 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,484 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,484 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,484 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,484 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,484 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,485 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,485 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,485 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,485 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,485 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,485 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,485 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,485 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,485 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,485 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,486 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,486 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,486 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,486 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,486 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,486 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,486 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,486 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,486 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,487 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,487 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,487 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,487 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,487 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,487 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,487 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,487 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,487 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,495 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,496 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,496 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,496 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,498 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,498 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,498 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,499 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,499 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,499 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,499 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,499 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,499 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,499 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,499 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,500 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,500 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,500 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,500 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,500 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,500 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,500 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,500 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,501 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,501 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,501 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,501 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,501 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,501 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,501 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,501 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,501 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,502 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,502 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,502 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,506 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,506 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,507 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,514 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,514 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,526 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,526 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,528 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,529 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,529 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,529 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,529 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,529 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,529 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,529 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,529 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,529 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,530 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,530 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,530 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,530 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,530 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:18,547 INFO L149 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2021-06-05 07:43:18,566 INFO L255 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-06-05 07:43:18,581 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 07:43:18,582 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 07:43:18,582 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 07:43:18,582 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 07:43:18,582 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 07:43:18,582 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 07:43:18,582 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 07:43:18,582 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 07:43:18,593 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 247 places, 257 transitions, 536 flow [2021-06-05 07:43:19,712 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 23654 states, 23649 states have (on average 2.8479428305636603) internal successors, (67351), 23653 states have internal predecessors, (67351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:43:19,756 INFO L276 IsEmpty]: Start isEmpty. Operand has 23654 states, 23649 states have (on average 2.8479428305636603) internal successors, (67351), 23653 states have internal predecessors, (67351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:43:19,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-06-05 07:43:19,762 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:43:19,763 INFO L521 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] [2021-06-05 07:43:19,763 INFO L430 AbstractCegarLoop]: === Iteration 1 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:43:19,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:43:19,771 INFO L82 PathProgramCache]: Analyzing trace with hash 846969469, now seen corresponding path program 1 times [2021-06-05 07:43:19,778 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:43:19,779 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418228681] [2021-06-05 07:43:19,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:43:19,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:43:20,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:43:20,060 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:43:20,061 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418228681] [2021-06-05 07:43:20,062 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418228681] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:43:20,062 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:43:20,062 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 07:43:20,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907059988] [2021-06-05 07:43:20,066 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-05 07:43:20,066 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:43:20,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-05 07:43:20,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 07:43:20,115 INFO L87 Difference]: Start difference. First operand has 23654 states, 23649 states have (on average 2.8479428305636603) internal successors, (67351), 23653 states have internal predecessors, (67351), 0 states have call successors, (0), 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 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:43:20,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:43:20,401 INFO L93 Difference]: Finished difference Result 23006 states and 64260 transitions. [2021-06-05 07:43:20,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-05 07:43:20,403 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2021-06-05 07:43:20,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:43:20,544 INFO L225 Difference]: With dead ends: 23006 [2021-06-05 07:43:20,544 INFO L226 Difference]: Without dead ends: 22283 [2021-06-05 07:43:20,546 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 07:43:20,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22283 states. [2021-06-05 07:43:21,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22283 to 22283. [2021-06-05 07:43:21,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22283 states, 22280 states have (on average 2.798653500897666) internal successors, (62354), 22282 states have internal predecessors, (62354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:43:21,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22283 states to 22283 states and 62354 transitions. [2021-06-05 07:43:21,572 INFO L78 Accepts]: Start accepts. Automaton has 22283 states and 62354 transitions. Word has length 48 [2021-06-05 07:43:21,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:43:21,573 INFO L482 AbstractCegarLoop]: Abstraction has 22283 states and 62354 transitions. [2021-06-05 07:43:21,574 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:43:21,574 INFO L276 IsEmpty]: Start isEmpty. Operand 22283 states and 62354 transitions. [2021-06-05 07:43:21,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-06-05 07:43:21,589 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:43:21,589 INFO L521 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, 1] [2021-06-05 07:43:21,590 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 07:43:21,590 INFO L430 AbstractCegarLoop]: === Iteration 2 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:43:21,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:43:21,593 INFO L82 PathProgramCache]: Analyzing trace with hash -432801653, now seen corresponding path program 1 times [2021-06-05 07:43:21,593 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:43:21,593 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757601437] [2021-06-05 07:43:21,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:43:21,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:43:21,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:43:21,940 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:43:21,941 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757601437] [2021-06-05 07:43:21,941 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757601437] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:43:21,941 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:43:21,941 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-05 07:43:21,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29241731] [2021-06-05 07:43:21,943 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 07:43:21,943 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:43:21,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 07:43:21,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-06-05 07:43:21,945 INFO L87 Difference]: Start difference. First operand 22283 states and 62354 transitions. Second operand has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:43:22,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:43:22,704 INFO L93 Difference]: Finished difference Result 22280 states and 62350 transitions. [2021-06-05 07:43:22,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 07:43:22,705 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2021-06-05 07:43:22,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:43:22,768 INFO L225 Difference]: With dead ends: 22280 [2021-06-05 07:43:22,768 INFO L226 Difference]: Without dead ends: 22280 [2021-06-05 07:43:22,769 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 380.8ms TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420 [2021-06-05 07:43:23,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22280 states. [2021-06-05 07:43:23,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22280 to 22280. [2021-06-05 07:43:23,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22280 states, 22277 states have (on average 2.798850832697401) internal successors, (62350), 22279 states have internal predecessors, (62350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:43:23,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22280 states to 22280 states and 62350 transitions. [2021-06-05 07:43:23,476 INFO L78 Accepts]: Start accepts. Automaton has 22280 states and 62350 transitions. Word has length 83 [2021-06-05 07:43:23,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:43:23,477 INFO L482 AbstractCegarLoop]: Abstraction has 22280 states and 62350 transitions. [2021-06-05 07:43:23,477 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:43:23,477 INFO L276 IsEmpty]: Start isEmpty. Operand 22280 states and 62350 transitions. [2021-06-05 07:43:23,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-06-05 07:43:23,481 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:43:23,481 INFO L521 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, 1, 1] [2021-06-05 07:43:23,482 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 07:43:23,482 INFO L430 AbstractCegarLoop]: === Iteration 3 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:43:23,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:43:23,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1997559754, now seen corresponding path program 1 times [2021-06-05 07:43:23,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:43:23,483 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403718702] [2021-06-05 07:43:23,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:43:23,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:43:23,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:43:23,528 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:43:23,528 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403718702] [2021-06-05 07:43:23,528 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403718702] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:43:23,528 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:43:23,528 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 07:43:23,529 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904270646] [2021-06-05 07:43:23,529 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 07:43:23,529 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:43:23,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 07:43:23,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 07:43:23,530 INFO L87 Difference]: Start difference. First operand 22280 states and 62350 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:43:23,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:43:23,671 INFO L93 Difference]: Finished difference Result 22063 states and 61535 transitions. [2021-06-05 07:43:23,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 07:43:23,672 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2021-06-05 07:43:23,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:43:23,725 INFO L225 Difference]: With dead ends: 22063 [2021-06-05 07:43:23,725 INFO L226 Difference]: Without dead ends: 22063 [2021-06-05 07:43:23,725 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 07:43:24,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22063 states. [2021-06-05 07:43:24,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22063 to 22063. [2021-06-05 07:43:24,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22063 states, 22060 states have (on average 2.7894378966455124) internal successors, (61535), 22062 states have internal predecessors, (61535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:43:24,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22063 states to 22063 states and 61535 transitions. [2021-06-05 07:43:24,531 INFO L78 Accepts]: Start accepts. Automaton has 22063 states and 61535 transitions. Word has length 84 [2021-06-05 07:43:24,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:43:24,532 INFO L482 AbstractCegarLoop]: Abstraction has 22063 states and 61535 transitions. [2021-06-05 07:43:24,532 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:43:24,532 INFO L276 IsEmpty]: Start isEmpty. Operand 22063 states and 61535 transitions. [2021-06-05 07:43:24,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-06-05 07:43:24,541 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:43:24,541 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:43:24,541 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 07:43:24,541 INFO L430 AbstractCegarLoop]: === Iteration 4 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:43:24,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:43:24,542 INFO L82 PathProgramCache]: Analyzing trace with hash -588297784, now seen corresponding path program 1 times [2021-06-05 07:43:24,542 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:43:24,542 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948539043] [2021-06-05 07:43:24,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:43:24,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:43:24,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:43:24,633 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:43:24,633 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948539043] [2021-06-05 07:43:24,633 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948539043] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:43:24,633 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:43:24,633 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 07:43:24,633 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271063323] [2021-06-05 07:43:24,636 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 07:43:24,637 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:43:24,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 07:43:24,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 07:43:24,637 INFO L87 Difference]: Start difference. First operand 22063 states and 61535 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:43:24,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:43:24,699 INFO L93 Difference]: Finished difference Result 15355 states and 42187 transitions. [2021-06-05 07:43:24,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 07:43:24,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2021-06-05 07:43:24,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:43:24,734 INFO L225 Difference]: With dead ends: 15355 [2021-06-05 07:43:24,734 INFO L226 Difference]: Without dead ends: 15112 [2021-06-05 07:43:24,738 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 07:43:24,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15112 states. [2021-06-05 07:43:25,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15112 to 15112. [2021-06-05 07:43:25,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15112 states, 15110 states have (on average 2.7499007279947056) internal successors, (41551), 15111 states have internal predecessors, (41551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:43:25,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15112 states to 15112 states and 41551 transitions. [2021-06-05 07:43:25,136 INFO L78 Accepts]: Start accepts. Automaton has 15112 states and 41551 transitions. Word has length 93 [2021-06-05 07:43:25,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:43:25,137 INFO L482 AbstractCegarLoop]: Abstraction has 15112 states and 41551 transitions. [2021-06-05 07:43:25,138 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:43:25,138 INFO L276 IsEmpty]: Start isEmpty. Operand 15112 states and 41551 transitions. [2021-06-05 07:43:25,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-06-05 07:43:25,149 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:43:25,150 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:43:25,150 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-05 07:43:25,150 INFO L430 AbstractCegarLoop]: === Iteration 5 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:43:25,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:43:25,150 INFO L82 PathProgramCache]: Analyzing trace with hash -724837919, now seen corresponding path program 1 times [2021-06-05 07:43:25,150 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:43:25,151 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800836366] [2021-06-05 07:43:25,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:43:25,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:43:25,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:43:25,205 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:43:25,205 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800836366] [2021-06-05 07:43:25,206 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800836366] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:43:25,206 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:43:25,206 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 07:43:25,206 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936562690] [2021-06-05 07:43:25,207 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 07:43:25,207 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:43:25,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 07:43:25,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 07:43:25,208 INFO L87 Difference]: Start difference. First operand 15112 states and 41551 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:43:25,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:43:25,308 INFO L93 Difference]: Finished difference Result 26661 states and 73631 transitions. [2021-06-05 07:43:25,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 07:43:25,309 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2021-06-05 07:43:25,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:43:25,353 INFO L225 Difference]: With dead ends: 26661 [2021-06-05 07:43:25,354 INFO L226 Difference]: Without dead ends: 26571 [2021-06-05 07:43:25,354 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 07:43:25,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26571 states. [2021-06-05 07:43:25,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26571 to 15217. [2021-06-05 07:43:25,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15217 states, 15215 states have (on average 2.7484719027275717) internal successors, (41818), 15216 states have internal predecessors, (41818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:43:25,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15217 states to 15217 states and 41818 transitions. [2021-06-05 07:43:25,898 INFO L78 Accepts]: Start accepts. Automaton has 15217 states and 41818 transitions. Word has length 99 [2021-06-05 07:43:25,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:43:25,898 INFO L482 AbstractCegarLoop]: Abstraction has 15217 states and 41818 transitions. [2021-06-05 07:43:25,898 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:43:25,898 INFO L276 IsEmpty]: Start isEmpty. Operand 15217 states and 41818 transitions. [2021-06-05 07:43:25,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-06-05 07:43:25,905 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:43:25,905 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:43:25,905 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-05 07:43:25,905 INFO L430 AbstractCegarLoop]: === Iteration 6 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:43:25,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:43:25,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1651068086, now seen corresponding path program 1 times [2021-06-05 07:43:25,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:43:25,906 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348892706] [2021-06-05 07:43:25,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:43:25,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:43:26,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:43:26,323 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:43:26,324 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348892706] [2021-06-05 07:43:26,324 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348892706] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:43:26,324 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:43:26,324 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-06-05 07:43:26,324 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996992632] [2021-06-05 07:43:26,324 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 07:43:26,324 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:43:26,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 07:43:26,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2021-06-05 07:43:26,325 INFO L87 Difference]: Start difference. First operand 15217 states and 41818 transitions. Second operand has 16 states, 16 states have (on average 6.25) internal successors, (100), 16 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:43:27,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:43:27,225 INFO L93 Difference]: Finished difference Result 15327 states and 42117 transitions. [2021-06-05 07:43:27,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 07:43:27,226 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.25) internal successors, (100), 16 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2021-06-05 07:43:27,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:43:27,252 INFO L225 Difference]: With dead ends: 15327 [2021-06-05 07:43:27,253 INFO L226 Difference]: Without dead ends: 15327 [2021-06-05 07:43:27,253 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 734.3ms TimeCoverageRelationStatistics Valid=207, Invalid=549, Unknown=0, NotChecked=0, Total=756 [2021-06-05 07:43:27,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15327 states. [2021-06-05 07:43:27,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15327 to 15267. [2021-06-05 07:43:27,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15267 states, 15265 states have (on average 2.748444153291844) internal successors, (41955), 15266 states have internal predecessors, (41955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:43:27,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15267 states to 15267 states and 41955 transitions. [2021-06-05 07:43:27,594 INFO L78 Accepts]: Start accepts. Automaton has 15267 states and 41955 transitions. Word has length 100 [2021-06-05 07:43:27,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:43:27,594 INFO L482 AbstractCegarLoop]: Abstraction has 15267 states and 41955 transitions. [2021-06-05 07:43:27,594 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 6.25) internal successors, (100), 16 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:43:27,594 INFO L276 IsEmpty]: Start isEmpty. Operand 15267 states and 41955 transitions. [2021-06-05 07:43:27,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-06-05 07:43:27,602 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:43:27,602 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:43:27,602 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-05 07:43:27,603 INFO L430 AbstractCegarLoop]: === Iteration 7 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:43:27,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:43:27,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1578711888, now seen corresponding path program 1 times [2021-06-05 07:43:27,603 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:43:27,603 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18574877] [2021-06-05 07:43:27,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:43:27,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:43:28,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:43:28,417 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:43:28,418 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18574877] [2021-06-05 07:43:28,418 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18574877] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:43:28,418 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:43:28,418 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-06-05 07:43:28,418 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934874890] [2021-06-05 07:43:28,418 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-06-05 07:43:28,418 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:43:28,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-06-05 07:43:28,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=628, Unknown=0, NotChecked=0, Total=702 [2021-06-05 07:43:28,419 INFO L87 Difference]: Start difference. First operand 15267 states and 41955 transitions. Second operand has 27 states, 27 states have (on average 3.8518518518518516) internal successors, (104), 27 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:43:29,704 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 45 [2021-06-05 07:43:30,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:43:30,693 INFO L93 Difference]: Finished difference Result 15277 states and 41997 transitions. [2021-06-05 07:43:30,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-06-05 07:43:30,694 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.8518518518518516) internal successors, (104), 27 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2021-06-05 07:43:30,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:43:30,713 INFO L225 Difference]: With dead ends: 15277 [2021-06-05 07:43:30,714 INFO L226 Difference]: Without dead ends: 15262 [2021-06-05 07:43:30,714 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 1852.5ms TimeCoverageRelationStatistics Valid=446, Invalid=2004, Unknown=0, NotChecked=0, Total=2450 [2021-06-05 07:43:30,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15262 states. [2021-06-05 07:43:30,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15262 to 15262. [2021-06-05 07:43:30,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15262 states, 15260 states have (on average 2.750524246395806) internal successors, (41973), 15261 states have internal predecessors, (41973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:43:30,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15262 states to 15262 states and 41973 transitions. [2021-06-05 07:43:30,995 INFO L78 Accepts]: Start accepts. Automaton has 15262 states and 41973 transitions. Word has length 104 [2021-06-05 07:43:30,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:43:30,996 INFO L482 AbstractCegarLoop]: Abstraction has 15262 states and 41973 transitions. [2021-06-05 07:43:30,996 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 3.8518518518518516) internal successors, (104), 27 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:43:30,996 INFO L276 IsEmpty]: Start isEmpty. Operand 15262 states and 41973 transitions. [2021-06-05 07:43:31,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 07:43:31,002 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:43:31,002 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:43:31,003 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-05 07:43:31,003 INFO L430 AbstractCegarLoop]: === Iteration 8 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:43:31,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:43:31,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1198768392, now seen corresponding path program 1 times [2021-06-05 07:43:31,003 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:43:31,003 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425670834] [2021-06-05 07:43:31,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:43:31,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:43:31,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:43:31,468 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:43:31,468 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425670834] [2021-06-05 07:43:31,468 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425670834] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:43:31,468 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:43:31,468 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-06-05 07:43:31,468 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931318159] [2021-06-05 07:43:31,469 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 07:43:31,469 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:43:31,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 07:43:31,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2021-06-05 07:43:31,470 INFO L87 Difference]: Start difference. First operand 15262 states and 41973 transitions. Second operand has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:43:32,339 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2021-06-05 07:43:32,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:43:32,552 INFO L93 Difference]: Finished difference Result 17982 states and 49376 transitions. [2021-06-05 07:43:32,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 07:43:32,552 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2021-06-05 07:43:32,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:43:32,574 INFO L225 Difference]: With dead ends: 17982 [2021-06-05 07:43:32,574 INFO L226 Difference]: Without dead ends: 17982 [2021-06-05 07:43:32,574 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 913.8ms TimeCoverageRelationStatistics Valid=301, Invalid=959, Unknown=0, NotChecked=0, Total=1260 [2021-06-05 07:43:32,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17982 states. [2021-06-05 07:43:32,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17982 to 16042. [2021-06-05 07:43:32,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16042 states, 16040 states have (on average 2.748067331670823) internal successors, (44079), 16041 states have internal predecessors, (44079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:43:32,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16042 states to 16042 states and 44079 transitions. [2021-06-05 07:43:32,857 INFO L78 Accepts]: Start accepts. Automaton has 16042 states and 44079 transitions. Word has length 105 [2021-06-05 07:43:32,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:43:32,858 INFO L482 AbstractCegarLoop]: Abstraction has 16042 states and 44079 transitions. [2021-06-05 07:43:32,858 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:43:32,858 INFO L276 IsEmpty]: Start isEmpty. Operand 16042 states and 44079 transitions. [2021-06-05 07:43:32,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 07:43:32,865 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:43:32,865 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:43:32,866 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-05 07:43:32,866 INFO L430 AbstractCegarLoop]: === Iteration 9 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:43:32,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:43:32,866 INFO L82 PathProgramCache]: Analyzing trace with hash 431874918, now seen corresponding path program 2 times [2021-06-05 07:43:32,866 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:43:32,866 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728356208] [2021-06-05 07:43:32,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:43:32,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:43:33,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:43:33,161 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:43:33,161 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728356208] [2021-06-05 07:43:33,161 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728356208] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:43:33,161 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:43:33,161 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-06-05 07:43:33,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773168748] [2021-06-05 07:43:33,162 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 07:43:33,162 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:43:33,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 07:43:33,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2021-06-05 07:43:33,162 INFO L87 Difference]: Start difference. First operand 16042 states and 44079 transitions. Second operand has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:43:34,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:43:34,477 INFO L93 Difference]: Finished difference Result 19200 states and 52610 transitions. [2021-06-05 07:43:34,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 07:43:34,477 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2021-06-05 07:43:34,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:43:34,504 INFO L225 Difference]: With dead ends: 19200 [2021-06-05 07:43:34,504 INFO L226 Difference]: Without dead ends: 19200 [2021-06-05 07:43:34,505 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 910.3ms TimeCoverageRelationStatistics Valid=359, Invalid=1047, Unknown=0, NotChecked=0, Total=1406 [2021-06-05 07:43:34,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19200 states. [2021-06-05 07:43:34,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19200 to 16048. [2021-06-05 07:43:34,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16048 states, 16046 states have (on average 2.747787610619469) internal successors, (44091), 16047 states have internal predecessors, (44091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:43:34,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16048 states to 16048 states and 44091 transitions. [2021-06-05 07:43:34,830 INFO L78 Accepts]: Start accepts. Automaton has 16048 states and 44091 transitions. Word has length 105 [2021-06-05 07:43:34,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:43:34,830 INFO L482 AbstractCegarLoop]: Abstraction has 16048 states and 44091 transitions. [2021-06-05 07:43:34,830 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:43:34,830 INFO L276 IsEmpty]: Start isEmpty. Operand 16048 states and 44091 transitions. [2021-06-05 07:43:34,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 07:43:34,837 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:43:34,837 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:43:34,837 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-05 07:43:34,837 INFO L430 AbstractCegarLoop]: === Iteration 10 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:43:34,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:43:34,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1360916942, now seen corresponding path program 3 times [2021-06-05 07:43:34,838 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:43:34,838 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138266849] [2021-06-05 07:43:34,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:43:34,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:43:35,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:43:35,169 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:43:35,169 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138266849] [2021-06-05 07:43:35,169 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138266849] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:43:35,169 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:43:35,169 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-06-05 07:43:35,170 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734143232] [2021-06-05 07:43:35,170 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 07:43:35,170 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:43:35,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 07:43:35,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2021-06-05 07:43:35,171 INFO L87 Difference]: Start difference. First operand 16048 states and 44091 transitions. Second operand has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:43:36,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:43:36,821 INFO L93 Difference]: Finished difference Result 18840 states and 51638 transitions. [2021-06-05 07:43:36,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-05 07:43:36,822 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2021-06-05 07:43:36,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:43:36,847 INFO L225 Difference]: With dead ends: 18840 [2021-06-05 07:43:36,847 INFO L226 Difference]: Without dead ends: 18840 [2021-06-05 07:43:36,847 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 1172.4ms TimeCoverageRelationStatistics Valid=413, Invalid=1227, Unknown=0, NotChecked=0, Total=1640 [2021-06-05 07:43:36,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18840 states. [2021-06-05 07:43:37,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18840 to 16052. [2021-06-05 07:43:37,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16052 states, 16050 states have (on average 2.747601246105919) internal successors, (44099), 16051 states have internal predecessors, (44099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:43:37,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16052 states to 16052 states and 44099 transitions. [2021-06-05 07:43:37,207 INFO L78 Accepts]: Start accepts. Automaton has 16052 states and 44099 transitions. Word has length 105 [2021-06-05 07:43:37,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:43:37,207 INFO L482 AbstractCegarLoop]: Abstraction has 16052 states and 44099 transitions. [2021-06-05 07:43:37,207 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:43:37,208 INFO L276 IsEmpty]: Start isEmpty. Operand 16052 states and 44099 transitions. [2021-06-05 07:43:37,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 07:43:37,214 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:43:37,214 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:43:37,214 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-05 07:43:37,214 INFO L430 AbstractCegarLoop]: === Iteration 11 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:43:37,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:43:37,215 INFO L82 PathProgramCache]: Analyzing trace with hash 558943188, now seen corresponding path program 4 times [2021-06-05 07:43:37,215 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:43:37,215 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003752489] [2021-06-05 07:43:37,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:43:37,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:43:37,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:43:37,607 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:43:37,607 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003752489] [2021-06-05 07:43:37,607 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003752489] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:43:37,607 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:43:37,607 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-06-05 07:43:37,607 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995879382] [2021-06-05 07:43:37,608 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 07:43:37,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:43:37,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 07:43:37,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2021-06-05 07:43:37,609 INFO L87 Difference]: Start difference. First operand 16052 states and 44099 transitions. Second operand has 19 states, 19 states have (on average 5.526315789473684) internal successors, (105), 19 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:43:38,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:43:38,500 INFO L93 Difference]: Finished difference Result 15932 states and 43715 transitions. [2021-06-05 07:43:38,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 07:43:38,500 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.526315789473684) internal successors, (105), 19 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2021-06-05 07:43:38,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:43:38,520 INFO L225 Difference]: With dead ends: 15932 [2021-06-05 07:43:38,520 INFO L226 Difference]: Without dead ends: 15932 [2021-06-05 07:43:38,520 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 794.4ms TimeCoverageRelationStatistics Valid=244, Invalid=748, Unknown=0, NotChecked=0, Total=992 [2021-06-05 07:43:38,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15932 states. [2021-06-05 07:43:38,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15932 to 15082. [2021-06-05 07:43:38,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15082 states, 15080 states have (on average 2.747148541114058) internal successors, (41427), 15081 states have internal predecessors, (41427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:43:38,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15082 states to 15082 states and 41427 transitions. [2021-06-05 07:43:38,800 INFO L78 Accepts]: Start accepts. Automaton has 15082 states and 41427 transitions. Word has length 105 [2021-06-05 07:43:38,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:43:38,800 INFO L482 AbstractCegarLoop]: Abstraction has 15082 states and 41427 transitions. [2021-06-05 07:43:38,800 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 5.526315789473684) internal successors, (105), 19 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:43:38,800 INFO L276 IsEmpty]: Start isEmpty. Operand 15082 states and 41427 transitions. [2021-06-05 07:43:38,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-06-05 07:43:38,805 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:43:38,805 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:43:38,805 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-05 07:43:38,805 INFO L430 AbstractCegarLoop]: === Iteration 12 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:43:38,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:43:38,805 INFO L82 PathProgramCache]: Analyzing trace with hash -689257618, now seen corresponding path program 1 times [2021-06-05 07:43:38,806 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:43:38,806 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629652435] [2021-06-05 07:43:38,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:43:38,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:43:39,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:43:39,741 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:43:39,741 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629652435] [2021-06-05 07:43:39,742 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629652435] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:43:39,742 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:43:39,742 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-06-05 07:43:39,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968407139] [2021-06-05 07:43:39,742 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-06-05 07:43:39,742 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:43:39,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-06-05 07:43:39,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=785, Unknown=0, NotChecked=0, Total=870 [2021-06-05 07:43:39,744 INFO L87 Difference]: Start difference. First operand 15082 states and 41427 transitions. Second operand has 30 states, 30 states have (on average 3.6333333333333333) internal successors, (109), 30 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:43:42,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:43:42,278 INFO L93 Difference]: Finished difference Result 17233 states and 47366 transitions. [2021-06-05 07:43:42,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-05 07:43:42,279 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.6333333333333333) internal successors, (109), 30 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2021-06-05 07:43:42,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:43:42,306 INFO L225 Difference]: With dead ends: 17233 [2021-06-05 07:43:42,306 INFO L226 Difference]: Without dead ends: 16603 [2021-06-05 07:43:42,307 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 2259.7ms TimeCoverageRelationStatistics Valid=525, Invalid=2337, Unknown=0, NotChecked=0, Total=2862 [2021-06-05 07:43:42,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16603 states. [2021-06-05 07:43:42,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16603 to 14767. [2021-06-05 07:43:42,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14767 states, 14765 states have (on average 2.7523196749068743) internal successors, (40638), 14766 states have internal predecessors, (40638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:43:42,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14767 states to 14767 states and 40638 transitions. [2021-06-05 07:43:42,585 INFO L78 Accepts]: Start accepts. Automaton has 14767 states and 40638 transitions. Word has length 109 [2021-06-05 07:43:42,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:43:42,585 INFO L482 AbstractCegarLoop]: Abstraction has 14767 states and 40638 transitions. [2021-06-05 07:43:42,585 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 3.6333333333333333) internal successors, (109), 30 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:43:42,586 INFO L276 IsEmpty]: Start isEmpty. Operand 14767 states and 40638 transitions. [2021-06-05 07:43:42,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-06-05 07:43:42,590 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:43:42,590 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:43:42,590 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-05 07:43:42,590 INFO L430 AbstractCegarLoop]: === Iteration 13 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:43:42,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:43:42,591 INFO L82 PathProgramCache]: Analyzing trace with hash 898788268, now seen corresponding path program 2 times [2021-06-05 07:43:42,591 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:43:42,591 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808958669] [2021-06-05 07:43:42,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:43:42,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:43:43,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:43:43,459 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:43:43,459 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808958669] [2021-06-05 07:43:43,459 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808958669] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:43:43,459 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:43:43,459 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-06-05 07:43:43,459 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336941636] [2021-06-05 07:43:43,459 INFO L462 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-06-05 07:43:43,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:43:43,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-06-05 07:43:43,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=734, Unknown=0, NotChecked=0, Total=812 [2021-06-05 07:43:43,461 INFO L87 Difference]: Start difference. First operand 14767 states and 40638 transitions. Second operand has 29 states, 29 states have (on average 3.7586206896551726) internal successors, (109), 29 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:43:46,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:43:46,943 INFO L93 Difference]: Finished difference Result 19795 states and 54296 transitions. [2021-06-05 07:43:46,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-06-05 07:43:46,944 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.7586206896551726) internal successors, (109), 29 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2021-06-05 07:43:46,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:43:46,967 INFO L225 Difference]: With dead ends: 19795 [2021-06-05 07:43:46,967 INFO L226 Difference]: Without dead ends: 19705 [2021-06-05 07:43:46,968 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 3073.3ms TimeCoverageRelationStatistics Valid=724, Invalid=3058, Unknown=0, NotChecked=0, Total=3782 [2021-06-05 07:43:47,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19705 states. [2021-06-05 07:43:47,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19705 to 14773. [2021-06-05 07:43:47,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14773 states, 14771 states have (on average 2.7520140816464695) internal successors, (40650), 14772 states have internal predecessors, (40650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:43:47,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14773 states to 14773 states and 40650 transitions. [2021-06-05 07:43:47,213 INFO L78 Accepts]: Start accepts. Automaton has 14773 states and 40650 transitions. Word has length 109 [2021-06-05 07:43:47,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:43:47,214 INFO L482 AbstractCegarLoop]: Abstraction has 14773 states and 40650 transitions. [2021-06-05 07:43:47,214 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 29 states, 29 states have (on average 3.7586206896551726) internal successors, (109), 29 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:43:47,214 INFO L276 IsEmpty]: Start isEmpty. Operand 14773 states and 40650 transitions. [2021-06-05 07:43:47,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-06-05 07:43:47,217 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:43:47,218 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:43:47,218 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-05 07:43:47,218 INFO L430 AbstractCegarLoop]: === Iteration 14 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:43:47,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:43:47,218 INFO L82 PathProgramCache]: Analyzing trace with hash 152158104, now seen corresponding path program 3 times [2021-06-05 07:43:47,218 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:43:47,219 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647706825] [2021-06-05 07:43:47,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:43:47,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:43:48,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:43:48,005 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:43:48,005 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647706825] [2021-06-05 07:43:48,005 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647706825] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:43:48,005 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:43:48,005 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-06-05 07:43:48,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017103551] [2021-06-05 07:43:48,005 INFO L462 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-06-05 07:43:48,005 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:43:48,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-06-05 07:43:48,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=734, Unknown=0, NotChecked=0, Total=812 [2021-06-05 07:43:48,006 INFO L87 Difference]: Start difference. First operand 14773 states and 40650 transitions. Second operand has 29 states, 29 states have (on average 3.7586206896551726) internal successors, (109), 29 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:43:51,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:43:51,222 INFO L93 Difference]: Finished difference Result 19029 states and 52332 transitions. [2021-06-05 07:43:51,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-06-05 07:43:51,223 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.7586206896551726) internal successors, (109), 29 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2021-06-05 07:43:51,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:43:51,243 INFO L225 Difference]: With dead ends: 19029 [2021-06-05 07:43:51,243 INFO L226 Difference]: Without dead ends: 18984 [2021-06-05 07:43:51,244 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 748 ImplicationChecksByTransitivity, 2898.0ms TimeCoverageRelationStatistics Valid=745, Invalid=3161, Unknown=0, NotChecked=0, Total=3906 [2021-06-05 07:43:51,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18984 states. [2021-06-05 07:43:51,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18984 to 14775. [2021-06-05 07:43:51,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14775 states, 14773 states have (on average 2.7519122723888176) internal successors, (40654), 14774 states have internal predecessors, (40654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:43:51,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14775 states to 14775 states and 40654 transitions. [2021-06-05 07:43:51,476 INFO L78 Accepts]: Start accepts. Automaton has 14775 states and 40654 transitions. Word has length 109 [2021-06-05 07:43:51,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:43:51,477 INFO L482 AbstractCegarLoop]: Abstraction has 14775 states and 40654 transitions. [2021-06-05 07:43:51,477 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 29 states, 29 states have (on average 3.7586206896551726) internal successors, (109), 29 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:43:51,477 INFO L276 IsEmpty]: Start isEmpty. Operand 14775 states and 40654 transitions. [2021-06-05 07:43:51,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-06-05 07:43:51,481 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:43:51,481 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:43:51,481 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-05 07:43:51,481 INFO L430 AbstractCegarLoop]: === Iteration 15 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:43:51,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:43:51,481 INFO L82 PathProgramCache]: Analyzing trace with hash 499057264, now seen corresponding path program 4 times [2021-06-05 07:43:51,481 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:43:51,481 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587767040] [2021-06-05 07:43:51,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:43:51,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:43:52,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:43:52,258 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:43:52,258 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587767040] [2021-06-05 07:43:52,258 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587767040] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:43:52,258 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:43:52,258 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-06-05 07:43:52,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535916027] [2021-06-05 07:43:52,259 INFO L462 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-06-05 07:43:52,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:43:52,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-06-05 07:43:52,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=733, Unknown=0, NotChecked=0, Total=812 [2021-06-05 07:43:52,260 INFO L87 Difference]: Start difference. First operand 14775 states and 40654 transitions. Second operand has 29 states, 29 states have (on average 3.7586206896551726) internal successors, (109), 29 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:43:53,784 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2021-06-05 07:43:54,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:43:54,841 INFO L93 Difference]: Finished difference Result 14751 states and 40605 transitions. [2021-06-05 07:43:54,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-06-05 07:43:54,841 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.7586206896551726) internal successors, (109), 29 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2021-06-05 07:43:54,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:43:54,863 INFO L225 Difference]: With dead ends: 14751 [2021-06-05 07:43:54,863 INFO L226 Difference]: Without dead ends: 14661 [2021-06-05 07:43:54,866 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 2282.5ms TimeCoverageRelationStatistics Valid=568, Invalid=2402, Unknown=0, NotChecked=0, Total=2970 [2021-06-05 07:43:54,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14661 states. [2021-06-05 07:43:55,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14661 to 13807. [2021-06-05 07:43:55,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13807 states, 13806 states have (on average 2.753585397653194) internal successors, (38016), 13806 states have internal predecessors, (38016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:43:55,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13807 states to 13807 states and 38016 transitions. [2021-06-05 07:43:55,104 INFO L78 Accepts]: Start accepts. Automaton has 13807 states and 38016 transitions. Word has length 109 [2021-06-05 07:43:55,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:43:55,104 INFO L482 AbstractCegarLoop]: Abstraction has 13807 states and 38016 transitions. [2021-06-05 07:43:55,104 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 29 states, 29 states have (on average 3.7586206896551726) internal successors, (109), 29 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:43:55,104 INFO L276 IsEmpty]: Start isEmpty. Operand 13807 states and 38016 transitions. [2021-06-05 07:43:55,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2021-06-05 07:43:55,115 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:43:55,115 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:43:55,115 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-05 07:43:55,115 INFO L430 AbstractCegarLoop]: === Iteration 16 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:43:55,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:43:55,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1047513348, now seen corresponding path program 1 times [2021-06-05 07:43:55,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:43:55,116 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159579595] [2021-06-05 07:43:55,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:43:55,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:43:55,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:43:55,149 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:43:55,150 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159579595] [2021-06-05 07:43:55,150 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159579595] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:43:55,150 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:43:55,150 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 07:43:55,150 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954773581] [2021-06-05 07:43:55,150 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 07:43:55,150 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:43:55,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 07:43:55,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 07:43:55,151 INFO L87 Difference]: Start difference. First operand 13807 states and 38016 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:43:55,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:43:55,188 INFO L93 Difference]: Finished difference Result 6740 states and 17276 transitions. [2021-06-05 07:43:55,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 07:43:55,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 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 175 [2021-06-05 07:43:55,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:43:55,198 INFO L225 Difference]: With dead ends: 6740 [2021-06-05 07:43:55,198 INFO L226 Difference]: Without dead ends: 6740 [2021-06-05 07:43:55,198 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 07:43:55,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6740 states. [2021-06-05 07:43:55,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6740 to 5486. [2021-06-05 07:43:55,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5486 states, 5484 states have (on average 2.5656455142231946) internal successors, (14070), 5485 states have internal predecessors, (14070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:43:55,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5486 states to 5486 states and 14070 transitions. [2021-06-05 07:43:55,279 INFO L78 Accepts]: Start accepts. Automaton has 5486 states and 14070 transitions. Word has length 175 [2021-06-05 07:43:55,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:43:55,279 INFO L482 AbstractCegarLoop]: Abstraction has 5486 states and 14070 transitions. [2021-06-05 07:43:55,279 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:43:55,279 INFO L276 IsEmpty]: Start isEmpty. Operand 5486 states and 14070 transitions. [2021-06-05 07:43:55,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-06-05 07:43:55,285 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:43:55,285 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:43:55,286 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-05 07:43:55,286 INFO L430 AbstractCegarLoop]: === Iteration 17 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:43:55,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:43:55,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1262899971, now seen corresponding path program 1 times [2021-06-05 07:43:55,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:43:55,286 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807760151] [2021-06-05 07:43:55,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:43:55,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:43:56,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:43:56,051 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:43:56,051 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807760151] [2021-06-05 07:43:56,051 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807760151] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:43:56,051 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:43:56,051 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-06-05 07:43:56,051 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303332395] [2021-06-05 07:43:56,052 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-06-05 07:43:56,052 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:43:56,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-06-05 07:43:56,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=754, Unknown=0, NotChecked=0, Total=870 [2021-06-05 07:43:56,053 INFO L87 Difference]: Start difference. First operand 5486 states and 14070 transitions. Second operand has 30 states, 30 states have (on average 5.866666666666666) internal successors, (176), 30 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:43:58,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:43:58,590 INFO L93 Difference]: Finished difference Result 7004 states and 17949 transitions. [2021-06-05 07:43:58,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-06-05 07:43:58,591 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.866666666666666) internal successors, (176), 30 states have internal predecessors, (176), 0 states have call successors, (0), 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 176 [2021-06-05 07:43:58,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:43:58,598 INFO L225 Difference]: With dead ends: 7004 [2021-06-05 07:43:58,598 INFO L226 Difference]: Without dead ends: 7004 [2021-06-05 07:43:58,599 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 2282.2ms TimeCoverageRelationStatistics Valid=742, Invalid=2918, Unknown=0, NotChecked=0, Total=3660 [2021-06-05 07:43:58,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7004 states. [2021-06-05 07:43:58,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7004 to 6390. [2021-06-05 07:43:58,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6390 states, 6388 states have (on average 2.5671571696931745) internal successors, (16399), 6389 states have internal predecessors, (16399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:43:58,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6390 states to 6390 states and 16399 transitions. [2021-06-05 07:43:58,675 INFO L78 Accepts]: Start accepts. Automaton has 6390 states and 16399 transitions. Word has length 176 [2021-06-05 07:43:58,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:43:58,675 INFO L482 AbstractCegarLoop]: Abstraction has 6390 states and 16399 transitions. [2021-06-05 07:43:58,675 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 5.866666666666666) internal successors, (176), 30 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:43:58,675 INFO L276 IsEmpty]: Start isEmpty. Operand 6390 states and 16399 transitions. [2021-06-05 07:43:58,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-06-05 07:43:58,683 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:43:58,683 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:43:58,683 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-05 07:43:58,683 INFO L430 AbstractCegarLoop]: === Iteration 18 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:43:58,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:43:58,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1653096047, now seen corresponding path program 2 times [2021-06-05 07:43:58,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:43:58,683 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394447496] [2021-06-05 07:43:58,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:43:58,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:43:59,588 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2021-06-05 07:44:00,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:44:00,369 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:44:00,369 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394447496] [2021-06-05 07:44:00,369 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394447496] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:44:00,369 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:44:00,369 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-06-05 07:44:00,369 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113746396] [2021-06-05 07:44:00,370 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-06-05 07:44:00,370 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:44:00,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-06-05 07:44:00,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=744, Unknown=0, NotChecked=0, Total=870 [2021-06-05 07:44:00,371 INFO L87 Difference]: Start difference. First operand 6390 states and 16399 transitions. Second operand has 30 states, 30 states have (on average 5.866666666666666) internal successors, (176), 30 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:01,307 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 63 [2021-06-05 07:44:01,489 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 61 [2021-06-05 07:44:04,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:44:04,699 INFO L93 Difference]: Finished difference Result 10620 states and 27160 transitions. [2021-06-05 07:44:04,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2021-06-05 07:44:04,699 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.866666666666666) internal successors, (176), 30 states have internal predecessors, (176), 0 states have call successors, (0), 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 176 [2021-06-05 07:44:04,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:44:04,709 INFO L225 Difference]: With dead ends: 10620 [2021-06-05 07:44:04,709 INFO L226 Difference]: Without dead ends: 10620 [2021-06-05 07:44:04,711 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 14 SyntacticMatches, 11 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1683 ImplicationChecksByTransitivity, 4269.9ms TimeCoverageRelationStatistics Valid=1093, Invalid=5069, Unknown=0, NotChecked=0, Total=6162 [2021-06-05 07:44:04,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10620 states. [2021-06-05 07:44:04,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10620 to 6993. [2021-06-05 07:44:04,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6993 states, 6991 states have (on average 2.5861822343012446) internal successors, (18080), 6992 states have internal predecessors, (18080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:04,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6993 states to 6993 states and 18080 transitions. [2021-06-05 07:44:04,808 INFO L78 Accepts]: Start accepts. Automaton has 6993 states and 18080 transitions. Word has length 176 [2021-06-05 07:44:04,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:44:04,808 INFO L482 AbstractCegarLoop]: Abstraction has 6993 states and 18080 transitions. [2021-06-05 07:44:04,809 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 5.866666666666666) internal successors, (176), 30 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:04,809 INFO L276 IsEmpty]: Start isEmpty. Operand 6993 states and 18080 transitions. [2021-06-05 07:44:04,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-06-05 07:44:04,815 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:44:04,815 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:44:04,816 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-05 07:44:04,816 INFO L430 AbstractCegarLoop]: === Iteration 19 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:44:04,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:44:04,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1036204819, now seen corresponding path program 3 times [2021-06-05 07:44:04,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:44:04,816 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102593881] [2021-06-05 07:44:04,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:44:04,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:44:05,634 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2021-06-05 07:44:06,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:44:06,363 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:44:06,363 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102593881] [2021-06-05 07:44:06,363 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102593881] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:44:06,363 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:44:06,363 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-06-05 07:44:06,364 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519251311] [2021-06-05 07:44:06,364 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-06-05 07:44:06,364 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:44:06,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-06-05 07:44:06,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=743, Unknown=0, NotChecked=0, Total=870 [2021-06-05 07:44:06,365 INFO L87 Difference]: Start difference. First operand 6993 states and 18080 transitions. Second operand has 30 states, 30 states have (on average 5.866666666666666) internal successors, (176), 30 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:07,497 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 63 [2021-06-05 07:44:07,656 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 61 [2021-06-05 07:44:10,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:44:10,009 INFO L93 Difference]: Finished difference Result 8585 states and 22068 transitions. [2021-06-05 07:44:10,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-06-05 07:44:10,010 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.866666666666666) internal successors, (176), 30 states have internal predecessors, (176), 0 states have call successors, (0), 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 176 [2021-06-05 07:44:10,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:44:10,019 INFO L225 Difference]: With dead ends: 8585 [2021-06-05 07:44:10,019 INFO L226 Difference]: Without dead ends: 8585 [2021-06-05 07:44:10,020 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 14 SyntacticMatches, 11 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1154 ImplicationChecksByTransitivity, 3529.5ms TimeCoverageRelationStatistics Valid=840, Invalid=3716, Unknown=0, NotChecked=0, Total=4556 [2021-06-05 07:44:10,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8585 states. [2021-06-05 07:44:10,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8585 to 6997. [2021-06-05 07:44:10,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6997 states, 6995 states have (on average 2.5858470335954253) internal successors, (18088), 6996 states have internal predecessors, (18088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:10,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6997 states to 6997 states and 18088 transitions. [2021-06-05 07:44:10,108 INFO L78 Accepts]: Start accepts. Automaton has 6997 states and 18088 transitions. Word has length 176 [2021-06-05 07:44:10,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:44:10,109 INFO L482 AbstractCegarLoop]: Abstraction has 6997 states and 18088 transitions. [2021-06-05 07:44:10,109 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 5.866666666666666) internal successors, (176), 30 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:10,109 INFO L276 IsEmpty]: Start isEmpty. Operand 6997 states and 18088 transitions. [2021-06-05 07:44:10,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-06-05 07:44:10,115 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:44:10,116 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:44:10,116 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-05 07:44:10,116 INFO L430 AbstractCegarLoop]: === Iteration 20 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:44:10,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:44:10,116 INFO L82 PathProgramCache]: Analyzing trace with hash -2040515061, now seen corresponding path program 4 times [2021-06-05 07:44:10,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:44:10,116 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675942729] [2021-06-05 07:44:10,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:44:10,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:44:11,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:44:11,169 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:44:11,169 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675942729] [2021-06-05 07:44:11,169 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675942729] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:44:11,169 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:44:11,169 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2021-06-05 07:44:11,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879123654] [2021-06-05 07:44:11,169 INFO L462 AbstractCegarLoop]: Interpolant automaton has 37 states [2021-06-05 07:44:11,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:44:11,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-06-05 07:44:11,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1182, Unknown=0, NotChecked=0, Total=1332 [2021-06-05 07:44:11,170 INFO L87 Difference]: Start difference. First operand 6997 states and 18088 transitions. Second operand has 37 states, 37 states have (on average 4.756756756756757) internal successors, (176), 37 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:14,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:44:14,994 INFO L93 Difference]: Finished difference Result 11727 states and 30452 transitions. [2021-06-05 07:44:14,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-06-05 07:44:14,994 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 4.756756756756757) internal successors, (176), 37 states have internal predecessors, (176), 0 states have call successors, (0), 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 176 [2021-06-05 07:44:14,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:44:15,005 INFO L225 Difference]: With dead ends: 11727 [2021-06-05 07:44:15,005 INFO L226 Difference]: Without dead ends: 11727 [2021-06-05 07:44:15,006 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1376 ImplicationChecksByTransitivity, 3568.5ms TimeCoverageRelationStatistics Valid=1144, Invalid=4708, Unknown=0, NotChecked=0, Total=5852 [2021-06-05 07:44:15,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11727 states. [2021-06-05 07:44:15,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11727 to 9848. [2021-06-05 07:44:15,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9848 states, 9846 states have (on average 2.606032906764168) internal successors, (25659), 9847 states have internal predecessors, (25659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:15,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9848 states to 9848 states and 25659 transitions. [2021-06-05 07:44:15,153 INFO L78 Accepts]: Start accepts. Automaton has 9848 states and 25659 transitions. Word has length 176 [2021-06-05 07:44:15,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:44:15,155 INFO L482 AbstractCegarLoop]: Abstraction has 9848 states and 25659 transitions. [2021-06-05 07:44:15,155 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 37 states, 37 states have (on average 4.756756756756757) internal successors, (176), 37 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:15,155 INFO L276 IsEmpty]: Start isEmpty. Operand 9848 states and 25659 transitions. [2021-06-05 07:44:15,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-06-05 07:44:15,166 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:44:15,166 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:44:15,166 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-05 07:44:15,166 INFO L430 AbstractCegarLoop]: === Iteration 21 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:44:15,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:44:15,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1403664336, now seen corresponding path program 1 times [2021-06-05 07:44:15,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:44:15,167 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467878498] [2021-06-05 07:44:15,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:44:15,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:44:15,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:44:15,871 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:44:15,871 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467878498] [2021-06-05 07:44:15,871 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467878498] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:44:15,871 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:44:15,871 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-06-05 07:44:15,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604478003] [2021-06-05 07:44:15,871 INFO L462 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-06-05 07:44:15,872 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:44:15,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-06-05 07:44:15,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=701, Unknown=0, NotChecked=0, Total=812 [2021-06-05 07:44:15,872 INFO L87 Difference]: Start difference. First operand 9848 states and 25659 transitions. Second operand has 29 states, 29 states have (on average 6.206896551724138) internal successors, (180), 29 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:18,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:44:18,908 INFO L93 Difference]: Finished difference Result 13837 states and 35824 transitions. [2021-06-05 07:44:18,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-06-05 07:44:18,908 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 6.206896551724138) internal successors, (180), 29 states have internal predecessors, (180), 0 states have call successors, (0), 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 180 [2021-06-05 07:44:18,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:44:18,924 INFO L225 Difference]: With dead ends: 13837 [2021-06-05 07:44:18,924 INFO L226 Difference]: Without dead ends: 13837 [2021-06-05 07:44:18,925 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 2652.0ms TimeCoverageRelationStatistics Valid=951, Invalid=3339, Unknown=0, NotChecked=0, Total=4290 [2021-06-05 07:44:18,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13837 states. [2021-06-05 07:44:19,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13837 to 9864. [2021-06-05 07:44:19,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9864 states, 9862 states have (on average 2.6050496856621375) internal successors, (25691), 9863 states have internal predecessors, (25691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:19,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9864 states to 9864 states and 25691 transitions. [2021-06-05 07:44:19,082 INFO L78 Accepts]: Start accepts. Automaton has 9864 states and 25691 transitions. Word has length 180 [2021-06-05 07:44:19,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:44:19,083 INFO L482 AbstractCegarLoop]: Abstraction has 9864 states and 25691 transitions. [2021-06-05 07:44:19,083 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 29 states, 29 states have (on average 6.206896551724138) internal successors, (180), 29 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:19,083 INFO L276 IsEmpty]: Start isEmpty. Operand 9864 states and 25691 transitions. [2021-06-05 07:44:19,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-06-05 07:44:19,091 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:44:19,091 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:44:19,091 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-05 07:44:19,091 INFO L430 AbstractCegarLoop]: === Iteration 22 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:44:19,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:44:19,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1316382846, now seen corresponding path program 2 times [2021-06-05 07:44:19,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:44:19,092 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137885652] [2021-06-05 07:44:19,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:44:19,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:44:19,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:44:19,744 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:44:19,744 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137885652] [2021-06-05 07:44:19,744 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137885652] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:44:19,744 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:44:19,744 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-06-05 07:44:19,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863235142] [2021-06-05 07:44:19,744 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 07:44:19,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:44:19,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 07:44:19,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2021-06-05 07:44:19,745 INFO L87 Difference]: Start difference. First operand 9864 states and 25691 transitions. Second operand has 28 states, 28 states have (on average 6.428571428571429) internal successors, (180), 28 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:21,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:44:21,631 INFO L93 Difference]: Finished difference Result 8430 states and 21662 transitions. [2021-06-05 07:44:21,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-06-05 07:44:21,631 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 6.428571428571429) internal successors, (180), 28 states have internal predecessors, (180), 0 states have call successors, (0), 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 180 [2021-06-05 07:44:21,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:44:21,640 INFO L225 Difference]: With dead ends: 8430 [2021-06-05 07:44:21,640 INFO L226 Difference]: Without dead ends: 8430 [2021-06-05 07:44:21,641 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 1726.4ms TimeCoverageRelationStatistics Valid=610, Invalid=2146, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 07:44:21,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8430 states. [2021-06-05 07:44:21,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8430 to 8026. [2021-06-05 07:44:21,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8026 states, 8024 states have (on average 2.5742771684945165) internal successors, (20656), 8025 states have internal predecessors, (20656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:21,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8026 states to 8026 states and 20656 transitions. [2021-06-05 07:44:21,736 INFO L78 Accepts]: Start accepts. Automaton has 8026 states and 20656 transitions. Word has length 180 [2021-06-05 07:44:21,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:44:21,736 INFO L482 AbstractCegarLoop]: Abstraction has 8026 states and 20656 transitions. [2021-06-05 07:44:21,736 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 6.428571428571429) internal successors, (180), 28 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:21,736 INFO L276 IsEmpty]: Start isEmpty. Operand 8026 states and 20656 transitions. [2021-06-05 07:44:21,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 07:44:21,743 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:44:21,743 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:44:21,743 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-06-05 07:44:21,743 INFO L430 AbstractCegarLoop]: === Iteration 23 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:44:21,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:44:21,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1724116409, now seen corresponding path program 1 times [2021-06-05 07:44:21,744 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:44:21,744 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050383460] [2021-06-05 07:44:21,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:44:21,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:44:22,486 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 07:44:22,684 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2021-06-05 07:44:22,839 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2021-06-05 07:44:23,156 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2021-06-05 07:44:23,356 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2021-06-05 07:44:24,180 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2021-06-05 07:44:26,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:44:26,940 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:44:26,940 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050383460] [2021-06-05 07:44:26,940 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050383460] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:44:26,940 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:44:26,940 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 07:44:26,940 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010282623] [2021-06-05 07:44:26,940 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 07:44:26,941 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:44:26,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 07:44:26,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2572, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 07:44:26,942 INFO L87 Difference]: Start difference. First operand 8026 states and 20656 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:30,686 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 53 [2021-06-05 07:44:31,092 WARN L205 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 78 [2021-06-05 07:44:31,497 WARN L205 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 76 [2021-06-05 07:44:34,108 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 07:44:34,410 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-05 07:44:34,751 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2021-06-05 07:44:37,218 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 07:44:40,042 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2021-06-05 07:44:40,694 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 07:44:42,520 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 07:44:43,338 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 07:44:44,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:44:44,187 INFO L93 Difference]: Finished difference Result 11919 states and 30719 transitions. [2021-06-05 07:44:44,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2021-06-05 07:44:44,187 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 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 184 [2021-06-05 07:44:44,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:44:44,200 INFO L225 Difference]: With dead ends: 11919 [2021-06-05 07:44:44,200 INFO L226 Difference]: Without dead ends: 11499 [2021-06-05 07:44:44,202 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 23 SyntacticMatches, 6 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4391 ImplicationChecksByTransitivity, 13733.7ms TimeCoverageRelationStatistics Valid=1520, Invalid=14736, Unknown=0, NotChecked=0, Total=16256 [2021-06-05 07:44:44,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11499 states. [2021-06-05 07:44:44,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11499 to 9438. [2021-06-05 07:44:44,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9438 states, 9436 states have (on average 2.5559559135226793) internal successors, (24118), 9437 states have internal predecessors, (24118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:44,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9438 states to 9438 states and 24118 transitions. [2021-06-05 07:44:44,317 INFO L78 Accepts]: Start accepts. Automaton has 9438 states and 24118 transitions. Word has length 184 [2021-06-05 07:44:44,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:44:44,318 INFO L482 AbstractCegarLoop]: Abstraction has 9438 states and 24118 transitions. [2021-06-05 07:44:44,318 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:44,318 INFO L276 IsEmpty]: Start isEmpty. Operand 9438 states and 24118 transitions. [2021-06-05 07:44:44,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 07:44:44,327 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:44:44,328 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:44:44,328 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-06-05 07:44:44,328 INFO L430 AbstractCegarLoop]: === Iteration 24 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:44:44,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:44:44,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1443982125, now seen corresponding path program 2 times [2021-06-05 07:44:44,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:44:44,329 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486840280] [2021-06-05 07:44:44,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:44:44,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:44:44,986 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 07:44:45,199 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2021-06-05 07:44:46,636 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 07:44:46,887 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2021-06-05 07:44:48,466 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2021-06-05 07:44:49,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:44:49,892 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:44:49,892 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486840280] [2021-06-05 07:44:49,892 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486840280] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:44:49,892 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:44:49,892 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 07:44:49,893 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771684816] [2021-06-05 07:44:49,893 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 07:44:49,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:44:49,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 07:44:49,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=2574, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 07:44:49,894 INFO L87 Difference]: Start difference. First operand 9438 states and 24118 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:53,746 WARN L205 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 78 [2021-06-05 07:44:54,401 WARN L205 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 76 [2021-06-05 07:44:55,759 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2021-06-05 07:44:58,066 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 07:44:58,388 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-05 07:44:58,769 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2021-06-05 07:44:59,268 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2021-06-05 07:45:00,669 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 07:45:02,995 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 07:45:05,236 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 07:45:06,261 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 07:45:07,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:45:07,329 INFO L93 Difference]: Finished difference Result 13443 states and 34525 transitions. [2021-06-05 07:45:07,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-06-05 07:45:07,329 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 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 184 [2021-06-05 07:45:07,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:45:07,347 INFO L225 Difference]: With dead ends: 13443 [2021-06-05 07:45:07,348 INFO L226 Difference]: Without dead ends: 13023 [2021-06-05 07:45:07,351 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 20 SyntacticMatches, 7 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4459 ImplicationChecksByTransitivity, 14737.3ms TimeCoverageRelationStatistics Valid=1538, Invalid=14974, Unknown=0, NotChecked=0, Total=16512 [2021-06-05 07:45:07,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13023 states. [2021-06-05 07:45:07,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13023 to 9438. [2021-06-05 07:45:07,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9438 states, 9436 states have (on average 2.5559559135226793) internal successors, (24118), 9437 states have internal predecessors, (24118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:07,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9438 states to 9438 states and 24118 transitions. [2021-06-05 07:45:07,523 INFO L78 Accepts]: Start accepts. Automaton has 9438 states and 24118 transitions. Word has length 184 [2021-06-05 07:45:07,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:45:07,524 INFO L482 AbstractCegarLoop]: Abstraction has 9438 states and 24118 transitions. [2021-06-05 07:45:07,524 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:07,524 INFO L276 IsEmpty]: Start isEmpty. Operand 9438 states and 24118 transitions. [2021-06-05 07:45:07,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 07:45:07,560 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:45:07,560 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:45:07,560 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-06-05 07:45:07,560 INFO L430 AbstractCegarLoop]: === Iteration 25 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:45:07,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:45:07,561 INFO L82 PathProgramCache]: Analyzing trace with hash -679804985, now seen corresponding path program 3 times [2021-06-05 07:45:07,561 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:45:07,561 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747490431] [2021-06-05 07:45:07,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:45:07,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:45:08,499 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 07:45:08,651 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2021-06-05 07:45:08,816 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2021-06-05 07:45:09,891 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 07:45:12,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:45:12,860 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:45:12,860 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747490431] [2021-06-05 07:45:12,860 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747490431] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:45:12,860 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:45:12,860 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 07:45:12,861 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181993551] [2021-06-05 07:45:12,861 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 07:45:12,861 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:45:12,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 07:45:12,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=2577, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 07:45:12,870 INFO L87 Difference]: Start difference. First operand 9438 states and 24118 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:17,221 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 51 [2021-06-05 07:45:17,599 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 53 [2021-06-05 07:45:18,374 WARN L205 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 78 [2021-06-05 07:45:19,129 WARN L205 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 76 [2021-06-05 07:45:20,641 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 65 [2021-06-05 07:45:22,582 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 07:45:22,827 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-05 07:45:23,078 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2021-06-05 07:45:24,766 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 07:45:26,690 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2021-06-05 07:45:27,063 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 07:45:29,300 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 07:45:30,338 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 07:45:31,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:45:31,225 INFO L93 Difference]: Finished difference Result 13507 states and 34685 transitions. [2021-06-05 07:45:31,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2021-06-05 07:45:31,225 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 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 184 [2021-06-05 07:45:31,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:45:31,239 INFO L225 Difference]: With dead ends: 13507 [2021-06-05 07:45:31,239 INFO L226 Difference]: Without dead ends: 13087 [2021-06-05 07:45:31,241 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4619 ImplicationChecksByTransitivity, 15911.6ms TimeCoverageRelationStatistics Valid=1581, Invalid=15449, Unknown=0, NotChecked=0, Total=17030 [2021-06-05 07:45:31,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13087 states. [2021-06-05 07:45:31,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13087 to 9438. [2021-06-05 07:45:31,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9438 states, 9436 states have (on average 2.5559559135226793) internal successors, (24118), 9437 states have internal predecessors, (24118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:31,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9438 states to 9438 states and 24118 transitions. [2021-06-05 07:45:31,369 INFO L78 Accepts]: Start accepts. Automaton has 9438 states and 24118 transitions. Word has length 184 [2021-06-05 07:45:31,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:45:31,370 INFO L482 AbstractCegarLoop]: Abstraction has 9438 states and 24118 transitions. [2021-06-05 07:45:31,370 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:31,370 INFO L276 IsEmpty]: Start isEmpty. Operand 9438 states and 24118 transitions. [2021-06-05 07:45:31,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 07:45:31,378 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:45:31,378 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:45:31,378 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-06-05 07:45:31,378 INFO L430 AbstractCegarLoop]: === Iteration 26 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:45:31,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:45:31,378 INFO L82 PathProgramCache]: Analyzing trace with hash 99175469, now seen corresponding path program 4 times [2021-06-05 07:45:31,379 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:45:31,379 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626379525] [2021-06-05 07:45:31,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:45:31,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:45:32,120 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 07:45:33,421 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 07:45:36,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:45:36,216 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:45:36,216 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626379525] [2021-06-05 07:45:36,216 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626379525] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:45:36,216 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:45:36,216 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 07:45:36,216 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097665248] [2021-06-05 07:45:36,217 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 07:45:36,217 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:45:36,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 07:45:36,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2578, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 07:45:36,218 INFO L87 Difference]: Start difference. First operand 9438 states and 24118 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:40,378 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 48 [2021-06-05 07:45:41,197 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 53 [2021-06-05 07:45:41,991 WARN L205 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 78 [2021-06-05 07:45:42,768 WARN L205 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 76 [2021-06-05 07:45:44,375 WARN L205 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 68 [2021-06-05 07:45:46,370 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 07:45:46,628 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-05 07:45:46,901 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2021-06-05 07:45:48,622 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 07:45:50,873 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 07:45:53,063 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 07:45:54,073 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 07:45:54,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:45:54,984 INFO L93 Difference]: Finished difference Result 13491 states and 34649 transitions. [2021-06-05 07:45:54,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2021-06-05 07:45:54,984 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 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 184 [2021-06-05 07:45:54,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:45:54,999 INFO L225 Difference]: With dead ends: 13491 [2021-06-05 07:45:54,999 INFO L226 Difference]: Without dead ends: 13071 [2021-06-05 07:45:55,000 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4692 ImplicationChecksByTransitivity, 15496.5ms TimeCoverageRelationStatistics Valid=1608, Invalid=15684, Unknown=0, NotChecked=0, Total=17292 [2021-06-05 07:45:55,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13071 states. [2021-06-05 07:45:55,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13071 to 9438. [2021-06-05 07:45:55,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9438 states, 9436 states have (on average 2.5559559135226793) internal successors, (24118), 9437 states have internal predecessors, (24118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:55,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9438 states to 9438 states and 24118 transitions. [2021-06-05 07:45:55,131 INFO L78 Accepts]: Start accepts. Automaton has 9438 states and 24118 transitions. Word has length 184 [2021-06-05 07:45:55,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:45:55,132 INFO L482 AbstractCegarLoop]: Abstraction has 9438 states and 24118 transitions. [2021-06-05 07:45:55,132 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:55,132 INFO L276 IsEmpty]: Start isEmpty. Operand 9438 states and 24118 transitions. [2021-06-05 07:45:55,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 07:45:55,139 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:45:55,139 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:45:55,139 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-06-05 07:45:55,139 INFO L430 AbstractCegarLoop]: === Iteration 27 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:45:55,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:45:55,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1825177785, now seen corresponding path program 5 times [2021-06-05 07:45:55,140 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:45:55,140 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201526634] [2021-06-05 07:45:55,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:45:55,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:45:55,872 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 07:45:56,554 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2021-06-05 07:45:57,412 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 07:46:00,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:46:00,051 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:46:00,052 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201526634] [2021-06-05 07:46:00,052 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201526634] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:46:00,052 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:46:00,052 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 07:46:00,052 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886861310] [2021-06-05 07:46:00,052 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 07:46:00,052 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:46:00,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 07:46:00,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=2580, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 07:46:00,053 INFO L87 Difference]: Start difference. First operand 9438 states and 24118 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:03,894 WARN L205 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 70 [2021-06-05 07:46:04,475 WARN L205 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 68 [2021-06-05 07:46:05,920 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 48 [2021-06-05 07:46:06,435 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 51 [2021-06-05 07:46:07,023 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 53 [2021-06-05 07:46:07,840 WARN L205 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 78 [2021-06-05 07:46:08,517 WARN L205 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 07:46:09,371 WARN L205 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 76 [2021-06-05 07:46:10,200 WARN L205 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 72 [2021-06-05 07:46:12,630 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2021-06-05 07:46:14,799 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 07:46:15,206 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-05 07:46:15,614 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2021-06-05 07:46:17,341 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 07:46:19,407 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2021-06-05 07:46:19,782 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 07:46:22,181 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 07:46:23,293 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 07:46:24,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:46:24,453 INFO L93 Difference]: Finished difference Result 13595 states and 34905 transitions. [2021-06-05 07:46:24,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2021-06-05 07:46:24,453 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 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 184 [2021-06-05 07:46:24,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:46:24,467 INFO L225 Difference]: With dead ends: 13595 [2021-06-05 07:46:24,467 INFO L226 Difference]: Without dead ends: 13175 [2021-06-05 07:46:24,469 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5122 ImplicationChecksByTransitivity, 18640.7ms TimeCoverageRelationStatistics Valid=1724, Invalid=16908, Unknown=0, NotChecked=0, Total=18632 [2021-06-05 07:46:24,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13175 states. [2021-06-05 07:46:24,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13175 to 9438. [2021-06-05 07:46:24,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9438 states, 9436 states have (on average 2.5559559135226793) internal successors, (24118), 9437 states have internal predecessors, (24118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:24,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9438 states to 9438 states and 24118 transitions. [2021-06-05 07:46:24,597 INFO L78 Accepts]: Start accepts. Automaton has 9438 states and 24118 transitions. Word has length 184 [2021-06-05 07:46:24,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:46:24,598 INFO L482 AbstractCegarLoop]: Abstraction has 9438 states and 24118 transitions. [2021-06-05 07:46:24,598 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:24,598 INFO L276 IsEmpty]: Start isEmpty. Operand 9438 states and 24118 transitions. [2021-06-05 07:46:24,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 07:46:24,605 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:46:24,605 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:46:24,605 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-06-05 07:46:24,605 INFO L430 AbstractCegarLoop]: === Iteration 28 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:46:24,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:46:24,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1959078739, now seen corresponding path program 6 times [2021-06-05 07:46:24,606 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:46:24,606 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321611046] [2021-06-05 07:46:24,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:46:24,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:46:25,414 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 07:46:25,600 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2021-06-05 07:46:27,541 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 07:46:31,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:46:31,809 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:46:31,809 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321611046] [2021-06-05 07:46:31,809 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321611046] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:46:31,809 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:46:31,810 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 07:46:31,810 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879735499] [2021-06-05 07:46:31,810 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 07:46:31,810 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:46:31,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 07:46:31,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2583, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 07:46:31,810 INFO L87 Difference]: Start difference. First operand 9438 states and 24118 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:34,551 WARN L205 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 07:46:35,028 WARN L205 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2021-06-05 07:46:36,305 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 48 [2021-06-05 07:46:36,792 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 51 [2021-06-05 07:46:37,226 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 53 [2021-06-05 07:46:37,987 WARN L205 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 78 [2021-06-05 07:46:38,745 WARN L205 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 76 [2021-06-05 07:46:41,662 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 07:46:41,967 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-05 07:46:42,302 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2021-06-05 07:46:44,729 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 07:46:47,342 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2021-06-05 07:46:48,099 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 07:46:50,922 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 07:46:52,356 WARN L205 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 07:46:52,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:46:52,982 INFO L93 Difference]: Finished difference Result 13507 states and 34707 transitions. [2021-06-05 07:46:52,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2021-06-05 07:46:52,982 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 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 184 [2021-06-05 07:46:52,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:46:52,996 INFO L225 Difference]: With dead ends: 13507 [2021-06-05 07:46:52,996 INFO L226 Difference]: Without dead ends: 13087 [2021-06-05 07:46:52,997 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4837 ImplicationChecksByTransitivity, 18578.0ms TimeCoverageRelationStatistics Valid=1646, Invalid=16176, Unknown=0, NotChecked=0, Total=17822 [2021-06-05 07:46:53,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13087 states. [2021-06-05 07:46:53,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13087 to 9516. [2021-06-05 07:46:53,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9516 states, 9514 states have (on average 2.5570737859995796) internal successors, (24328), 9515 states have internal predecessors, (24328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:53,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9516 states to 9516 states and 24328 transitions. [2021-06-05 07:46:53,121 INFO L78 Accepts]: Start accepts. Automaton has 9516 states and 24328 transitions. Word has length 184 [2021-06-05 07:46:53,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:46:53,121 INFO L482 AbstractCegarLoop]: Abstraction has 9516 states and 24328 transitions. [2021-06-05 07:46:53,121 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:53,121 INFO L276 IsEmpty]: Start isEmpty. Operand 9516 states and 24328 transitions. [2021-06-05 07:46:53,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 07:46:53,129 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:46:53,130 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:46:53,130 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-06-05 07:46:53,130 INFO L430 AbstractCegarLoop]: === Iteration 29 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:46:53,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:46:53,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1545636179, now seen corresponding path program 7 times [2021-06-05 07:46:53,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:46:53,130 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548960196] [2021-06-05 07:46:53,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:46:53,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:46:53,800 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 07:46:53,967 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2021-06-05 07:46:54,131 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2021-06-05 07:46:55,228 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 07:46:58,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:46:58,251 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:46:58,251 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548960196] [2021-06-05 07:46:58,252 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548960196] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:46:58,252 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:46:58,252 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 07:46:58,252 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610688744] [2021-06-05 07:46:58,252 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 07:46:58,252 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:46:58,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 07:46:58,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=2585, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 07:46:58,253 INFO L87 Difference]: Start difference. First operand 9516 states and 24328 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:47:01,734 WARN L205 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 07:47:02,373 WARN L205 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2021-06-05 07:47:03,862 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 48 [2021-06-05 07:47:04,440 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 51 [2021-06-05 07:47:05,043 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 53 [2021-06-05 07:47:06,052 WARN L205 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 78 [2021-06-05 07:47:07,120 WARN L205 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 76 [2021-06-05 07:47:11,102 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 07:47:11,433 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-05 07:47:11,774 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2021-06-05 07:47:14,199 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 07:47:16,298 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 07:47:18,253 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 07:47:19,128 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 07:47:19,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:47:19,859 INFO L93 Difference]: Finished difference Result 13448 states and 34580 transitions. [2021-06-05 07:47:19,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2021-06-05 07:47:19,860 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 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 184 [2021-06-05 07:47:19,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:47:19,877 INFO L225 Difference]: With dead ends: 13448 [2021-06-05 07:47:19,878 INFO L226 Difference]: Without dead ends: 13028 [2021-06-05 07:47:19,879 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5069 ImplicationChecksByTransitivity, 17484.5ms TimeCoverageRelationStatistics Valid=1675, Invalid=16957, Unknown=0, NotChecked=0, Total=18632 [2021-06-05 07:47:19,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13028 states. [2021-06-05 07:47:19,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13028 to 9529. [2021-06-05 07:47:20,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9529 states, 9527 states have (on average 2.557258318463315) internal successors, (24363), 9528 states have internal predecessors, (24363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:47:20,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9529 states to 9529 states and 24363 transitions. [2021-06-05 07:47:20,017 INFO L78 Accepts]: Start accepts. Automaton has 9529 states and 24363 transitions. Word has length 184 [2021-06-05 07:47:20,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:47:20,018 INFO L482 AbstractCegarLoop]: Abstraction has 9529 states and 24363 transitions. [2021-06-05 07:47:20,018 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:47:20,018 INFO L276 IsEmpty]: Start isEmpty. Operand 9529 states and 24363 transitions. [2021-06-05 07:47:20,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 07:47:20,026 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:47:20,026 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:47:20,026 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-06-05 07:47:20,026 INFO L430 AbstractCegarLoop]: === Iteration 30 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:47:20,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:47:20,026 INFO L82 PathProgramCache]: Analyzing trace with hash 938788039, now seen corresponding path program 8 times [2021-06-05 07:47:20,027 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:47:20,027 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318354368] [2021-06-05 07:47:20,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:47:20,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:47:20,696 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 07:47:22,267 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 07:47:25,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:47:25,732 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:47:25,732 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318354368] [2021-06-05 07:47:25,732 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318354368] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:47:25,732 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:47:25,732 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 07:47:25,732 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313588672] [2021-06-05 07:47:25,732 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 07:47:25,732 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:47:25,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 07:47:25,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=2585, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 07:47:25,733 INFO L87 Difference]: Start difference. First operand 9529 states and 24363 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:47:30,333 WARN L205 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 07:47:31,029 WARN L205 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2021-06-05 07:47:32,643 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 48 [2021-06-05 07:47:33,242 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 51 [2021-06-05 07:47:33,882 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 53 [2021-06-05 07:47:34,991 WARN L205 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 78 [2021-06-05 07:47:36,137 WARN L205 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 76 [2021-06-05 07:47:39,586 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 07:47:39,844 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-05 07:47:40,104 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2021-06-05 07:47:41,927 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 07:47:44,420 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 07:47:46,805 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 07:47:47,911 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 07:47:49,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:47:49,015 INFO L93 Difference]: Finished difference Result 13461 states and 34615 transitions. [2021-06-05 07:47:49,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2021-06-05 07:47:49,016 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 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 184 [2021-06-05 07:47:49,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:47:49,032 INFO L225 Difference]: With dead ends: 13461 [2021-06-05 07:47:49,032 INFO L226 Difference]: Without dead ends: 13041 [2021-06-05 07:47:49,033 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5361 ImplicationChecksByTransitivity, 18993.7ms TimeCoverageRelationStatistics Valid=1712, Invalid=17748, Unknown=0, NotChecked=0, Total=19460 [2021-06-05 07:47:49,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13041 states. [2021-06-05 07:47:49,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13041 to 9542. [2021-06-05 07:47:49,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9542 states, 9540 states have (on average 2.5574423480083857) internal successors, (24398), 9541 states have internal predecessors, (24398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:47:49,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9542 states to 9542 states and 24398 transitions. [2021-06-05 07:47:49,166 INFO L78 Accepts]: Start accepts. Automaton has 9542 states and 24398 transitions. Word has length 184 [2021-06-05 07:47:49,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:47:49,166 INFO L482 AbstractCegarLoop]: Abstraction has 9542 states and 24398 transitions. [2021-06-05 07:47:49,166 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:47:49,166 INFO L276 IsEmpty]: Start isEmpty. Operand 9542 states and 24398 transitions. [2021-06-05 07:47:49,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 07:47:49,174 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:47:49,174 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:47:49,174 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-06-05 07:47:49,174 INFO L430 AbstractCegarLoop]: === Iteration 31 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:47:49,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:47:49,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1640877331, now seen corresponding path program 9 times [2021-06-05 07:47:49,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:47:49,174 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522051656] [2021-06-05 07:47:49,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:47:49,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:47:49,993 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 07:47:50,418 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2021-06-05 07:47:52,354 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 07:47:57,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:47:57,046 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:47:57,046 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522051656] [2021-06-05 07:47:57,046 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522051656] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:47:57,046 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:47:57,046 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 07:47:57,046 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017465707] [2021-06-05 07:47:57,046 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 07:47:57,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:47:57,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 07:47:57,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2572, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 07:47:57,047 INFO L87 Difference]: Start difference. First operand 9542 states and 24398 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:48:01,695 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 40 [2021-06-05 07:48:02,680 WARN L205 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 07:48:03,073 WARN L205 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2021-06-05 07:48:04,634 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 51 [2021-06-05 07:48:05,016 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 53 [2021-06-05 07:48:05,812 WARN L205 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 78 [2021-06-05 07:48:06,596 WARN L205 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 76 [2021-06-05 07:48:10,862 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 07:48:11,196 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-05 07:48:11,574 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2021-06-05 07:48:14,392 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 07:48:18,088 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 07:48:21,325 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 07:48:22,812 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 07:48:24,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:48:24,746 INFO L93 Difference]: Finished difference Result 14681 states and 37799 transitions. [2021-06-05 07:48:24,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2021-06-05 07:48:24,747 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 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 184 [2021-06-05 07:48:24,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:48:24,765 INFO L225 Difference]: With dead ends: 14681 [2021-06-05 07:48:24,765 INFO L226 Difference]: Without dead ends: 14261 [2021-06-05 07:48:24,766 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 20 SyntacticMatches, 7 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5272 ImplicationChecksByTransitivity, 21088.2ms TimeCoverageRelationStatistics Valid=1786, Invalid=17396, Unknown=0, NotChecked=0, Total=19182 [2021-06-05 07:48:24,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14261 states. [2021-06-05 07:48:24,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14261 to 9646. [2021-06-05 07:48:24,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9646 states, 9644 states have (on average 2.5588967233513067) internal successors, (24678), 9645 states have internal predecessors, (24678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:48:24,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9646 states to 9646 states and 24678 transitions. [2021-06-05 07:48:24,902 INFO L78 Accepts]: Start accepts. Automaton has 9646 states and 24678 transitions. Word has length 184 [2021-06-05 07:48:24,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:48:24,902 INFO L482 AbstractCegarLoop]: Abstraction has 9646 states and 24678 transitions. [2021-06-05 07:48:24,902 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:48:24,902 INFO L276 IsEmpty]: Start isEmpty. Operand 9646 states and 24678 transitions. [2021-06-05 07:48:24,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 07:48:24,910 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:48:24,910 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:48:24,910 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-06-05 07:48:24,910 INFO L430 AbstractCegarLoop]: === Iteration 32 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:48:24,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:48:24,911 INFO L82 PathProgramCache]: Analyzing trace with hash -761059539, now seen corresponding path program 10 times [2021-06-05 07:48:24,911 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:48:24,911 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442699921] [2021-06-05 07:48:24,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:48:24,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:48:25,816 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 07:48:26,501 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2021-06-05 07:48:26,824 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2021-06-05 07:48:27,153 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2021-06-05 07:48:27,496 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2021-06-05 07:48:27,768 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2021-06-05 07:48:28,464 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2021-06-05 07:48:29,323 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 07:48:34,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-06-05 07:48:34,649 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:48:34,650 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442699921] [2021-06-05 07:48:34,650 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442699921] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:48:34,650 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:48:34,650 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 07:48:34,650 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868321735] [2021-06-05 07:48:34,650 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 07:48:34,650 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:48:34,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 07:48:34,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2555, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 07:48:34,651 INFO L87 Difference]: Start difference. First operand 9646 states and 24678 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:48:37,372 WARN L205 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 07:48:37,877 WARN L205 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2021-06-05 07:48:39,814 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 53 [2021-06-05 07:48:40,565 WARN L205 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 78 [2021-06-05 07:48:41,300 WARN L205 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 76 [2021-06-05 07:48:44,820 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 07:48:45,134 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-05 07:48:45,407 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2021-06-05 07:48:47,662 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 07:48:50,827 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 07:48:53,564 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 07:48:54,725 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 07:48:56,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:48:56,116 INFO L93 Difference]: Finished difference Result 14609 states and 37563 transitions. [2021-06-05 07:48:56,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2021-06-05 07:48:56,117 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 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 184 [2021-06-05 07:48:56,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:48:56,132 INFO L225 Difference]: With dead ends: 14609 [2021-06-05 07:48:56,133 INFO L226 Difference]: Without dead ends: 14189 [2021-06-05 07:48:56,135 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 20 SyntacticMatches, 7 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5346 ImplicationChecksByTransitivity, 21616.9ms TimeCoverageRelationStatistics Valid=1896, Invalid=17286, Unknown=0, NotChecked=0, Total=19182 [2021-06-05 07:48:56,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14189 states. [2021-06-05 07:48:56,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14189 to 9659. [2021-06-05 07:48:56,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9659 states, 9657 states have (on average 2.5590763176970075) internal successors, (24713), 9658 states have internal predecessors, (24713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:48:56,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9659 states to 9659 states and 24713 transitions. [2021-06-05 07:48:56,273 INFO L78 Accepts]: Start accepts. Automaton has 9659 states and 24713 transitions. Word has length 184 [2021-06-05 07:48:56,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:48:56,273 INFO L482 AbstractCegarLoop]: Abstraction has 9659 states and 24713 transitions. [2021-06-05 07:48:56,273 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:48:56,273 INFO L276 IsEmpty]: Start isEmpty. Operand 9659 states and 24713 transitions. [2021-06-05 07:48:56,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 07:48:56,281 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:48:56,281 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:48:56,281 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-06-05 07:48:56,282 INFO L430 AbstractCegarLoop]: === Iteration 33 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:48:56,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:48:56,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1135479111, now seen corresponding path program 11 times [2021-06-05 07:48:56,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:48:56,282 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301668182] [2021-06-05 07:48:56,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:48:56,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:48:56,890 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-05 07:48:57,181 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 07:48:57,485 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2021-06-05 07:48:57,786 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2021-06-05 07:48:58,093 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2021-06-05 07:48:58,412 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2021-06-05 07:48:58,682 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2021-06-05 07:48:59,382 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2021-06-05 07:49:00,219 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 07:49:04,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:49:04,395 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:49:04,396 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301668182] [2021-06-05 07:49:04,396 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301668182] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:49:04,396 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:49:04,396 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 07:49:04,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946779224] [2021-06-05 07:49:04,396 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 07:49:04,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:49:04,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 07:49:04,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=2559, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 07:49:04,397 INFO L87 Difference]: Start difference. First operand 9659 states and 24713 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:07,133 WARN L205 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 07:49:07,631 WARN L205 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2021-06-05 07:49:11,366 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 07:49:11,689 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-05 07:49:11,999 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2021-06-05 07:49:14,561 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 07:49:18,198 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 07:49:21,376 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 07:49:22,679 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 07:49:24,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:49:24,536 INFO L93 Difference]: Finished difference Result 14313 states and 36777 transitions. [2021-06-05 07:49:24,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-06-05 07:49:24,539 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 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 184 [2021-06-05 07:49:24,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:49:24,555 INFO L225 Difference]: With dead ends: 14313 [2021-06-05 07:49:24,555 INFO L226 Difference]: Without dead ends: 13893 [2021-06-05 07:49:24,557 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4475 ImplicationChecksByTransitivity, 17493.5ms TimeCoverageRelationStatistics Valid=1577, Invalid=14935, Unknown=0, NotChecked=0, Total=16512 [2021-06-05 07:49:24,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13893 states. [2021-06-05 07:49:24,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13893 to 9698. [2021-06-05 07:49:24,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9698 states, 9696 states have (on average 2.559612211221122) internal successors, (24818), 9697 states have internal predecessors, (24818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:24,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9698 states to 9698 states and 24818 transitions. [2021-06-05 07:49:24,692 INFO L78 Accepts]: Start accepts. Automaton has 9698 states and 24818 transitions. Word has length 184 [2021-06-05 07:49:24,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:49:24,692 INFO L482 AbstractCegarLoop]: Abstraction has 9698 states and 24818 transitions. [2021-06-05 07:49:24,692 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:24,692 INFO L276 IsEmpty]: Start isEmpty. Operand 9698 states and 24818 transitions. [2021-06-05 07:49:24,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 07:49:24,700 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:49:24,701 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:49:24,701 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-06-05 07:49:24,701 INFO L430 AbstractCegarLoop]: === Iteration 34 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:49:24,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:49:24,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1066712083, now seen corresponding path program 12 times [2021-06-05 07:49:24,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:49:24,701 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867618245] [2021-06-05 07:49:24,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:49:24,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:49:25,325 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-05 07:49:25,696 WARN L205 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 07:49:26,358 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2021-06-05 07:49:26,681 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2021-06-05 07:49:27,009 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2021-06-05 07:49:27,354 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2021-06-05 07:49:27,625 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2021-06-05 07:49:28,341 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2021-06-05 07:49:29,167 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 07:49:34,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:49:34,484 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:49:34,484 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867618245] [2021-06-05 07:49:34,484 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867618245] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:49:34,484 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:49:34,484 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 07:49:34,484 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481769273] [2021-06-05 07:49:34,485 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 07:49:34,485 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:49:34,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 07:49:34,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=2559, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 07:49:34,485 INFO L87 Difference]: Start difference. First operand 9698 states and 24818 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:36,899 WARN L205 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 07:49:37,380 WARN L205 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2021-06-05 07:49:40,385 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 07:49:40,655 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-05 07:49:40,906 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2021-06-05 07:49:42,835 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 07:49:45,249 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 07:49:47,462 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 07:49:48,438 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 07:49:49,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:49:49,309 INFO L93 Difference]: Finished difference Result 14281 states and 36705 transitions. [2021-06-05 07:49:49,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-06-05 07:49:49,310 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 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 184 [2021-06-05 07:49:49,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:49:49,325 INFO L225 Difference]: With dead ends: 14281 [2021-06-05 07:49:49,326 INFO L226 Difference]: Without dead ends: 13861 [2021-06-05 07:49:49,327 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 20 SyntacticMatches, 7 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4483 ImplicationChecksByTransitivity, 18633.8ms TimeCoverageRelationStatistics Valid=1577, Invalid=14935, Unknown=0, NotChecked=0, Total=16512 [2021-06-05 07:49:49,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13861 states. [2021-06-05 07:49:49,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13861 to 9711. [2021-06-05 07:49:49,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9711 states, 9709 states have (on average 2.5597898856730867) internal successors, (24853), 9710 states have internal predecessors, (24853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:49,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9711 states to 9711 states and 24853 transitions. [2021-06-05 07:49:49,460 INFO L78 Accepts]: Start accepts. Automaton has 9711 states and 24853 transitions. Word has length 184 [2021-06-05 07:49:49,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:49:49,460 INFO L482 AbstractCegarLoop]: Abstraction has 9711 states and 24853 transitions. [2021-06-05 07:49:49,460 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:49,461 INFO L276 IsEmpty]: Start isEmpty. Operand 9711 states and 24853 transitions. [2021-06-05 07:49:49,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 07:49:49,468 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:49:49,468 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:49:49,468 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-06-05 07:49:49,468 INFO L430 AbstractCegarLoop]: === Iteration 35 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:49:49,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:49:49,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1230698425, now seen corresponding path program 13 times [2021-06-05 07:49:49,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:49:49,469 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351753634] [2021-06-05 07:49:49,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:49:49,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:49:50,036 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-05 07:49:50,332 WARN L205 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 07:49:50,582 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2021-06-05 07:49:50,824 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2021-06-05 07:49:52,749 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 07:49:57,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:49:57,700 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:49:57,700 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351753634] [2021-06-05 07:49:57,700 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351753634] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:49:57,700 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:49:57,700 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 07:49:57,700 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247546956] [2021-06-05 07:49:57,701 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 07:49:57,701 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:49:57,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 07:49:57,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=2559, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 07:49:57,701 INFO L87 Difference]: Start difference. First operand 9711 states and 24853 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:50:02,805 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 44 [2021-06-05 07:50:03,861 WARN L205 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 07:50:04,215 WARN L205 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2021-06-05 07:50:07,100 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-06-05 07:50:08,017 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 07:50:08,299 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-05 07:50:08,535 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2021-06-05 07:50:10,298 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 69 [2021-06-05 07:50:10,615 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 07:50:13,136 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2021-06-05 07:50:13,672 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 07:50:16,347 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 07:50:17,498 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 07:50:18,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:50:18,955 INFO L93 Difference]: Finished difference Result 13841 states and 35575 transitions. [2021-06-05 07:50:18,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2021-06-05 07:50:18,956 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 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 184 [2021-06-05 07:50:18,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:50:18,973 INFO L225 Difference]: With dead ends: 13841 [2021-06-05 07:50:18,973 INFO L226 Difference]: Without dead ends: 13421 [2021-06-05 07:50:18,975 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4392 ImplicationChecksByTransitivity, 19343.5ms TimeCoverageRelationStatistics Valid=1547, Invalid=14709, Unknown=0, NotChecked=0, Total=16256 [2021-06-05 07:50:18,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13421 states. [2021-06-05 07:50:19,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13421 to 9724. [2021-06-05 07:50:19,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9724 states, 9722 states have (on average 2.559967084961942) internal successors, (24888), 9723 states have internal predecessors, (24888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:50:19,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9724 states to 9724 states and 24888 transitions. [2021-06-05 07:50:19,109 INFO L78 Accepts]: Start accepts. Automaton has 9724 states and 24888 transitions. Word has length 184 [2021-06-05 07:50:19,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:50:19,109 INFO L482 AbstractCegarLoop]: Abstraction has 9724 states and 24888 transitions. [2021-06-05 07:50:19,109 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:50:19,109 INFO L276 IsEmpty]: Start isEmpty. Operand 9724 states and 24888 transitions. [2021-06-05 07:50:19,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 07:50:19,117 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:50:19,117 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:50:19,117 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-06-05 07:50:19,118 INFO L430 AbstractCegarLoop]: === Iteration 36 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:50:19,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:50:19,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1256034409, now seen corresponding path program 14 times [2021-06-05 07:50:19,118 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:50:19,118 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964524990] [2021-06-05 07:50:19,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:50:19,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:50:19,677 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-05 07:50:19,909 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 07:50:20,145 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2021-06-05 07:50:20,392 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2021-06-05 07:50:20,659 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2021-06-05 07:50:22,341 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 07:50:27,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:50:27,386 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:50:27,386 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964524990] [2021-06-05 07:50:27,386 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964524990] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:50:27,386 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:50:27,386 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 07:50:27,386 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662551659] [2021-06-05 07:50:27,387 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 07:50:27,387 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:50:27,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 07:50:27,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2555, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 07:50:27,387 INFO L87 Difference]: Start difference. First operand 9724 states and 24888 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:50:32,872 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 49 [2021-06-05 07:50:33,809 WARN L205 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 07:50:34,679 WARN L205 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2021-06-05 07:50:38,202 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2021-06-05 07:50:38,407 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-06-05 07:50:38,683 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-06-05 07:50:39,359 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-05 07:50:39,573 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2021-06-05 07:50:40,503 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 71 [2021-06-05 07:50:41,100 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 69 [2021-06-05 07:50:41,524 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 07:50:43,833 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 07:50:45,935 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 07:50:46,842 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 07:50:47,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:50:47,750 INFO L93 Difference]: Finished difference Result 14269 states and 36720 transitions. [2021-06-05 07:50:47,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2021-06-05 07:50:47,750 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 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 184 [2021-06-05 07:50:47,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:50:47,765 INFO L225 Difference]: With dead ends: 14269 [2021-06-05 07:50:47,766 INFO L226 Difference]: Without dead ends: 13849 [2021-06-05 07:50:47,767 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4560 ImplicationChecksByTransitivity, 20476.5ms TimeCoverageRelationStatistics Valid=1599, Invalid=15171, Unknown=0, NotChecked=0, Total=16770 [2021-06-05 07:50:47,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13849 states. [2021-06-05 07:50:47,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13849 to 9737. [2021-06-05 07:50:47,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9737 states, 9735 states have (on average 2.5601438109912684) internal successors, (24923), 9736 states have internal predecessors, (24923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:50:47,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9737 states to 9737 states and 24923 transitions. [2021-06-05 07:50:47,904 INFO L78 Accepts]: Start accepts. Automaton has 9737 states and 24923 transitions. Word has length 184 [2021-06-05 07:50:47,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:50:47,904 INFO L482 AbstractCegarLoop]: Abstraction has 9737 states and 24923 transitions. [2021-06-05 07:50:47,904 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:50:47,904 INFO L276 IsEmpty]: Start isEmpty. Operand 9737 states and 24923 transitions. [2021-06-05 07:50:47,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 07:50:47,912 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:50:47,912 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:50:47,912 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-06-05 07:50:47,912 INFO L430 AbstractCegarLoop]: === Iteration 37 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:50:47,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:50:47,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1126659863, now seen corresponding path program 15 times [2021-06-05 07:50:47,913 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:50:47,913 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491508341] [2021-06-05 07:50:47,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:50:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:50:48,638 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 07:50:48,859 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2021-06-05 07:50:50,496 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 07:50:54,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:50:54,545 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:50:54,545 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491508341] [2021-06-05 07:50:54,546 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491508341] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:50:54,546 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:50:54,546 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 07:50:54,546 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084752066] [2021-06-05 07:50:54,546 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 07:50:54,546 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:50:54,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 07:50:54,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=2554, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 07:50:54,547 INFO L87 Difference]: Start difference. First operand 9737 states and 24923 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:50:59,393 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 49 [2021-06-05 07:51:00,193 WARN L205 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 07:51:00,949 WARN L205 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2021-06-05 07:51:05,215 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-06-05 07:51:05,659 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-06-05 07:51:08,083 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2021-06-05 07:51:10,476 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 07:51:12,819 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 07:51:15,175 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 07:51:16,184 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 07:51:17,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:51:17,467 INFO L93 Difference]: Finished difference Result 13801 states and 35485 transitions. [2021-06-05 07:51:17,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-06-05 07:51:17,468 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 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 184 [2021-06-05 07:51:17,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:51:17,482 INFO L225 Difference]: With dead ends: 13801 [2021-06-05 07:51:17,482 INFO L226 Difference]: Without dead ends: 13381 [2021-06-05 07:51:17,483 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4459 ImplicationChecksByTransitivity, 17938.3ms TimeCoverageRelationStatistics Valid=1578, Invalid=14934, Unknown=0, NotChecked=0, Total=16512 [2021-06-05 07:51:17,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13381 states. [2021-06-05 07:51:17,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13381 to 9854. [2021-06-05 07:51:17,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9854 states, 9852 states have (on average 2.5617133576938693) internal successors, (25238), 9853 states have internal predecessors, (25238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:51:17,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9854 states to 9854 states and 25238 transitions. [2021-06-05 07:51:17,614 INFO L78 Accepts]: Start accepts. Automaton has 9854 states and 25238 transitions. Word has length 184 [2021-06-05 07:51:17,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:51:17,614 INFO L482 AbstractCegarLoop]: Abstraction has 9854 states and 25238 transitions. [2021-06-05 07:51:17,614 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:51:17,614 INFO L276 IsEmpty]: Start isEmpty. Operand 9854 states and 25238 transitions. [2021-06-05 07:51:17,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 07:51:17,622 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:51:17,622 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:51:17,622 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-06-05 07:51:17,622 INFO L430 AbstractCegarLoop]: === Iteration 38 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:51:17,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:51:17,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1048916267, now seen corresponding path program 16 times [2021-06-05 07:51:17,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:51:17,623 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961044454] [2021-06-05 07:51:17,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:51:17,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:51:18,333 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 07:51:18,626 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2021-06-05 07:51:20,470 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 07:51:24,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:51:24,834 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:51:24,834 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961044454] [2021-06-05 07:51:24,834 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961044454] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:51:24,834 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:51:24,834 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 07:51:24,834 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793247023] [2021-06-05 07:51:24,835 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 07:51:24,835 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:51:24,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 07:51:24,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2555, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 07:51:24,836 INFO L87 Difference]: Start difference. First operand 9854 states and 25238 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:51:29,918 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 49 [2021-06-05 07:51:30,733 WARN L205 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 07:51:31,497 WARN L205 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2021-06-05 07:51:35,910 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-06-05 07:51:36,355 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-06-05 07:51:36,818 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2021-06-05 07:51:38,863 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2021-06-05 07:51:43,532 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 07:51:48,524 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 07:51:50,563 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 07:51:51,534 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 07:51:52,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:51:52,346 INFO L93 Difference]: Finished difference Result 15755 states and 40499 transitions. [2021-06-05 07:51:52,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2021-06-05 07:51:52,347 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 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 184 [2021-06-05 07:51:52,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:51:52,362 INFO L225 Difference]: With dead ends: 15755 [2021-06-05 07:51:52,362 INFO L226 Difference]: Without dead ends: 15335 [2021-06-05 07:51:52,363 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4635 ImplicationChecksByTransitivity, 19550.8ms TimeCoverageRelationStatistics Valid=1611, Invalid=15419, Unknown=0, NotChecked=0, Total=17030 [2021-06-05 07:51:52,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15335 states. [2021-06-05 07:51:52,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15335 to 9958. [2021-06-05 07:51:52,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9958 states, 9956 states have (on average 2.564383286460426) internal successors, (25531), 9957 states have internal predecessors, (25531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:51:52,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9958 states to 9958 states and 25531 transitions. [2021-06-05 07:51:52,504 INFO L78 Accepts]: Start accepts. Automaton has 9958 states and 25531 transitions. Word has length 184 [2021-06-05 07:51:52,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:51:52,505 INFO L482 AbstractCegarLoop]: Abstraction has 9958 states and 25531 transitions. [2021-06-05 07:51:52,505 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:51:52,505 INFO L276 IsEmpty]: Start isEmpty. Operand 9958 states and 25531 transitions. [2021-06-05 07:51:52,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 07:51:52,512 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:51:52,513 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:51:52,513 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-06-05 07:51:52,513 INFO L430 AbstractCegarLoop]: === Iteration 39 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:51:52,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:51:52,513 INFO L82 PathProgramCache]: Analyzing trace with hash 734173673, now seen corresponding path program 17 times [2021-06-05 07:51:52,513 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:51:52,513 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380486797] [2021-06-05 07:51:52,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:51:52,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:51:53,117 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 07:51:54,819 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 07:51:58,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:51:58,637 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:51:58,637 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380486797] [2021-06-05 07:51:58,637 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380486797] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:51:58,637 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:51:58,637 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 07:51:58,637 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059055176] [2021-06-05 07:51:58,638 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 07:51:58,638 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:51:58,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 07:51:58,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=2558, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 07:51:58,639 INFO L87 Difference]: Start difference. First operand 9958 states and 25531 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:52:03,423 WARN L205 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 07:52:04,118 WARN L205 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2021-06-05 07:52:07,798 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-06-05 07:52:08,195 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-06-05 07:52:10,162 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2021-06-05 07:52:14,530 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 07:52:19,166 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 07:52:23,172 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 07:52:24,558 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 07:52:25,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:52:25,173 INFO L93 Difference]: Finished difference Result 15667 states and 40285 transitions. [2021-06-05 07:52:25,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2021-06-05 07:52:25,174 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 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 184 [2021-06-05 07:52:25,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:52:25,188 INFO L225 Difference]: With dead ends: 15667 [2021-06-05 07:52:25,188 INFO L226 Difference]: Without dead ends: 15247 [2021-06-05 07:52:25,189 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 20 SyntacticMatches, 7 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4721 ImplicationChecksByTransitivity, 18829.7ms TimeCoverageRelationStatistics Valid=1623, Invalid=15669, Unknown=0, NotChecked=0, Total=17292 [2021-06-05 07:52:25,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15247 states. [2021-06-05 07:52:25,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15247 to 9997. [2021-06-05 07:52:25,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9997 states, 9995 states have (on average 2.56488244122061) internal successors, (25636), 9996 states have internal predecessors, (25636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:52:25,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9997 states to 9997 states and 25636 transitions. [2021-06-05 07:52:25,325 INFO L78 Accepts]: Start accepts. Automaton has 9997 states and 25636 transitions. Word has length 184 [2021-06-05 07:52:25,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:52:25,326 INFO L482 AbstractCegarLoop]: Abstraction has 9997 states and 25636 transitions. [2021-06-05 07:52:25,326 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:52:25,326 INFO L276 IsEmpty]: Start isEmpty. Operand 9997 states and 25636 transitions. [2021-06-05 07:52:25,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 07:52:25,334 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:52:25,334 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:52:25,334 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-06-05 07:52:25,334 INFO L430 AbstractCegarLoop]: === Iteration 40 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:52:25,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:52:25,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1053236985, now seen corresponding path program 18 times [2021-06-05 07:52:25,334 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:52:25,334 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917316487] [2021-06-05 07:52:25,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:52:25,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:52:25,872 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 07:52:27,198 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 07:52:30,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:52:30,220 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:52:30,220 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917316487] [2021-06-05 07:52:30,220 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917316487] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:52:30,220 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:52:30,220 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 07:52:30,221 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020674509] [2021-06-05 07:52:30,221 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 07:52:30,221 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:52:30,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 07:52:30,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=2560, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 07:52:30,222 INFO L87 Difference]: Start difference. First operand 9997 states and 25636 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:52:34,158 WARN L205 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 07:52:34,781 WARN L205 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2021-06-05 07:52:38,238 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-06-05 07:52:38,626 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-06-05 07:52:40,398 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2021-06-05 07:52:44,841 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 07:52:49,013 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 07:52:52,697 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 07:52:54,328 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 07:52:56,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:52:56,295 INFO L93 Difference]: Finished difference Result 15627 states and 40195 transitions. [2021-06-05 07:52:56,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2021-06-05 07:52:56,296 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 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 184 [2021-06-05 07:52:56,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:52:56,313 INFO L225 Difference]: With dead ends: 15627 [2021-06-05 07:52:56,313 INFO L226 Difference]: Without dead ends: 15207 [2021-06-05 07:52:56,315 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4797 ImplicationChecksByTransitivity, 16920.7ms TimeCoverageRelationStatistics Valid=1638, Invalid=15918, Unknown=0, NotChecked=0, Total=17556 [2021-06-05 07:52:56,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15207 states. [2021-06-05 07:52:56,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15207 to 10023. [2021-06-05 07:52:56,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10023 states, 10021 states have (on average 2.565213052589562) internal successors, (25706), 10022 states have internal predecessors, (25706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:52:56,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10023 states to 10023 states and 25706 transitions. [2021-06-05 07:52:56,475 INFO L78 Accepts]: Start accepts. Automaton has 10023 states and 25706 transitions. Word has length 184 [2021-06-05 07:52:56,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:52:56,475 INFO L482 AbstractCegarLoop]: Abstraction has 10023 states and 25706 transitions. [2021-06-05 07:52:56,476 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:52:56,476 INFO L276 IsEmpty]: Start isEmpty. Operand 10023 states and 25706 transitions. [2021-06-05 07:52:56,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 07:52:56,484 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:52:56,484 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:52:56,484 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-06-05 07:52:56,484 INFO L430 AbstractCegarLoop]: === Iteration 41 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:52:56,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:52:56,484 INFO L82 PathProgramCache]: Analyzing trace with hash -591523705, now seen corresponding path program 19 times [2021-06-05 07:52:56,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:52:56,485 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382935513] [2021-06-05 07:52:56,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:52:56,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:52:57,147 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-05 07:52:57,534 WARN L205 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 07:52:57,917 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2021-06-05 07:52:58,023 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2021-06-05 07:52:59,139 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 07:53:01,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:53:01,660 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:53:01,660 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382935513] [2021-06-05 07:53:01,660 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382935513] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:53:01,660 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:53:01,660 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 07:53:01,661 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555291208] [2021-06-05 07:53:01,661 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 07:53:01,661 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:53:01,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 07:53:01,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=2568, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 07:53:01,662 INFO L87 Difference]: Start difference. First operand 10023 states and 25706 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:53:04,930 WARN L205 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 73 [2021-06-05 07:53:05,492 WARN L205 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 71 [2021-06-05 07:53:08,767 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 77 [2021-06-05 07:53:16,589 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2021-06-05 07:53:18,327 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2021-06-05 07:53:21,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:53:21,779 INFO L93 Difference]: Finished difference Result 15649 states and 40255 transitions. [2021-06-05 07:53:21,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2021-06-05 07:53:21,780 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 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 184 [2021-06-05 07:53:21,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:53:21,801 INFO L225 Difference]: With dead ends: 15649 [2021-06-05 07:53:21,801 INFO L226 Difference]: Without dead ends: 15229 [2021-06-05 07:53:21,803 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 19 SyntacticMatches, 5 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4994 ImplicationChecksByTransitivity, 16148.0ms TimeCoverageRelationStatistics Valid=1668, Invalid=16692, Unknown=0, NotChecked=0, Total=18360 [2021-06-05 07:53:21,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15229 states. [2021-06-05 07:53:21,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15229 to 10036. [2021-06-05 07:53:21,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10036 states, 10034 states have (on average 2.5653777157663944) internal successors, (25741), 10035 states have internal predecessors, (25741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:53:21,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10036 states to 10036 states and 25741 transitions. [2021-06-05 07:53:21,951 INFO L78 Accepts]: Start accepts. Automaton has 10036 states and 25741 transitions. Word has length 184 [2021-06-05 07:53:21,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:53:21,951 INFO L482 AbstractCegarLoop]: Abstraction has 10036 states and 25741 transitions. [2021-06-05 07:53:21,952 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:53:21,952 INFO L276 IsEmpty]: Start isEmpty. Operand 10036 states and 25741 transitions. [2021-06-05 07:53:21,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 07:53:21,960 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:53:21,960 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:53:21,960 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-06-05 07:53:21,960 INFO L430 AbstractCegarLoop]: === Iteration 42 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:53:21,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:53:21,961 INFO L82 PathProgramCache]: Analyzing trace with hash -635223827, now seen corresponding path program 20 times [2021-06-05 07:53:21,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:53:21,961 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059484826] [2021-06-05 07:53:21,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:53:21,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:53:22,860 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 07:53:23,175 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2021-06-05 07:53:23,489 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2021-06-05 07:53:23,815 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2021-06-05 07:53:24,153 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2021-06-05 07:53:24,429 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2021-06-05 07:53:25,151 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2021-06-05 07:53:25,970 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 07:53:30,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:53:30,756 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:53:30,756 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059484826] [2021-06-05 07:53:30,756 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059484826] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:53:30,756 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:53:30,756 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 07:53:30,756 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403248332] [2021-06-05 07:53:30,757 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 07:53:30,757 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:53:30,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 07:53:30,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2566, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 07:53:30,758 INFO L87 Difference]: Start difference. First operand 10036 states and 25741 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:53:33,396 WARN L205 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 07:53:33,875 WARN L205 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2021-06-05 07:53:36,868 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-06-05 07:53:37,200 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-06-05 07:53:38,805 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2021-06-05 07:53:41,003 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 79 [2021-06-05 07:53:43,254 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 07:53:46,756 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 07:53:49,871 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 07:53:51,254 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 07:53:52,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:53:52,836 INFO L93 Difference]: Finished difference Result 16779 states and 43195 transitions. [2021-06-05 07:53:52,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2021-06-05 07:53:52,837 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 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 184 [2021-06-05 07:53:52,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:53:52,855 INFO L225 Difference]: With dead ends: 16779 [2021-06-05 07:53:52,855 INFO L226 Difference]: Without dead ends: 16359 [2021-06-05 07:53:52,857 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5056 ImplicationChecksByTransitivity, 19226.8ms TimeCoverageRelationStatistics Valid=1696, Invalid=16664, Unknown=0, NotChecked=0, Total=18360 [2021-06-05 07:53:52,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16359 states. [2021-06-05 07:53:52,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16359 to 10348. [2021-06-05 07:53:52,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10348 states, 10346 states have (on average 2.5692054900444616) internal successors, (26581), 10347 states have internal predecessors, (26581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:53:53,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10348 states to 10348 states and 26581 transitions. [2021-06-05 07:53:53,010 INFO L78 Accepts]: Start accepts. Automaton has 10348 states and 26581 transitions. Word has length 184 [2021-06-05 07:53:53,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:53:53,010 INFO L482 AbstractCegarLoop]: Abstraction has 10348 states and 26581 transitions. [2021-06-05 07:53:53,011 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:53:53,011 INFO L276 IsEmpty]: Start isEmpty. Operand 10348 states and 26581 transitions. [2021-06-05 07:53:53,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 07:53:53,020 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:53:53,020 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:53:53,020 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-06-05 07:53:53,020 INFO L430 AbstractCegarLoop]: === Iteration 43 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:53:53,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:53:53,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1587804165, now seen corresponding path program 21 times [2021-06-05 07:53:53,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:53:53,021 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371462515] [2021-06-05 07:53:53,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:53:53,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:53:53,658 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-05 07:53:53,964 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 07:53:54,310 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2021-06-05 07:53:54,670 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2021-06-05 07:53:54,997 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2021-06-05 07:53:55,335 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2021-06-05 07:53:56,425 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2021-06-05 07:54:00,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:54:00,905 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:54:00,905 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371462515] [2021-06-05 07:54:00,905 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371462515] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:54:00,905 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:54:00,905 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2021-06-05 07:54:00,905 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636135906] [2021-06-05 07:54:00,906 INFO L462 AbstractCegarLoop]: Interpolant automaton has 46 states [2021-06-05 07:54:00,906 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:54:00,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-06-05 07:54:00,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1934, Unknown=0, NotChecked=0, Total=2070 [2021-06-05 07:54:00,906 INFO L87 Difference]: Start difference. First operand 10348 states and 26581 transitions. Second operand has 46 states, 46 states have (on average 4.0) internal successors, (184), 46 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:54:06,493 WARN L205 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 74 [2021-06-05 07:54:06,912 WARN L205 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 72 [2021-06-05 07:54:11,064 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 69 [2021-06-05 07:54:13,111 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2021-06-05 07:54:13,508 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2021-06-05 07:54:14,562 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2021-06-05 07:54:16,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:54:16,146 INFO L93 Difference]: Finished difference Result 16051 states and 41310 transitions. [2021-06-05 07:54:16,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2021-06-05 07:54:16,147 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 4.0) internal successors, (184), 46 states have internal predecessors, (184), 0 states have call successors, (0), 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 184 [2021-06-05 07:54:16,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:54:16,164 INFO L225 Difference]: With dead ends: 16051 [2021-06-05 07:54:16,165 INFO L226 Difference]: Without dead ends: 15631 [2021-06-05 07:54:16,166 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 16 SyntacticMatches, 10 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3405 ImplicationChecksByTransitivity, 15845.6ms TimeCoverageRelationStatistics Valid=1160, Invalid=11050, Unknown=0, NotChecked=0, Total=12210 [2021-06-05 07:54:16,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15631 states. [2021-06-05 07:54:16,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15631 to 10660. [2021-06-05 07:54:16,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10660 states, 10658 states have (on average 2.57280915744042) internal successors, (27421), 10659 states have internal predecessors, (27421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:54:16,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10660 states to 10660 states and 27421 transitions. [2021-06-05 07:54:16,319 INFO L78 Accepts]: Start accepts. Automaton has 10660 states and 27421 transitions. Word has length 184 [2021-06-05 07:54:16,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:54:16,319 INFO L482 AbstractCegarLoop]: Abstraction has 10660 states and 27421 transitions. [2021-06-05 07:54:16,320 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 46 states, 46 states have (on average 4.0) internal successors, (184), 46 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:54:16,320 INFO L276 IsEmpty]: Start isEmpty. Operand 10660 states and 27421 transitions. [2021-06-05 07:54:16,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 07:54:16,328 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:54:16,329 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:54:16,329 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-06-05 07:54:16,329 INFO L430 AbstractCegarLoop]: === Iteration 44 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:54:16,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:54:16,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1257388649, now seen corresponding path program 22 times [2021-06-05 07:54:16,329 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:54:16,329 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900021243] [2021-06-05 07:54:16,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:54:16,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:54:17,042 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 07:54:17,356 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2021-06-05 07:54:17,626 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2021-06-05 07:54:18,709 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2021-06-05 07:54:22,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:54:22,101 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:54:22,101 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900021243] [2021-06-05 07:54:22,101 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900021243] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:54:22,101 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:54:22,101 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2021-06-05 07:54:22,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032527494] [2021-06-05 07:54:22,101 INFO L462 AbstractCegarLoop]: Interpolant automaton has 46 states [2021-06-05 07:54:22,101 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:54:22,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-06-05 07:54:22,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1935, Unknown=0, NotChecked=0, Total=2070 [2021-06-05 07:54:22,102 INFO L87 Difference]: Start difference. First operand 10660 states and 27421 transitions. Second operand has 46 states, 46 states have (on average 4.0) internal successors, (184), 46 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:54:27,131 WARN L205 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 74 [2021-06-05 07:54:27,862 WARN L205 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 72 [2021-06-05 07:54:34,336 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 69 [2021-06-05 07:54:37,046 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2021-06-05 07:54:37,613 WARN L205 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2021-06-05 07:54:37,959 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2021-06-05 07:54:38,873 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2021-06-05 07:54:39,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:54:39,917 INFO L93 Difference]: Finished difference Result 16601 states and 42772 transitions. [2021-06-05 07:54:39,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2021-06-05 07:54:39,917 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 4.0) internal successors, (184), 46 states have internal predecessors, (184), 0 states have call successors, (0), 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 184 [2021-06-05 07:54:39,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:54:39,933 INFO L225 Difference]: With dead ends: 16601 [2021-06-05 07:54:39,933 INFO L226 Difference]: Without dead ends: 16181 [2021-06-05 07:54:39,934 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 15 SyntacticMatches, 11 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3564 ImplicationChecksByTransitivity, 14995.9ms TimeCoverageRelationStatistics Valid=1187, Invalid=11469, Unknown=0, NotChecked=0, Total=12656 [2021-06-05 07:54:39,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16181 states. [2021-06-05 07:54:40,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16181 to 10764. [2021-06-05 07:54:40,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10764 states, 10762 states have (on average 2.5751719011336185) internal successors, (27714), 10763 states have internal predecessors, (27714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:54:40,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10764 states to 10764 states and 27714 transitions. [2021-06-05 07:54:40,083 INFO L78 Accepts]: Start accepts. Automaton has 10764 states and 27714 transitions. Word has length 184 [2021-06-05 07:54:40,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:54:40,084 INFO L482 AbstractCegarLoop]: Abstraction has 10764 states and 27714 transitions. [2021-06-05 07:54:40,084 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 46 states, 46 states have (on average 4.0) internal successors, (184), 46 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:54:40,084 INFO L276 IsEmpty]: Start isEmpty. Operand 10764 states and 27714 transitions. [2021-06-05 07:54:40,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 07:54:40,092 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:54:40,093 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:54:40,093 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-06-05 07:54:40,093 INFO L430 AbstractCegarLoop]: === Iteration 45 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:54:40,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:54:40,093 INFO L82 PathProgramCache]: Analyzing trace with hash 942646055, now seen corresponding path program 23 times [2021-06-05 07:54:40,093 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:54:40,093 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74195817] [2021-06-05 07:54:40,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:54:40,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:54:40,753 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 07:54:40,898 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2021-06-05 07:54:41,054 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2021-06-05 07:54:41,703 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2021-06-05 07:54:43,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:54:43,934 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:54:43,934 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74195817] [2021-06-05 07:54:43,934 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74195817] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:54:43,934 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:54:43,934 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2021-06-05 07:54:43,934 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414270628] [2021-06-05 07:54:43,934 INFO L462 AbstractCegarLoop]: Interpolant automaton has 46 states [2021-06-05 07:54:43,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:54:43,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-06-05 07:54:43,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1938, Unknown=0, NotChecked=0, Total=2070 [2021-06-05 07:54:43,935 INFO L87 Difference]: Start difference. First operand 10764 states and 27714 transitions. Second operand has 46 states, 46 states have (on average 4.0) internal successors, (184), 46 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:54:47,571 WARN L205 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 74 [2021-06-05 07:54:48,136 WARN L205 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 72 [2021-06-05 07:54:56,853 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 69 [2021-06-05 07:55:01,218 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2021-06-05 07:55:02,332 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2021-06-05 07:55:03,437 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2021-06-05 07:55:07,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:55:07,582 INFO L93 Difference]: Finished difference Result 16489 states and 42504 transitions. [2021-06-05 07:55:07,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2021-06-05 07:55:07,582 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 4.0) internal successors, (184), 46 states have internal predecessors, (184), 0 states have call successors, (0), 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 184 [2021-06-05 07:55:07,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:55:07,601 INFO L225 Difference]: With dead ends: 16489 [2021-06-05 07:55:07,602 INFO L226 Difference]: Without dead ends: 16069 [2021-06-05 07:55:07,603 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 16 SyntacticMatches, 10 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3628 ImplicationChecksByTransitivity, 11996.0ms TimeCoverageRelationStatistics Valid=1197, Invalid=11685, Unknown=0, NotChecked=0, Total=12882 [2021-06-05 07:55:07,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16069 states. [2021-06-05 07:55:07,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16069 to 10803. [2021-06-05 07:55:07,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10803 states, 10801 states have (on average 2.575594852328488) internal successors, (27819), 10802 states have internal predecessors, (27819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:55:07,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10803 states to 10803 states and 27819 transitions. [2021-06-05 07:55:07,768 INFO L78 Accepts]: Start accepts. Automaton has 10803 states and 27819 transitions. Word has length 184 [2021-06-05 07:55:07,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:55:07,768 INFO L482 AbstractCegarLoop]: Abstraction has 10803 states and 27819 transitions. [2021-06-05 07:55:07,769 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 46 states, 46 states have (on average 4.0) internal successors, (184), 46 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:55:07,769 INFO L276 IsEmpty]: Start isEmpty. Operand 10803 states and 27819 transitions. [2021-06-05 07:55:07,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 07:55:07,777 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:55:07,778 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:55:07,778 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-06-05 07:55:07,778 INFO L430 AbstractCegarLoop]: === Iteration 46 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:55:07,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:55:07,778 INFO L82 PathProgramCache]: Analyzing trace with hash -844764603, now seen corresponding path program 24 times [2021-06-05 07:55:07,778 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:55:07,778 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311053993] [2021-06-05 07:55:07,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:55:07,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:55:08,462 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-05 07:55:08,839 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 07:55:09,270 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2021-06-05 07:55:09,715 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2021-06-05 07:55:10,147 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2021-06-05 07:55:10,595 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2021-06-05 07:55:11,672 WARN L205 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 37 [2021-06-05 07:55:11,815 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2021-06-05 07:55:13,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:55:13,773 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:55:13,773 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311053993] [2021-06-05 07:55:13,773 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311053993] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:55:13,773 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:55:13,773 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2021-06-05 07:55:13,773 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108765799] [2021-06-05 07:55:13,774 INFO L462 AbstractCegarLoop]: Interpolant automaton has 46 states [2021-06-05 07:55:13,774 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:55:13,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-06-05 07:55:13,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1940, Unknown=0, NotChecked=0, Total=2070 [2021-06-05 07:55:13,775 INFO L87 Difference]: Start difference. First operand 10803 states and 27819 transitions. Second operand has 46 states, 46 states have (on average 4.0) internal successors, (184), 46 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:55:16,363 WARN L205 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 74 [2021-06-05 07:55:16,874 WARN L205 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 72 [2021-06-05 07:55:22,968 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 69 [2021-06-05 07:55:25,574 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2021-06-05 07:55:27,224 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2021-06-05 07:55:29,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:55:29,164 INFO L93 Difference]: Finished difference Result 16433 states and 42378 transitions. [2021-06-05 07:55:29,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2021-06-05 07:55:29,164 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 4.0) internal successors, (184), 46 states have internal predecessors, (184), 0 states have call successors, (0), 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 184 [2021-06-05 07:55:29,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:55:29,183 INFO L225 Difference]: With dead ends: 16433 [2021-06-05 07:55:29,183 INFO L226 Difference]: Without dead ends: 16013 [2021-06-05 07:55:29,184 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 16 SyntacticMatches, 10 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3702 ImplicationChecksByTransitivity, 13374.5ms TimeCoverageRelationStatistics Valid=1210, Invalid=11900, Unknown=0, NotChecked=0, Total=13110 [2021-06-05 07:55:29,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16013 states. [2021-06-05 07:55:29,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16013 to 10829. [2021-06-05 07:55:29,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10829 states, 10827 states have (on average 2.5758751269973215) internal successors, (27889), 10828 states have internal predecessors, (27889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:55:29,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10829 states to 10829 states and 27889 transitions. [2021-06-05 07:55:29,349 INFO L78 Accepts]: Start accepts. Automaton has 10829 states and 27889 transitions. Word has length 184 [2021-06-05 07:55:29,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:55:29,349 INFO L482 AbstractCegarLoop]: Abstraction has 10829 states and 27889 transitions. [2021-06-05 07:55:29,349 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 46 states, 46 states have (on average 4.0) internal successors, (184), 46 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:55:29,349 INFO L276 IsEmpty]: Start isEmpty. Operand 10829 states and 27889 transitions. [2021-06-05 07:55:29,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 07:55:29,358 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:55:29,358 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:55:29,358 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-06-05 07:55:29,359 INFO L430 AbstractCegarLoop]: === Iteration 47 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:55:29,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:55:29,359 INFO L82 PathProgramCache]: Analyzing trace with hash -383051323, now seen corresponding path program 25 times [2021-06-05 07:55:29,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:55:29,359 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494882079] [2021-06-05 07:55:29,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:55:29,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:55:31,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:55:31,402 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:55:31,402 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494882079] [2021-06-05 07:55:31,402 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494882079] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:55:31,402 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:55:31,402 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2021-06-05 07:55:31,402 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543621019] [2021-06-05 07:55:31,402 INFO L462 AbstractCegarLoop]: Interpolant automaton has 47 states [2021-06-05 07:55:31,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:55:31,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-06-05 07:55:31,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=2031, Unknown=0, NotChecked=0, Total=2162 [2021-06-05 07:55:31,403 INFO L87 Difference]: Start difference. First operand 10829 states and 27889 transitions. Second operand has 47 states, 47 states have (on average 3.9148936170212765) internal successors, (184), 47 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:55:34,074 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 64 [2021-06-05 07:55:35,761 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2021-06-05 07:55:36,080 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 68 [2021-06-05 07:55:36,651 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 71 [2021-06-05 07:55:36,880 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 70 [2021-06-05 07:55:37,160 WARN L205 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 84 [2021-06-05 07:55:37,819 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 75 [2021-06-05 07:55:38,143 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 73 [2021-06-05 07:55:38,444 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 87 [2021-06-05 07:55:39,844 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2021-06-05 07:55:40,283 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2021-06-05 07:55:40,485 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 82 [2021-06-05 07:55:40,838 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2021-06-05 07:55:40,990 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2021-06-05 07:55:41,152 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2021-06-05 07:55:41,324 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 82 [2021-06-05 07:55:41,507 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2021-06-05 07:55:41,678 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2021-06-05 07:55:41,829 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2021-06-05 07:55:41,996 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2021-06-05 07:55:42,184 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2021-06-05 07:55:42,319 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2021-06-05 07:55:42,508 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2021-06-05 07:55:42,737 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2021-06-05 07:55:42,893 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 80 [2021-06-05 07:55:43,178 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2021-06-05 07:55:43,384 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 87 [2021-06-05 07:55:43,573 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 07:55:43,864 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2021-06-05 07:55:44,183 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 82 [2021-06-05 07:55:44,465 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 89 [2021-06-05 07:55:45,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:55:45,091 INFO L93 Difference]: Finished difference Result 17000 states and 43864 transitions. [2021-06-05 07:55:45,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2021-06-05 07:55:45,091 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 3.9148936170212765) internal successors, (184), 47 states have internal predecessors, (184), 0 states have call successors, (0), 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 184 [2021-06-05 07:55:45,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:55:45,110 INFO L225 Difference]: With dead ends: 17000 [2021-06-05 07:55:45,110 INFO L226 Difference]: Without dead ends: 16580 [2021-06-05 07:55:45,111 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 4 SyntacticMatches, 7 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4741 ImplicationChecksByTransitivity, 11169.8ms TimeCoverageRelationStatistics Valid=2028, Invalid=14742, Unknown=0, NotChecked=0, Total=16770 [2021-06-05 07:55:45,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16580 states. [2021-06-05 07:55:45,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16580 to 10738. [2021-06-05 07:55:45,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10738 states, 10736 states have (on average 2.574888226527571) internal successors, (27644), 10737 states have internal predecessors, (27644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:55:45,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10738 states to 10738 states and 27644 transitions. [2021-06-05 07:55:45,273 INFO L78 Accepts]: Start accepts. Automaton has 10738 states and 27644 transitions. Word has length 184 [2021-06-05 07:55:45,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:55:45,273 INFO L482 AbstractCegarLoop]: Abstraction has 10738 states and 27644 transitions. [2021-06-05 07:55:45,273 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 47 states, 47 states have (on average 3.9148936170212765) internal successors, (184), 47 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:55:45,273 INFO L276 IsEmpty]: Start isEmpty. Operand 10738 states and 27644 transitions. [2021-06-05 07:55:45,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 07:55:45,282 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:55:45,282 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:55:45,282 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-06-05 07:55:45,282 INFO L430 AbstractCegarLoop]: === Iteration 48 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:55:45,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:55:45,283 INFO L82 PathProgramCache]: Analyzing trace with hash -426751445, now seen corresponding path program 26 times [2021-06-05 07:55:45,283 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:55:45,283 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569873892] [2021-06-05 07:55:45,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:55:45,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:55:47,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-06-05 07:55:47,262 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:55:47,262 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569873892] [2021-06-05 07:55:47,262 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569873892] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:55:47,262 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:55:47,262 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2021-06-05 07:55:47,263 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170627905] [2021-06-05 07:55:47,263 INFO L462 AbstractCegarLoop]: Interpolant automaton has 47 states [2021-06-05 07:55:47,263 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:55:47,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-06-05 07:55:47,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=2030, Unknown=0, NotChecked=0, Total=2162 [2021-06-05 07:55:47,264 INFO L87 Difference]: Start difference. First operand 10738 states and 27644 transitions. Second operand has 47 states, 47 states have (on average 3.9148936170212765) internal successors, (184), 47 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:55:49,864 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 64 [2021-06-05 07:55:51,463 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2021-06-05 07:55:51,705 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 68 [2021-06-05 07:55:51,922 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2021-06-05 07:55:52,279 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 71 [2021-06-05 07:55:52,504 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 70 [2021-06-05 07:55:52,760 WARN L205 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 84 [2021-06-05 07:55:53,179 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 65 [2021-06-05 07:55:53,508 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 75 [2021-06-05 07:55:53,842 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 73 [2021-06-05 07:55:54,190 WARN L205 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 87 [2021-06-05 07:55:55,433 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2021-06-05 07:55:55,863 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2021-06-05 07:55:56,060 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 82 [2021-06-05 07:55:56,410 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2021-06-05 07:55:56,560 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2021-06-05 07:55:56,714 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2021-06-05 07:55:56,879 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 82 [2021-06-05 07:55:57,054 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2021-06-05 07:55:57,213 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2021-06-05 07:55:57,364 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2021-06-05 07:55:57,530 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2021-06-05 07:55:57,709 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2021-06-05 07:55:58,025 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2021-06-05 07:55:58,247 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2021-06-05 07:55:58,404 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 80 [2021-06-05 07:55:58,673 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2021-06-05 07:55:58,872 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 87 [2021-06-05 07:55:59,043 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 07:55:59,373 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2021-06-05 07:55:59,726 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 82 [2021-06-05 07:56:00,002 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 89 [2021-06-05 07:56:00,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:56:00,581 INFO L93 Difference]: Finished difference Result 17409 states and 44936 transitions. [2021-06-05 07:56:00,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2021-06-05 07:56:00,581 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 3.9148936170212765) internal successors, (184), 47 states have internal predecessors, (184), 0 states have call successors, (0), 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 184 [2021-06-05 07:56:00,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:56:00,598 INFO L225 Difference]: With dead ends: 17409 [2021-06-05 07:56:00,599 INFO L226 Difference]: Without dead ends: 16989 [2021-06-05 07:56:00,600 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 4 SyntacticMatches, 7 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4735 ImplicationChecksByTransitivity, 11121.8ms TimeCoverageRelationStatistics Valid=2055, Invalid=14715, Unknown=0, NotChecked=0, Total=16770 [2021-06-05 07:56:00,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16989 states. [2021-06-05 07:56:00,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16989 to 10348. [2021-06-05 07:56:00,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10348 states, 10346 states have (on average 2.5692054900444616) internal successors, (26581), 10347 states have internal predecessors, (26581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:56:00,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10348 states to 10348 states and 26581 transitions. [2021-06-05 07:56:00,754 INFO L78 Accepts]: Start accepts. Automaton has 10348 states and 26581 transitions. Word has length 184 [2021-06-05 07:56:00,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:56:00,754 INFO L482 AbstractCegarLoop]: Abstraction has 10348 states and 26581 transitions. [2021-06-05 07:56:00,754 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 47 states, 47 states have (on average 3.9148936170212765) internal successors, (184), 47 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:56:00,754 INFO L276 IsEmpty]: Start isEmpty. Operand 10348 states and 26581 transitions. [2021-06-05 07:56:00,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 07:56:00,762 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:56:00,762 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:56:00,762 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-06-05 07:56:00,762 INFO L430 AbstractCegarLoop]: === Iteration 49 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:56:00,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:56:00,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1292594165, now seen corresponding path program 27 times [2021-06-05 07:56:00,763 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:56:00,763 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755564429] [2021-06-05 07:56:00,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:56:00,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:56:01,322 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 07:56:01,465 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2021-06-05 07:56:01,616 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2021-06-05 07:56:02,224 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2021-06-05 07:56:04,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:56:04,285 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:56:04,285 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755564429] [2021-06-05 07:56:04,285 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755564429] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:56:04,285 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:56:04,285 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2021-06-05 07:56:04,285 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200509799] [2021-06-05 07:56:04,286 INFO L462 AbstractCegarLoop]: Interpolant automaton has 46 states [2021-06-05 07:56:04,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:56:04,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-06-05 07:56:04,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1935, Unknown=0, NotChecked=0, Total=2070 [2021-06-05 07:56:04,286 INFO L87 Difference]: Start difference. First operand 10348 states and 26581 transitions. Second operand has 46 states, 46 states have (on average 4.0) internal successors, (184), 46 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:56:07,326 WARN L205 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 74 [2021-06-05 07:56:07,866 WARN L205 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 72 Received shutdown request... [2021-06-05 07:56:13,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-06-05 07:56:13,007 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-06-05 07:56:13,007 WARN L547 AbstractCegarLoop]: Verification canceled [2021-06-05 07:56:13,009 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-05 07:56:13,011 WARN L196 ceAbstractionStarter]: Timeout [2021-06-05 07:56:13,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 07:56:13 BasicIcfg [2021-06-05 07:56:13,011 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 07:56:13,012 INFO L168 Benchmark]: Toolchain (without parser) took 776122.98 ms. Allocated memory was 379.6 MB in the beginning and 7.5 GB in the end (delta: 7.2 GB). Free memory was 342.0 MB in the beginning and 3.2 GB in the end (delta: -2.9 GB). Peak memory consumption was 4.3 GB. Max. memory is 16.0 GB. [2021-06-05 07:56:13,012 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 379.6 MB. Free memory is still 360.6 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 07:56:13,012 INFO L168 Benchmark]: CACSL2BoogieTranslator took 562.13 ms. Allocated memory is still 379.6 MB. Free memory was 341.8 MB in the beginning and 314.4 MB in the end (delta: 27.4 MB). Peak memory consumption was 28.3 MB. Max. memory is 16.0 GB. [2021-06-05 07:56:13,012 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.68 ms. Allocated memory is still 379.6 MB. Free memory was 314.4 MB in the beginning and 312.0 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 07:56:13,012 INFO L168 Benchmark]: Boogie Preprocessor took 29.15 ms. Allocated memory is still 379.6 MB. Free memory was 312.0 MB in the beginning and 309.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 07:56:13,012 INFO L168 Benchmark]: RCFGBuilder took 702.73 ms. Allocated memory is still 379.6 MB. Free memory was 309.9 MB in the beginning and 261.9 MB in the end (delta: 47.9 MB). Peak memory consumption was 48.2 MB. Max. memory is 16.0 GB. [2021-06-05 07:56:13,012 INFO L168 Benchmark]: TraceAbstraction took 774745.19 ms. Allocated memory was 379.6 MB in the beginning and 7.5 GB in the end (delta: 7.2 GB). Free memory was 261.6 MB in the beginning and 3.2 GB in the end (delta: -3.0 GB). Peak memory consumption was 4.2 GB. Max. memory is 16.0 GB. [2021-06-05 07:56:13,013 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 379.6 MB. Free memory is still 360.6 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 562.13 ms. Allocated memory is still 379.6 MB. Free memory was 341.8 MB in the beginning and 314.4 MB in the end (delta: 27.4 MB). Peak memory consumption was 28.3 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 65.68 ms. Allocated memory is still 379.6 MB. Free memory was 314.4 MB in the beginning and 312.0 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 29.15 ms. Allocated memory is still 379.6 MB. Free memory was 312.0 MB in the beginning and 309.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 702.73 ms. Allocated memory is still 379.6 MB. Free memory was 309.9 MB in the beginning and 261.9 MB in the end (delta: 47.9 MB). Peak memory consumption was 48.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 774745.19 ms. Allocated memory was 379.6 MB in the beginning and 7.5 GB in the end (delta: 7.2 GB). Free memory was 261.6 MB in the beginning and 3.2 GB in the end (delta: -3.0 GB). Peak memory consumption was 4.2 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (10348states) and FLOYD_HOARE automaton (currently 35 states, 46 states before enhancement),while ReachableStatesComputation was computing reachable states (5937 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1032]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (10348states) and FLOYD_HOARE automaton (currently 35 states, 46 states before enhancement),while ReachableStatesComputation was computing reachable states (5937 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1063]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (10348states) and FLOYD_HOARE automaton (currently 35 states, 46 states before enhancement),while ReachableStatesComputation was computing reachable states (5937 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1064]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (10348states) and FLOYD_HOARE automaton (currently 35 states, 46 states before enhancement),while ReachableStatesComputation was computing reachable states (5937 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1059]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (10348states) and FLOYD_HOARE automaton (currently 35 states, 46 states before enhancement),while ReachableStatesComputation was computing reachable states (5937 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 402 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 774427.7ms, OverallIterations: 49, TraceHistogramMax: 1, EmptinessCheckTime: 446.8ms, AutomataDifference: 582830.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1130.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 20417 SDtfs, 110297 SDslu, 398248 SDs, 0 SdLazy, 192881 SolverSat, 6016 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 234169.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5110 GetRequests, 628 SyntacticMatches, 228 SemanticMatches, 4254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131613 ImplicationChecksByTransitivity, 481950.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=23654occurred in iteration=0, InterpolantAutomatonStates: 2630, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 10767.7ms AutomataMinimizationTime, 48 MinimizatonAttempts, 161710 StatesRemovedByMinimization, 43 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 140.6ms SsaConstructionTime, 1258.0ms SatisfiabilityAnalysisTime, 177316.6ms InterpolantComputationTime, 7674 NumberOfCodeBlocks, 7674 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 7625 ConstructedInterpolants, 0 QuantifiedInterpolants, 504054 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 49 InterpolantComputations, 49 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 could not prove your program: Timeout Completed graceful shutdown