/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-29289db [2021-06-04 21:26:52,852 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-04 21:26:52,854 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-04 21:26:52,884 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-04 21:26:52,884 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-04 21:26:52,887 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-04 21:26:52,889 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-04 21:26:52,895 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-04 21:26:52,897 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-04 21:26:52,900 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-04 21:26:52,901 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-04 21:26:52,903 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-04 21:26:52,903 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-04 21:26:52,905 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-04 21:26:52,906 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-04 21:26:52,907 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-04 21:26:52,910 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-04 21:26:52,911 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-04 21:26:52,913 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-04 21:26:52,918 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-04 21:26:52,919 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-04 21:26:52,920 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-04 21:26:52,921 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-04 21:26:52,923 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-04 21:26:52,928 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-04 21:26:52,929 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-04 21:26:52,929 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-04 21:26:52,930 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-04 21:26:52,931 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-04 21:26:52,931 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-04 21:26:52,932 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-04 21:26:52,933 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-04 21:26:52,934 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-04 21:26:52,935 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-04 21:26:52,935 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-04 21:26:52,936 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-04 21:26:52,936 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-04 21:26:52,936 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-04 21:26:52,936 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-04 21:26:52,937 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-04 21:26:52,938 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-04 21:26:52,941 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2021-06-04 21:26:52,978 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-04 21:26:52,979 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-04 21:26:52,979 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-04 21:26:52,979 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-04 21:26:52,981 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-04 21:26:52,981 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-04 21:26:52,981 INFO L138 SettingsManager]: * Use SBE=true [2021-06-04 21:26:52,981 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-04 21:26:52,981 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-04 21:26:52,982 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-04 21:26:52,982 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-04 21:26:52,982 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-04 21:26:52,982 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-04 21:26:52,982 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-04 21:26:52,982 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-04 21:26:52,982 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-04 21:26:52,982 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-04 21:26:52,982 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-04 21:26:52,983 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-04 21:26:52,983 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-04 21:26:52,983 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-04 21:26:52,983 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-04 21:26:52,983 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-04 21:26:52,983 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-04 21:26:52,983 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-04 21:26:52,983 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-04 21:26:52,983 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-04 21:26:52,983 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-04 21:26:52,983 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-04 21:26:52,983 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-04 21:26:52,984 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-04 21:26:52,984 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-04 21:26:53,265 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-04 21:26:53,293 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-04 21:26:53,295 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-04 21:26:53,296 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-04 21:26:53,297 INFO L275 PluginConnector]: CDTParser initialized [2021-06-04 21:26:53,297 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue.i [2021-06-04 21:26:53,345 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e403da06a/f314411085e040179639b491e0cf3a5e/FLAG35e611ce0 [2021-06-04 21:26:53,955 INFO L306 CDTParser]: Found 1 translation units. [2021-06-04 21:26:53,955 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i [2021-06-04 21:26:53,972 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e403da06a/f314411085e040179639b491e0cf3a5e/FLAG35e611ce0 [2021-06-04 21:26:54,338 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e403da06a/f314411085e040179639b491e0cf3a5e [2021-06-04 21:26:54,340 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-04 21:26:54,341 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-04 21:26:54,342 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-04 21:26:54,342 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-04 21:26:54,348 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-04 21:26:54,349 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 09:26:54" (1/1) ... [2021-06-04 21:26:54,349 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ea3ed57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:26:54, skipping insertion in model container [2021-06-04 21:26:54,350 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 09:26:54" (1/1) ... [2021-06-04 21:26:54,355 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-04 21:26:54,406 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-04 21:26:54,745 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-04 21:26:54,749 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-04 21:26:54,751 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-04 21:26:54,753 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-04 21:26:54,761 INFO L203 MainTranslator]: Completed pre-run [2021-06-04 21:26:54,793 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-04 21:26:54,795 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-04 21:26:54,797 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-04 21:26:54,798 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-04 21:26:54,902 INFO L208 MainTranslator]: Completed translation [2021-06-04 21:26:54,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:26:54 WrapperNode [2021-06-04 21:26:54,903 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-04 21:26:54,903 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-04 21:26:54,904 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-04 21:26:54,904 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-04 21:26:54,908 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:26:54" (1/1) ... [2021-06-04 21:26:54,923 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:26:54" (1/1) ... [2021-06-04 21:26:54,949 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-04 21:26:54,950 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-04 21:26:54,950 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-04 21:26:54,950 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-04 21:26:54,957 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:26:54" (1/1) ... [2021-06-04 21:26:54,957 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:26:54" (1/1) ... [2021-06-04 21:26:54,961 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:26:54" (1/1) ... [2021-06-04 21:26:54,962 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:26:54" (1/1) ... [2021-06-04 21:26:54,972 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:26:54" (1/1) ... [2021-06-04 21:26:54,975 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:26:54" (1/1) ... [2021-06-04 21:26:54,978 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:26:54" (1/1) ... [2021-06-04 21:26:54,981 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-04 21:26:54,982 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-04 21:26:54,982 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-04 21:26:54,982 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-04 21:26:54,983 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:26:54" (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-04 21:26:55,054 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2021-06-04 21:26:55,056 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2021-06-04 21:26:55,056 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2021-06-04 21:26:55,056 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2021-06-04 21:26:55,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-04 21:26:55,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-04 21:26:55,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-06-04 21:26:55,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-04 21:26:55,057 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-06-04 21:26:55,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-04 21:26:55,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-04 21:26:55,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-04 21:26:55,059 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-04 21:26:55,647 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-04 21:26:55,647 INFO L299 CfgBuilder]: Removed 18 assume(true) statements. [2021-06-04 21:26:55,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 09:26:55 BoogieIcfgContainer [2021-06-04 21:26:55,649 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-04 21:26:55,650 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-04 21:26:55,650 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-04 21:26:55,652 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-04 21:26:55,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 09:26:54" (1/3) ... [2021-06-04 21:26:55,656 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@231c54d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 09:26:55, skipping insertion in model container [2021-06-04 21:26:55,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:26:54" (2/3) ... [2021-06-04 21:26:55,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@231c54d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 09:26:55, skipping insertion in model container [2021-06-04 21:26:55,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 09:26:55" (3/3) ... [2021-06-04 21:26:55,658 INFO L111 eAbstractionObserver]: Analyzing ICFG queue.i [2021-06-04 21:26:55,666 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-04 21:26:55,666 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-04 21:26:55,666 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2021-06-04 21:26:55,667 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-04 21:26:55,719 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,719 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,719 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,719 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,720 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,720 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,720 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,720 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,720 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,720 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,720 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,720 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,721 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,721 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,721 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,721 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,721 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,721 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,721 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,721 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,722 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,722 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,722 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,722 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,722 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,722 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,722 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,722 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,722 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,723 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,723 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,723 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,723 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,723 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,723 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,723 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,723 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,723 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,723 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,724 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,724 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,724 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,724 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,724 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,724 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,724 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,724 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,724 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,724 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,725 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,725 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,725 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,725 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,725 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,725 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,725 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,725 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,725 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,725 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,726 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,726 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,726 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,726 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,726 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,726 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,726 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,726 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,726 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,727 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,727 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,727 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,727 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,727 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,727 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,727 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,727 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,727 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,727 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,728 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,728 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,728 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,728 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,728 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,728 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,728 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,728 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,729 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,729 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,729 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,729 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,729 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,729 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,729 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,729 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,729 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,730 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,730 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,730 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,730 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,730 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,730 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,730 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,730 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,731 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,731 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,731 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,731 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,731 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,731 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,731 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,731 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,731 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,732 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,732 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,732 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,732 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,732 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,732 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,732 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,732 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,732 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,733 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,733 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,733 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,733 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,733 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,733 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,733 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,733 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,733 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,734 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,734 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,734 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,734 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,734 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,734 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,734 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,734 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,734 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,734 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,735 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,735 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,735 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,735 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,735 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,735 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,735 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,736 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,736 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,736 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,736 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,736 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,736 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,736 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,737 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,737 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,737 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,737 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,737 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,737 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,737 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,738 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,738 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,738 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,738 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,738 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,738 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,738 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,738 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,738 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,738 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,739 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,739 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,739 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,739 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,739 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,739 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,739 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,739 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,739 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,740 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,740 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,740 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,740 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,740 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,740 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,740 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,740 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,740 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,741 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,741 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,741 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,741 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,741 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,741 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,741 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,741 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,741 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,742 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,742 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,742 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,742 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,742 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,742 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,742 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,742 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,743 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,743 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,743 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,743 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,743 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,743 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,743 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,743 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,744 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,744 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,744 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,744 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,744 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,744 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,744 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,745 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,745 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,745 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,745 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,745 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,745 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,745 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,745 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,746 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,746 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,746 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,746 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,746 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,746 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,746 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,747 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,747 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,747 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,747 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,747 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,747 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,747 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,748 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,748 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,748 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,748 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,748 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,748 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,748 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,748 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,749 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,749 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,749 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,749 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,749 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,749 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,749 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,749 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,749 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,750 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,750 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,750 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,750 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,750 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,750 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,750 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,750 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,751 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,751 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,751 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,751 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,751 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,751 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,751 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,751 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,751 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,752 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,752 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,752 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,752 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,752 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,752 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,752 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,752 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,752 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,752 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,753 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,753 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,753 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,753 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,753 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,754 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,754 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,754 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,754 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,754 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,754 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,754 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,754 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,755 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,755 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,755 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,755 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,755 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,755 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,755 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,755 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,756 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,756 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,756 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,756 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,756 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,756 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,756 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,757 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,757 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,757 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,757 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,757 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,757 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,757 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,757 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,758 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,758 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,758 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,758 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,758 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,758 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,758 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,759 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,759 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,759 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,759 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,759 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,759 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,759 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,760 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,760 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,760 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,760 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,760 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,760 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,760 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,761 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,761 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,761 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,761 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,761 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,761 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,761 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,761 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,762 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,762 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,762 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,762 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,762 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,762 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,762 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,762 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,762 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,763 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,763 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,763 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,763 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,763 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,763 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,763 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,763 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,763 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,763 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,764 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,764 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,764 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,764 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,764 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,764 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,764 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,764 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,765 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,765 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,765 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,765 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,765 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,765 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,765 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,765 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,765 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,766 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,766 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,767 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,767 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,767 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,767 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,767 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,767 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,767 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,767 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,768 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,768 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,768 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,768 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,768 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,768 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,768 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,769 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,769 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,769 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,769 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,769 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,769 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,769 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,770 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,770 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,770 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,770 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,770 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,770 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,771 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,771 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,771 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,771 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,771 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,771 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,771 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,771 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,771 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,772 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,772 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,772 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,772 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,772 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,772 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,789 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,789 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,789 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,789 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,789 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,789 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,789 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,790 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,790 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,790 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,790 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,790 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,790 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,790 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,791 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,791 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,791 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,791 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,791 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,791 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,791 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,791 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,792 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,792 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,792 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,792 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,792 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,792 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,792 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,793 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,793 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,793 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,793 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,793 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,793 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,793 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,793 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,793 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,794 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,794 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,794 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,794 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,794 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,794 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,794 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,795 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,795 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,795 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,795 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,795 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,795 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,795 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,795 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,796 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,796 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,796 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,796 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,796 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,796 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,796 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,797 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,797 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,797 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,797 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,797 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,797 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,797 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,797 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,798 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,798 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,798 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,798 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,798 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,798 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,798 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,798 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,799 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,799 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,799 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,799 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,799 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,799 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,799 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,799 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,800 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,800 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,800 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,800 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,800 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,800 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,800 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,800 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,801 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,801 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,801 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,801 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,801 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,801 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,801 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,801 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,802 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,802 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,802 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,802 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,802 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,802 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,802 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,802 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,803 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,803 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,803 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,803 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,803 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,803 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,803 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,803 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,804 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,804 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,804 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,804 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,804 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,820 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,821 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,821 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,821 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,821 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,821 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,821 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,821 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,822 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,822 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,822 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,822 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,822 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,822 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,824 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,825 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,825 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,825 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,825 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,825 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,825 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,826 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,826 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,826 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,826 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,826 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,826 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,827 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,827 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,827 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,827 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,827 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,827 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,827 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,828 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,828 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,828 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,828 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,828 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,828 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,828 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,829 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,829 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,829 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,829 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,829 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,829 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,829 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,829 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,840 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,840 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,840 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,840 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,840 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,841 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,841 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,841 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,841 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,841 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,841 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,841 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,841 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,842 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,842 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,842 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,842 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,842 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,842 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,842 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,842 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,843 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:55,861 INFO L149 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2021-06-04 21:26:55,881 INFO L255 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-06-04 21:26:55,897 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-04 21:26:55,897 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-04 21:26:55,897 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-04 21:26:55,897 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-04 21:26:55,898 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-04 21:26:55,898 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-04 21:26:55,898 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-04 21:26:55,898 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-04 21:26:55,911 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 247 places, 257 transitions, 536 flow [2021-06-04 21:26:57,207 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-04 21:26:57,260 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-04 21:26:57,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-06-04 21:26:57,266 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:26:57,266 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-04 21:26:57,267 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-04 21:26:57,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:26:57,271 INFO L82 PathProgramCache]: Analyzing trace with hash 846969469, now seen corresponding path program 1 times [2021-06-04 21:26:57,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:26:57,279 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820125126] [2021-06-04 21:26:57,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:26:57,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:26:57,487 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-04 21:26:57,487 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:26:57,487 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820125126] [2021-06-04 21:26:57,488 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820125126] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:26:57,488 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:26:57,488 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-04 21:26:57,489 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077932944] [2021-06-04 21:26:57,492 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-04 21:26:57,492 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:26:57,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-04 21:26:57,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-04 21:26:57,541 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-04 21:26:57,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:26:57,885 INFO L93 Difference]: Finished difference Result 23006 states and 64260 transitions. [2021-06-04 21:26:57,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-04 21:26:57,886 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-04 21:26:57,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:26:58,032 INFO L225 Difference]: With dead ends: 23006 [2021-06-04 21:26:58,033 INFO L226 Difference]: Without dead ends: 22283 [2021-06-04 21:26:58,034 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-04 21:26:58,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22283 states. [2021-06-04 21:26:58,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22283 to 22283. [2021-06-04 21:26:58,792 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-04 21:26:59,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22283 states to 22283 states and 62354 transitions. [2021-06-04 21:26:59,048 INFO L78 Accepts]: Start accepts. Automaton has 22283 states and 62354 transitions. Word has length 48 [2021-06-04 21:26:59,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:26:59,050 INFO L482 AbstractCegarLoop]: Abstraction has 22283 states and 62354 transitions. [2021-06-04 21:26:59,050 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-04 21:26:59,050 INFO L276 IsEmpty]: Start isEmpty. Operand 22283 states and 62354 transitions. [2021-06-04 21:26:59,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-06-04 21:26:59,064 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:26:59,065 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-04 21:26:59,065 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-04 21:26:59,066 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-04 21:26:59,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:26:59,069 INFO L82 PathProgramCache]: Analyzing trace with hash -432801653, now seen corresponding path program 1 times [2021-06-04 21:26:59,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:26:59,069 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581538081] [2021-06-04 21:26:59,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:26:59,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:26:59,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-04 21:26:59,395 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:26:59,396 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581538081] [2021-06-04 21:26:59,396 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581538081] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:26:59,396 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:26:59,396 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-04 21:26:59,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155633833] [2021-06-04 21:26:59,397 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-04 21:26:59,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:26:59,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-04 21:26:59,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-06-04 21:26:59,399 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-04 21:27:00,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:27:00,155 INFO L93 Difference]: Finished difference Result 22280 states and 62350 transitions. [2021-06-04 21:27:00,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-04 21:27:00,156 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-04 21:27:00,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:27:00,216 INFO L225 Difference]: With dead ends: 22280 [2021-06-04 21:27:00,217 INFO L226 Difference]: Without dead ends: 22280 [2021-06-04 21:27:00,218 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 376.2ms TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420 [2021-06-04 21:27:00,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22280 states. [2021-06-04 21:27:00,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22280 to 22280. [2021-06-04 21:27:00,840 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-04 21:27:00,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22280 states to 22280 states and 62350 transitions. [2021-06-04 21:27:00,948 INFO L78 Accepts]: Start accepts. Automaton has 22280 states and 62350 transitions. Word has length 83 [2021-06-04 21:27:00,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:27:00,949 INFO L482 AbstractCegarLoop]: Abstraction has 22280 states and 62350 transitions. [2021-06-04 21:27:00,949 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-04 21:27:00,949 INFO L276 IsEmpty]: Start isEmpty. Operand 22280 states and 62350 transitions. [2021-06-04 21:27:00,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-06-04 21:27:00,955 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:27:00,955 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-04 21:27:00,955 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-04 21:27:00,955 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-04 21:27:00,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:27:00,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1997559754, now seen corresponding path program 1 times [2021-06-04 21:27:00,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:27:00,956 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389505577] [2021-06-04 21:27:00,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:27:00,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:27:01,033 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-04 21:27:01,033 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:27:01,033 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389505577] [2021-06-04 21:27:01,034 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389505577] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:27:01,034 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:27:01,035 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-04 21:27:01,036 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206195640] [2021-06-04 21:27:01,041 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-04 21:27:01,041 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:27:01,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-04 21:27:01,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-04 21:27:01,046 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-04 21:27:01,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:27:01,258 INFO L93 Difference]: Finished difference Result 22063 states and 61535 transitions. [2021-06-04 21:27:01,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-04 21:27:01,259 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-04 21:27:01,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:27:01,343 INFO L225 Difference]: With dead ends: 22063 [2021-06-04 21:27:01,344 INFO L226 Difference]: Without dead ends: 22063 [2021-06-04 21:27:01,345 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-04 21:27:01,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22063 states. [2021-06-04 21:27:01,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22063 to 22063. [2021-06-04 21:27:01,897 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-04 21:27:01,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22063 states to 22063 states and 61535 transitions. [2021-06-04 21:27:01,951 INFO L78 Accepts]: Start accepts. Automaton has 22063 states and 61535 transitions. Word has length 84 [2021-06-04 21:27:01,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:27:01,951 INFO L482 AbstractCegarLoop]: Abstraction has 22063 states and 61535 transitions. [2021-06-04 21:27:01,952 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-04 21:27:01,952 INFO L276 IsEmpty]: Start isEmpty. Operand 22063 states and 61535 transitions. [2021-06-04 21:27:01,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-06-04 21:27:01,962 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:27:01,962 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-04 21:27:01,962 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-04 21:27:01,962 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-04 21:27:01,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:27:01,963 INFO L82 PathProgramCache]: Analyzing trace with hash -588297784, now seen corresponding path program 1 times [2021-06-04 21:27:01,963 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:27:01,963 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722481033] [2021-06-04 21:27:01,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:27:01,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:27:02,014 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-04 21:27:02,014 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:27:02,014 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722481033] [2021-06-04 21:27:02,015 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722481033] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:27:02,015 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:27:02,015 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-04 21:27:02,015 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187465919] [2021-06-04 21:27:02,015 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-04 21:27:02,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:27:02,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-04 21:27:02,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-04 21:27:02,016 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-04 21:27:02,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:27:02,077 INFO L93 Difference]: Finished difference Result 15355 states and 42187 transitions. [2021-06-04 21:27:02,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-04 21:27:02,078 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-04 21:27:02,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:27:02,130 INFO L225 Difference]: With dead ends: 15355 [2021-06-04 21:27:02,130 INFO L226 Difference]: Without dead ends: 15112 [2021-06-04 21:27:02,131 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-04 21:27:02,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15112 states. [2021-06-04 21:27:02,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15112 to 15112. [2021-06-04 21:27:02,557 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-04 21:27:02,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15112 states to 15112 states and 41551 transitions. [2021-06-04 21:27:02,592 INFO L78 Accepts]: Start accepts. Automaton has 15112 states and 41551 transitions. Word has length 93 [2021-06-04 21:27:02,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:27:02,593 INFO L482 AbstractCegarLoop]: Abstraction has 15112 states and 41551 transitions. [2021-06-04 21:27:02,593 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-04 21:27:02,593 INFO L276 IsEmpty]: Start isEmpty. Operand 15112 states and 41551 transitions. [2021-06-04 21:27:02,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-06-04 21:27:02,601 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:27:02,601 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-04 21:27:02,601 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-04 21:27:02,601 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-04 21:27:02,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:27:02,601 INFO L82 PathProgramCache]: Analyzing trace with hash -724837919, now seen corresponding path program 1 times [2021-06-04 21:27:02,602 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:27:02,602 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807870890] [2021-06-04 21:27:02,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:27:02,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:27:02,737 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-04 21:27:02,738 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:27:02,738 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807870890] [2021-06-04 21:27:02,738 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807870890] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:27:02,738 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:27:02,738 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-04 21:27:02,738 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813586440] [2021-06-04 21:27:02,739 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-04 21:27:02,739 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:27:02,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-04 21:27:02,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-04 21:27:02,739 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-04 21:27:02,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:27:02,841 INFO L93 Difference]: Finished difference Result 26661 states and 73631 transitions. [2021-06-04 21:27:02,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-04 21:27:02,841 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-04 21:27:02,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:27:02,891 INFO L225 Difference]: With dead ends: 26661 [2021-06-04 21:27:02,891 INFO L226 Difference]: Without dead ends: 26571 [2021-06-04 21:27:02,892 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-04 21:27:02,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26571 states. [2021-06-04 21:27:03,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26571 to 15217. [2021-06-04 21:27:03,365 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-04 21:27:03,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15217 states to 15217 states and 41818 transitions. [2021-06-04 21:27:03,393 INFO L78 Accepts]: Start accepts. Automaton has 15217 states and 41818 transitions. Word has length 99 [2021-06-04 21:27:03,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:27:03,394 INFO L482 AbstractCegarLoop]: Abstraction has 15217 states and 41818 transitions. [2021-06-04 21:27:03,394 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-04 21:27:03,394 INFO L276 IsEmpty]: Start isEmpty. Operand 15217 states and 41818 transitions. [2021-06-04 21:27:03,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-06-04 21:27:03,401 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:27:03,401 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-04 21:27:03,401 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-04 21:27:03,401 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-04 21:27:03,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:27:03,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1651068086, now seen corresponding path program 1 times [2021-06-04 21:27:03,402 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:27:03,402 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604040171] [2021-06-04 21:27:03,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:27:03,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:27:03,737 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-04 21:27:03,738 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:27:03,738 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604040171] [2021-06-04 21:27:03,738 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604040171] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:27:03,738 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:27:03,738 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-06-04 21:27:03,739 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664626824] [2021-06-04 21:27:03,739 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-04 21:27:03,739 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:27:03,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-04 21:27:03,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2021-06-04 21:27:03,740 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-04 21:27:04,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:27:04,693 INFO L93 Difference]: Finished difference Result 15327 states and 42117 transitions. [2021-06-04 21:27:04,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-04 21:27:04,693 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-04 21:27:04,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:27:04,719 INFO L225 Difference]: With dead ends: 15327 [2021-06-04 21:27:04,719 INFO L226 Difference]: Without dead ends: 15327 [2021-06-04 21:27:04,720 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 652.2ms TimeCoverageRelationStatistics Valid=207, Invalid=549, Unknown=0, NotChecked=0, Total=756 [2021-06-04 21:27:04,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15327 states. [2021-06-04 21:27:05,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15327 to 15267. [2021-06-04 21:27:05,131 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-04 21:27:05,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15267 states to 15267 states and 41955 transitions. [2021-06-04 21:27:05,166 INFO L78 Accepts]: Start accepts. Automaton has 15267 states and 41955 transitions. Word has length 100 [2021-06-04 21:27:05,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:27:05,166 INFO L482 AbstractCegarLoop]: Abstraction has 15267 states and 41955 transitions. [2021-06-04 21:27:05,166 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-04 21:27:05,166 INFO L276 IsEmpty]: Start isEmpty. Operand 15267 states and 41955 transitions. [2021-06-04 21:27:05,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-06-04 21:27:05,174 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:27:05,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] [2021-06-04 21:27:05,174 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-04 21:27:05,174 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-04 21:27:05,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:27:05,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1578711888, now seen corresponding path program 1 times [2021-06-04 21:27:05,175 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:27:05,175 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035655961] [2021-06-04 21:27:05,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:27:05,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:27:05,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:27:05,946 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:27:05,946 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035655961] [2021-06-04 21:27:05,947 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035655961] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:27:05,947 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:27:05,947 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-06-04 21:27:05,947 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892808550] [2021-06-04 21:27:05,947 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-06-04 21:27:05,947 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:27:05,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-06-04 21:27:05,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=628, Unknown=0, NotChecked=0, Total=702 [2021-06-04 21:27:05,949 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-04 21:27:08,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:27:08,210 INFO L93 Difference]: Finished difference Result 15277 states and 41997 transitions. [2021-06-04 21:27:08,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-06-04 21:27:08,210 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-04 21:27:08,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:27:08,227 INFO L225 Difference]: With dead ends: 15277 [2021-06-04 21:27:08,227 INFO L226 Difference]: Without dead ends: 15262 [2021-06-04 21:27:08,228 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 1837.8ms TimeCoverageRelationStatistics Valid=446, Invalid=2004, Unknown=0, NotChecked=0, Total=2450 [2021-06-04 21:27:08,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15262 states. [2021-06-04 21:27:08,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15262 to 15262. [2021-06-04 21:27:08,496 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-04 21:27:08,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15262 states to 15262 states and 41973 transitions. [2021-06-04 21:27:08,520 INFO L78 Accepts]: Start accepts. Automaton has 15262 states and 41973 transitions. Word has length 104 [2021-06-04 21:27:08,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:27:08,520 INFO L482 AbstractCegarLoop]: Abstraction has 15262 states and 41973 transitions. [2021-06-04 21:27:08,521 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-04 21:27:08,521 INFO L276 IsEmpty]: Start isEmpty. Operand 15262 states and 41973 transitions. [2021-06-04 21:27:08,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-04 21:27:08,528 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:27:08,528 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-04 21:27:08,528 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-04 21:27:08,528 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-04 21:27:08,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:27:08,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1198768392, now seen corresponding path program 1 times [2021-06-04 21:27:08,529 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:27:08,529 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462972501] [2021-06-04 21:27:08,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:27:08,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:27:08,819 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2021-06-04 21:27:09,078 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-04 21:27:09,078 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:27:09,078 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462972501] [2021-06-04 21:27:09,079 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462972501] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:27:09,079 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:27:09,079 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-06-04 21:27:09,079 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579074660] [2021-06-04 21:27:09,080 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-04 21:27:09,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:27:09,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-04 21:27:09,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2021-06-04 21:27:09,080 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-04 21:27:10,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:27:10,098 INFO L93 Difference]: Finished difference Result 17982 states and 49376 transitions. [2021-06-04 21:27:10,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-04 21:27:10,099 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-04 21:27:10,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:27:10,121 INFO L225 Difference]: With dead ends: 17982 [2021-06-04 21:27:10,122 INFO L226 Difference]: Without dead ends: 17982 [2021-06-04 21:27:10,122 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 901.9ms TimeCoverageRelationStatistics Valid=301, Invalid=959, Unknown=0, NotChecked=0, Total=1260 [2021-06-04 21:27:10,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17982 states. [2021-06-04 21:27:10,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17982 to 16042. [2021-06-04 21:27:10,393 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-04 21:27:10,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16042 states to 16042 states and 44079 transitions. [2021-06-04 21:27:10,421 INFO L78 Accepts]: Start accepts. Automaton has 16042 states and 44079 transitions. Word has length 105 [2021-06-04 21:27:10,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:27:10,421 INFO L482 AbstractCegarLoop]: Abstraction has 16042 states and 44079 transitions. [2021-06-04 21:27:10,422 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-04 21:27:10,422 INFO L276 IsEmpty]: Start isEmpty. Operand 16042 states and 44079 transitions. [2021-06-04 21:27:10,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-04 21:27:10,537 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:27:10,537 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-04 21:27:10,537 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-04 21:27:10,537 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-04 21:27:10,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:27:10,538 INFO L82 PathProgramCache]: Analyzing trace with hash 431874918, now seen corresponding path program 2 times [2021-06-04 21:27:10,538 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:27:10,538 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929368037] [2021-06-04 21:27:10,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:27:10,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:27:10,921 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-04 21:27:10,921 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:27:10,921 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929368037] [2021-06-04 21:27:10,921 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929368037] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:27:10,922 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:27:10,922 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-06-04 21:27:10,922 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938760452] [2021-06-04 21:27:10,922 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-04 21:27:10,922 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:27:10,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-04 21:27:10,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2021-06-04 21:27:10,923 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-04 21:27:12,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:27:12,341 INFO L93 Difference]: Finished difference Result 19200 states and 52610 transitions. [2021-06-04 21:27:12,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-04 21:27:12,342 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-04 21:27:12,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:27:12,366 INFO L225 Difference]: With dead ends: 19200 [2021-06-04 21:27:12,366 INFO L226 Difference]: Without dead ends: 19200 [2021-06-04 21:27:12,367 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 978.6ms TimeCoverageRelationStatistics Valid=359, Invalid=1047, Unknown=0, NotChecked=0, Total=1406 [2021-06-04 21:27:12,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19200 states. [2021-06-04 21:27:12,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19200 to 16048. [2021-06-04 21:27:12,722 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-04 21:27:12,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16048 states to 16048 states and 44091 transitions. [2021-06-04 21:27:12,755 INFO L78 Accepts]: Start accepts. Automaton has 16048 states and 44091 transitions. Word has length 105 [2021-06-04 21:27:12,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:27:12,756 INFO L482 AbstractCegarLoop]: Abstraction has 16048 states and 44091 transitions. [2021-06-04 21:27:12,756 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-04 21:27:12,756 INFO L276 IsEmpty]: Start isEmpty. Operand 16048 states and 44091 transitions. [2021-06-04 21:27:12,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-04 21:27:12,763 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:27:12,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:27:12,763 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-04 21:27:12,763 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-04 21:27:12,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:27:12,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1360916942, now seen corresponding path program 3 times [2021-06-04 21:27:12,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:27:12,764 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735106596] [2021-06-04 21:27:12,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:27:12,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:27:13,115 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-04 21:27:13,116 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:27:13,116 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735106596] [2021-06-04 21:27:13,116 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735106596] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:27:13,116 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:27:13,116 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-06-04 21:27:13,116 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290118056] [2021-06-04 21:27:13,116 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-04 21:27:13,116 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:27:13,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-04 21:27:13,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2021-06-04 21:27:13,117 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-04 21:27:14,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:27:14,520 INFO L93 Difference]: Finished difference Result 18840 states and 51638 transitions. [2021-06-04 21:27:14,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-04 21:27:14,521 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-04 21:27:14,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:27:14,545 INFO L225 Difference]: With dead ends: 18840 [2021-06-04 21:27:14,545 INFO L226 Difference]: Without dead ends: 18840 [2021-06-04 21:27:14,546 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 1019.7ms TimeCoverageRelationStatistics Valid=413, Invalid=1227, Unknown=0, NotChecked=0, Total=1640 [2021-06-04 21:27:14,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18840 states. [2021-06-04 21:27:14,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18840 to 16052. [2021-06-04 21:27:14,837 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-04 21:27:14,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16052 states to 16052 states and 44099 transitions. [2021-06-04 21:27:14,862 INFO L78 Accepts]: Start accepts. Automaton has 16052 states and 44099 transitions. Word has length 105 [2021-06-04 21:27:14,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:27:14,862 INFO L482 AbstractCegarLoop]: Abstraction has 16052 states and 44099 transitions. [2021-06-04 21:27:14,862 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-04 21:27:14,862 INFO L276 IsEmpty]: Start isEmpty. Operand 16052 states and 44099 transitions. [2021-06-04 21:27:14,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-04 21:27:14,867 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:27:14,867 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-04 21:27:14,867 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-04 21:27:14,868 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-04 21:27:14,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:27:14,868 INFO L82 PathProgramCache]: Analyzing trace with hash 558943188, now seen corresponding path program 4 times [2021-06-04 21:27:14,868 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:27:14,868 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970706031] [2021-06-04 21:27:14,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:27:14,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:27:15,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-04 21:27:15,221 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:27:15,221 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970706031] [2021-06-04 21:27:15,221 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970706031] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:27:15,221 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:27:15,221 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-06-04 21:27:15,221 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646457946] [2021-06-04 21:27:15,221 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-04 21:27:15,222 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:27:15,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-04 21:27:15,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2021-06-04 21:27:15,224 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-04 21:27:16,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:27:16,027 INFO L93 Difference]: Finished difference Result 15932 states and 43715 transitions. [2021-06-04 21:27:16,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-04 21:27:16,027 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-04 21:27:16,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:27:16,043 INFO L225 Difference]: With dead ends: 15932 [2021-06-04 21:27:16,043 INFO L226 Difference]: Without dead ends: 15932 [2021-06-04 21:27:16,044 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 722.2ms TimeCoverageRelationStatistics Valid=244, Invalid=748, Unknown=0, NotChecked=0, Total=992 [2021-06-04 21:27:16,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15932 states. [2021-06-04 21:27:16,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15932 to 15082. [2021-06-04 21:27:16,254 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-04 21:27:16,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15082 states to 15082 states and 41427 transitions. [2021-06-04 21:27:16,281 INFO L78 Accepts]: Start accepts. Automaton has 15082 states and 41427 transitions. Word has length 105 [2021-06-04 21:27:16,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:27:16,282 INFO L482 AbstractCegarLoop]: Abstraction has 15082 states and 41427 transitions. [2021-06-04 21:27:16,282 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-04 21:27:16,282 INFO L276 IsEmpty]: Start isEmpty. Operand 15082 states and 41427 transitions. [2021-06-04 21:27:16,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-06-04 21:27:16,286 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:27:16,287 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-04 21:27:16,287 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-04 21:27:16,287 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-04 21:27:16,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:27:16,287 INFO L82 PathProgramCache]: Analyzing trace with hash -689257618, now seen corresponding path program 1 times [2021-06-04 21:27:16,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:27:16,287 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368404339] [2021-06-04 21:27:16,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:27:16,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:27:17,267 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-04 21:27:17,268 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:27:17,268 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368404339] [2021-06-04 21:27:17,268 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368404339] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:27:17,268 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:27:17,268 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-06-04 21:27:17,268 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192059202] [2021-06-04 21:27:17,268 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-06-04 21:27:17,269 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:27:17,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-06-04 21:27:17,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=785, Unknown=0, NotChecked=0, Total=870 [2021-06-04 21:27:17,269 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-04 21:27:19,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:27:19,614 INFO L93 Difference]: Finished difference Result 17233 states and 47366 transitions. [2021-06-04 21:27:19,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-04 21:27:19,614 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-04 21:27:19,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:27:19,638 INFO L225 Difference]: With dead ends: 17233 [2021-06-04 21:27:19,638 INFO L226 Difference]: Without dead ends: 16603 [2021-06-04 21:27:19,639 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 2179.7ms TimeCoverageRelationStatistics Valid=525, Invalid=2337, Unknown=0, NotChecked=0, Total=2862 [2021-06-04 21:27:19,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16603 states. [2021-06-04 21:27:19,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16603 to 14767. [2021-06-04 21:27:19,986 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-04 21:27:20,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14767 states to 14767 states and 40638 transitions. [2021-06-04 21:27:20,012 INFO L78 Accepts]: Start accepts. Automaton has 14767 states and 40638 transitions. Word has length 109 [2021-06-04 21:27:20,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:27:20,013 INFO L482 AbstractCegarLoop]: Abstraction has 14767 states and 40638 transitions. [2021-06-04 21:27:20,013 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-04 21:27:20,013 INFO L276 IsEmpty]: Start isEmpty. Operand 14767 states and 40638 transitions. [2021-06-04 21:27:20,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-06-04 21:27:20,017 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:27:20,017 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-04 21:27:20,017 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-04 21:27:20,017 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-04 21:27:20,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:27:20,017 INFO L82 PathProgramCache]: Analyzing trace with hash 898788268, now seen corresponding path program 2 times [2021-06-04 21:27:20,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:27:20,018 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816080491] [2021-06-04 21:27:20,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:27:20,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:27:20,853 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-04 21:27:20,853 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:27:20,853 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816080491] [2021-06-04 21:27:20,853 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816080491] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:27:20,853 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:27:20,853 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-06-04 21:27:20,853 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744608271] [2021-06-04 21:27:20,854 INFO L462 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-06-04 21:27:20,854 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:27:20,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-06-04 21:27:20,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=734, Unknown=0, NotChecked=0, Total=812 [2021-06-04 21:27:20,855 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-04 21:27:23,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:27:23,984 INFO L93 Difference]: Finished difference Result 19795 states and 54296 transitions. [2021-06-04 21:27:23,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-06-04 21:27:23,984 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-04 21:27:23,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:27:24,007 INFO L225 Difference]: With dead ends: 19795 [2021-06-04 21:27:24,007 INFO L226 Difference]: Without dead ends: 19705 [2021-06-04 21:27:24,008 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 2773.7ms TimeCoverageRelationStatistics Valid=696, Invalid=2964, Unknown=0, NotChecked=0, Total=3660 [2021-06-04 21:27:24,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19705 states. [2021-06-04 21:27:24,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19705 to 14773. [2021-06-04 21:27:24,227 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-04 21:27:24,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14773 states to 14773 states and 40650 transitions. [2021-06-04 21:27:24,250 INFO L78 Accepts]: Start accepts. Automaton has 14773 states and 40650 transitions. Word has length 109 [2021-06-04 21:27:24,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:27:24,251 INFO L482 AbstractCegarLoop]: Abstraction has 14773 states and 40650 transitions. [2021-06-04 21:27:24,251 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-04 21:27:24,251 INFO L276 IsEmpty]: Start isEmpty. Operand 14773 states and 40650 transitions. [2021-06-04 21:27:24,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-06-04 21:27:24,254 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:27:24,254 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-04 21:27:24,255 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-04 21:27:24,255 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-04 21:27:24,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:27:24,255 INFO L82 PathProgramCache]: Analyzing trace with hash 152158104, now seen corresponding path program 3 times [2021-06-04 21:27:24,255 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:27:24,255 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233557383] [2021-06-04 21:27:24,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:27:24,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:27:25,065 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-04 21:27:25,065 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:27:25,065 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233557383] [2021-06-04 21:27:25,065 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233557383] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:27:25,066 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:27:25,066 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-06-04 21:27:25,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782453408] [2021-06-04 21:27:25,066 INFO L462 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-06-04 21:27:25,066 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:27:25,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-06-04 21:27:25,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=734, Unknown=0, NotChecked=0, Total=812 [2021-06-04 21:27:25,067 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-04 21:27:28,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:27:28,260 INFO L93 Difference]: Finished difference Result 18984 states and 52209 transitions. [2021-06-04 21:27:28,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-06-04 21:27:28,261 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-04 21:27:28,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:27:28,283 INFO L225 Difference]: With dead ends: 18984 [2021-06-04 21:27:28,283 INFO L226 Difference]: Without dead ends: 18939 [2021-06-04 21:27:28,284 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 723 ImplicationChecksByTransitivity, 2835.6ms TimeCoverageRelationStatistics Valid=717, Invalid=3065, Unknown=0, NotChecked=0, Total=3782 [2021-06-04 21:27:28,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18939 states. [2021-06-04 21:27:28,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18939 to 14775. [2021-06-04 21:27:28,502 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-04 21:27:28,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14775 states to 14775 states and 40654 transitions. [2021-06-04 21:27:28,526 INFO L78 Accepts]: Start accepts. Automaton has 14775 states and 40654 transitions. Word has length 109 [2021-06-04 21:27:28,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:27:28,526 INFO L482 AbstractCegarLoop]: Abstraction has 14775 states and 40654 transitions. [2021-06-04 21:27:28,526 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-04 21:27:28,526 INFO L276 IsEmpty]: Start isEmpty. Operand 14775 states and 40654 transitions. [2021-06-04 21:27:28,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-06-04 21:27:28,531 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:27:28,531 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-04 21:27:28,531 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-04 21:27:28,532 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-04 21:27:28,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:27:28,532 INFO L82 PathProgramCache]: Analyzing trace with hash 499057264, now seen corresponding path program 4 times [2021-06-04 21:27:28,532 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:27:28,532 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735627798] [2021-06-04 21:27:28,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:27:28,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:27:29,288 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-04 21:27:29,288 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:27:29,288 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735627798] [2021-06-04 21:27:29,288 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735627798] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:27:29,288 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:27:29,288 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-06-04 21:27:29,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760008585] [2021-06-04 21:27:29,289 INFO L462 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-06-04 21:27:29,289 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:27:29,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-06-04 21:27:29,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=733, Unknown=0, NotChecked=0, Total=812 [2021-06-04 21:27:29,290 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-04 21:27:31,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:27:31,732 INFO L93 Difference]: Finished difference Result 14751 states and 40605 transitions. [2021-06-04 21:27:31,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-06-04 21:27:31,733 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-04 21:27:31,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:27:31,754 INFO L225 Difference]: With dead ends: 14751 [2021-06-04 21:27:31,754 INFO L226 Difference]: Without dead ends: 14661 [2021-06-04 21:27:31,755 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 2096.9ms TimeCoverageRelationStatistics Valid=540, Invalid=2322, Unknown=0, NotChecked=0, Total=2862 [2021-06-04 21:27:31,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14661 states. [2021-06-04 21:27:31,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14661 to 13807. [2021-06-04 21:27:31,983 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-04 21:27:32,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13807 states to 13807 states and 38016 transitions. [2021-06-04 21:27:32,008 INFO L78 Accepts]: Start accepts. Automaton has 13807 states and 38016 transitions. Word has length 109 [2021-06-04 21:27:32,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:27:32,008 INFO L482 AbstractCegarLoop]: Abstraction has 13807 states and 38016 transitions. [2021-06-04 21:27:32,008 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-04 21:27:32,008 INFO L276 IsEmpty]: Start isEmpty. Operand 13807 states and 38016 transitions. [2021-06-04 21:27:32,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2021-06-04 21:27:32,020 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:27:32,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] [2021-06-04 21:27:32,020 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-04 21:27:32,020 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-04 21:27:32,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:27:32,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1047513348, now seen corresponding path program 1 times [2021-06-04 21:27:32,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:27:32,021 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276415828] [2021-06-04 21:27:32,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:27:32,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:27:32,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:27:32,052 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:27:32,052 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276415828] [2021-06-04 21:27:32,052 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276415828] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:27:32,052 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:27:32,053 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-04 21:27:32,053 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762663418] [2021-06-04 21:27:32,053 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-04 21:27:32,053 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:27:32,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-04 21:27:32,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-04 21:27:32,054 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-04 21:27:32,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:27:32,090 INFO L93 Difference]: Finished difference Result 6740 states and 17276 transitions. [2021-06-04 21:27:32,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-04 21:27:32,091 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-04 21:27:32,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:27:32,098 INFO L225 Difference]: With dead ends: 6740 [2021-06-04 21:27:32,098 INFO L226 Difference]: Without dead ends: 6740 [2021-06-04 21:27:32,098 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-04 21:27:32,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6740 states. [2021-06-04 21:27:32,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6740 to 5486. [2021-06-04 21:27:32,170 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-04 21:27:32,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5486 states to 5486 states and 14070 transitions. [2021-06-04 21:27:32,179 INFO L78 Accepts]: Start accepts. Automaton has 5486 states and 14070 transitions. Word has length 175 [2021-06-04 21:27:32,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:27:32,179 INFO L482 AbstractCegarLoop]: Abstraction has 5486 states and 14070 transitions. [2021-06-04 21:27:32,179 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-04 21:27:32,179 INFO L276 IsEmpty]: Start isEmpty. Operand 5486 states and 14070 transitions. [2021-06-04 21:27:32,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-06-04 21:27:32,189 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:27:32,189 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-04 21:27:32,190 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-04 21:27:32,190 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-04 21:27:32,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:27:32,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1262899971, now seen corresponding path program 1 times [2021-06-04 21:27:32,191 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:27:32,191 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060921225] [2021-06-04 21:27:32,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:27:32,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:27:33,000 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-04 21:27:33,000 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:27:33,000 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060921225] [2021-06-04 21:27:33,000 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060921225] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:27:33,000 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:27:33,000 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-06-04 21:27:33,000 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164103858] [2021-06-04 21:27:33,001 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-06-04 21:27:33,001 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:27:33,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-06-04 21:27:33,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=754, Unknown=0, NotChecked=0, Total=870 [2021-06-04 21:27:33,002 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-04 21:27:35,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:27:35,587 INFO L93 Difference]: Finished difference Result 7004 states and 17949 transitions. [2021-06-04 21:27:35,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-06-04 21:27:35,588 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-04 21:27:35,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:27:35,595 INFO L225 Difference]: With dead ends: 7004 [2021-06-04 21:27:35,595 INFO L226 Difference]: Without dead ends: 7004 [2021-06-04 21:27:35,596 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 812 ImplicationChecksByTransitivity, 2351.9ms TimeCoverageRelationStatistics Valid=744, Invalid=2916, Unknown=0, NotChecked=0, Total=3660 [2021-06-04 21:27:35,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7004 states. [2021-06-04 21:27:35,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7004 to 6390. [2021-06-04 21:27:35,669 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-04 21:27:35,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6390 states to 6390 states and 16399 transitions. [2021-06-04 21:27:35,679 INFO L78 Accepts]: Start accepts. Automaton has 6390 states and 16399 transitions. Word has length 176 [2021-06-04 21:27:35,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:27:35,679 INFO L482 AbstractCegarLoop]: Abstraction has 6390 states and 16399 transitions. [2021-06-04 21:27:35,679 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-04 21:27:35,679 INFO L276 IsEmpty]: Start isEmpty. Operand 6390 states and 16399 transitions. [2021-06-04 21:27:35,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-06-04 21:27:35,687 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:27:35,687 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-04 21:27:35,687 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-04 21:27:35,687 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-04 21:27:35,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:27:35,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1653096047, now seen corresponding path program 2 times [2021-06-04 21:27:35,688 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:27:35,688 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215439957] [2021-06-04 21:27:35,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:27:35,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:27:36,605 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2021-06-04 21:27:37,383 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-04 21:27:37,384 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:27:37,384 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215439957] [2021-06-04 21:27:37,384 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215439957] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:27:37,384 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:27:37,384 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-06-04 21:27:37,384 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695587115] [2021-06-04 21:27:37,384 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-06-04 21:27:37,385 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:27:37,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-06-04 21:27:37,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=744, Unknown=0, NotChecked=0, Total=870 [2021-06-04 21:27:37,386 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-04 21:27:38,484 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 63 [2021-06-04 21:27:38,684 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 61 [2021-06-04 21:27:42,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:27:42,433 INFO L93 Difference]: Finished difference Result 10620 states and 27160 transitions. [2021-06-04 21:27:42,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2021-06-04 21:27:42,434 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-04 21:27:42,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:27:42,446 INFO L225 Difference]: With dead ends: 10620 [2021-06-04 21:27:42,446 INFO L226 Difference]: Without dead ends: 10620 [2021-06-04 21:27:42,448 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 14 SyntacticMatches, 11 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1689 ImplicationChecksByTransitivity, 4848.7ms TimeCoverageRelationStatistics Valid=1099, Invalid=5063, Unknown=0, NotChecked=0, Total=6162 [2021-06-04 21:27:42,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10620 states. [2021-06-04 21:27:42,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10620 to 6993. [2021-06-04 21:27:42,559 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-04 21:27:42,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6993 states to 6993 states and 18080 transitions. [2021-06-04 21:27:42,570 INFO L78 Accepts]: Start accepts. Automaton has 6993 states and 18080 transitions. Word has length 176 [2021-06-04 21:27:42,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:27:42,571 INFO L482 AbstractCegarLoop]: Abstraction has 6993 states and 18080 transitions. [2021-06-04 21:27:42,571 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-04 21:27:42,571 INFO L276 IsEmpty]: Start isEmpty. Operand 6993 states and 18080 transitions. [2021-06-04 21:27:42,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-06-04 21:27:42,578 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:27:42,578 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-04 21:27:42,578 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-04 21:27:42,578 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-04 21:27:42,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:27:42,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1036204819, now seen corresponding path program 3 times [2021-06-04 21:27:42,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:27:42,579 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37136862] [2021-06-04 21:27:42,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:27:42,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:27:43,080 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 38 [2021-06-04 21:27:44,059 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2021-06-04 21:27:45,209 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-04 21:27:45,209 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:27:45,209 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37136862] [2021-06-04 21:27:45,209 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37136862] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:27:45,209 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:27:45,210 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-06-04 21:27:45,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604760576] [2021-06-04 21:27:45,210 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-06-04 21:27:45,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:27:45,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-06-04 21:27:45,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=743, Unknown=0, NotChecked=0, Total=870 [2021-06-04 21:27:45,211 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-04 21:27:46,879 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 63 [2021-06-04 21:27:47,184 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 61 [2021-06-04 21:27:51,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:27:51,674 INFO L93 Difference]: Finished difference Result 8585 states and 22068 transitions. [2021-06-04 21:27:51,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-06-04 21:27:51,674 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-04 21:27:51,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:27:51,683 INFO L225 Difference]: With dead ends: 8585 [2021-06-04 21:27:51,684 INFO L226 Difference]: Without dead ends: 8585 [2021-06-04 21:27:51,685 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 14 SyntacticMatches, 11 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1157 ImplicationChecksByTransitivity, 5936.8ms TimeCoverageRelationStatistics Valid=843, Invalid=3713, Unknown=0, NotChecked=0, Total=4556 [2021-06-04 21:27:51,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8585 states. [2021-06-04 21:27:51,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8585 to 6997. [2021-06-04 21:27:51,785 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-04 21:27:51,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6997 states to 6997 states and 18088 transitions. [2021-06-04 21:27:51,797 INFO L78 Accepts]: Start accepts. Automaton has 6997 states and 18088 transitions. Word has length 176 [2021-06-04 21:27:51,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:27:51,798 INFO L482 AbstractCegarLoop]: Abstraction has 6997 states and 18088 transitions. [2021-06-04 21:27:51,798 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-04 21:27:51,798 INFO L276 IsEmpty]: Start isEmpty. Operand 6997 states and 18088 transitions. [2021-06-04 21:27:51,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-06-04 21:27:51,805 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:27:51,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:27:51,805 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-04 21:27:51,806 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-04 21:27:51,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:27:51,806 INFO L82 PathProgramCache]: Analyzing trace with hash -2040515061, now seen corresponding path program 4 times [2021-06-04 21:27:51,806 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:27:51,806 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954998046] [2021-06-04 21:27:51,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:27:51,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:27:52,929 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-04 21:27:52,929 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:27:52,929 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954998046] [2021-06-04 21:27:52,929 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954998046] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:27:52,929 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:27:52,929 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2021-06-04 21:27:52,929 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620029747] [2021-06-04 21:27:52,930 INFO L462 AbstractCegarLoop]: Interpolant automaton has 37 states [2021-06-04 21:27:52,930 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:27:52,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-06-04 21:27:52,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1182, Unknown=0, NotChecked=0, Total=1332 [2021-06-04 21:27:52,931 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-04 21:27:56,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:27:56,691 INFO L93 Difference]: Finished difference Result 11727 states and 30452 transitions. [2021-06-04 21:27:56,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-06-04 21:27:56,691 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-04 21:27:56,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:27:56,704 INFO L225 Difference]: With dead ends: 11727 [2021-06-04 21:27:56,704 INFO L226 Difference]: Without dead ends: 11727 [2021-06-04 21:27:56,705 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1346 ImplicationChecksByTransitivity, 3600.1ms TimeCoverageRelationStatistics Valid=1112, Invalid=4588, Unknown=0, NotChecked=0, Total=5700 [2021-06-04 21:27:56,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11727 states. [2021-06-04 21:27:56,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11727 to 9848. [2021-06-04 21:27:56,818 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-04 21:27:56,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9848 states to 9848 states and 25659 transitions. [2021-06-04 21:27:56,832 INFO L78 Accepts]: Start accepts. Automaton has 9848 states and 25659 transitions. Word has length 176 [2021-06-04 21:27:56,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:27:56,832 INFO L482 AbstractCegarLoop]: Abstraction has 9848 states and 25659 transitions. [2021-06-04 21:27:56,833 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-04 21:27:56,833 INFO L276 IsEmpty]: Start isEmpty. Operand 9848 states and 25659 transitions. [2021-06-04 21:27:56,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-06-04 21:27:56,841 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:27:56,841 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-04 21:27:56,841 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-04 21:27:56,841 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-04 21:27:56,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:27:56,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1403664336, now seen corresponding path program 1 times [2021-06-04 21:27:56,842 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:27:56,842 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940414430] [2021-06-04 21:27:56,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:27:56,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:27:57,577 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-04 21:27:57,577 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:27:57,577 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940414430] [2021-06-04 21:27:57,577 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940414430] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:27:57,577 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:27:57,577 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-06-04 21:27:57,577 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816912266] [2021-06-04 21:27:57,578 INFO L462 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-06-04 21:27:57,578 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:27:57,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-06-04 21:27:57,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=701, Unknown=0, NotChecked=0, Total=812 [2021-06-04 21:27:57,579 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-04 21:28:00,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:28:00,524 INFO L93 Difference]: Finished difference Result 13837 states and 35824 transitions. [2021-06-04 21:28:00,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-06-04 21:28:00,524 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-04 21:28:00,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:28:00,541 INFO L225 Difference]: With dead ends: 13837 [2021-06-04 21:28:00,541 INFO L226 Difference]: Without dead ends: 13837 [2021-06-04 21:28:00,542 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 938 ImplicationChecksByTransitivity, 2648.9ms TimeCoverageRelationStatistics Valid=953, Invalid=3337, Unknown=0, NotChecked=0, Total=4290 [2021-06-04 21:28:00,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13837 states. [2021-06-04 21:28:00,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13837 to 9864. [2021-06-04 21:28:00,666 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-04 21:28:00,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9864 states to 9864 states and 25691 transitions. [2021-06-04 21:28:00,681 INFO L78 Accepts]: Start accepts. Automaton has 9864 states and 25691 transitions. Word has length 180 [2021-06-04 21:28:00,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:28:00,681 INFO L482 AbstractCegarLoop]: Abstraction has 9864 states and 25691 transitions. [2021-06-04 21:28:00,681 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-04 21:28:00,681 INFO L276 IsEmpty]: Start isEmpty. Operand 9864 states and 25691 transitions. [2021-06-04 21:28:00,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-06-04 21:28:00,689 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:28:00,689 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-04 21:28:00,689 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-04 21:28:00,689 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-04 21:28:00,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:28:00,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1316382846, now seen corresponding path program 2 times [2021-06-04 21:28:00,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:28:00,690 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150901740] [2021-06-04 21:28:00,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:28:00,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:28:01,326 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-04 21:28:01,326 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:28:01,326 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150901740] [2021-06-04 21:28:01,326 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150901740] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:28:01,326 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:28:01,326 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-06-04 21:28:01,327 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373423301] [2021-06-04 21:28:01,327 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-04 21:28:01,327 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:28:01,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-04 21:28:01,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2021-06-04 21:28:01,328 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-04 21:28:03,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:28:03,170 INFO L93 Difference]: Finished difference Result 8430 states and 21662 transitions. [2021-06-04 21:28:03,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-06-04 21:28:03,170 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-04 21:28:03,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:28:03,179 INFO L225 Difference]: With dead ends: 8430 [2021-06-04 21:28:03,180 INFO L226 Difference]: Without dead ends: 8430 [2021-06-04 21:28:03,180 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 1702.1ms TimeCoverageRelationStatistics Valid=611, Invalid=2145, Unknown=0, NotChecked=0, Total=2756 [2021-06-04 21:28:03,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8430 states. [2021-06-04 21:28:03,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8430 to 8026. [2021-06-04 21:28:03,266 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-04 21:28:03,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8026 states to 8026 states and 20656 transitions. [2021-06-04 21:28:03,278 INFO L78 Accepts]: Start accepts. Automaton has 8026 states and 20656 transitions. Word has length 180 [2021-06-04 21:28:03,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:28:03,278 INFO L482 AbstractCegarLoop]: Abstraction has 8026 states and 20656 transitions. [2021-06-04 21:28:03,278 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-04 21:28:03,279 INFO L276 IsEmpty]: Start isEmpty. Operand 8026 states and 20656 transitions. [2021-06-04 21:28:03,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-04 21:28:03,285 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:28:03,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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:28:03,285 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-06-04 21:28:03,285 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-04 21:28:03,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:28:03,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1724116409, now seen corresponding path program 1 times [2021-06-04 21:28:03,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:28:03,286 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607902404] [2021-06-04 21:28:03,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:28:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:28:04,020 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-04 21:28:05,694 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2021-06-04 21:28:08,695 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-04 21:28:08,695 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:28:08,695 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607902404] [2021-06-04 21:28:08,695 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607902404] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:28:08,695 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:28:08,695 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-04 21:28:08,695 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885249042] [2021-06-04 21:28:08,696 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-04 21:28:08,696 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:28:08,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-04 21:28:08,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2572, Unknown=0, NotChecked=0, Total=2756 [2021-06-04 21:28:08,697 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-04 21:28:13,356 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 53 [2021-06-04 21:28:14,163 WARN L205 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 78 [2021-06-04 21:28:14,963 WARN L205 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 76 [2021-06-04 21:28:19,994 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-04 21:28:20,453 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-04 21:28:21,016 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2021-06-04 21:28:23,897 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-04 21:28:26,495 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-04 21:28:28,802 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-04 21:28:29,831 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-04 21:28:31,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:28:31,273 INFO L93 Difference]: Finished difference Result 11919 states and 30719 transitions. [2021-06-04 21:28:31,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2021-06-04 21:28:31,274 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-04 21:28:31,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:28:31,286 INFO L225 Difference]: With dead ends: 11919 [2021-06-04 21:28:31,286 INFO L226 Difference]: Without dead ends: 11499 [2021-06-04 21:28:31,288 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 22 SyntacticMatches, 7 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4397 ImplicationChecksByTransitivity, 15545.9ms TimeCoverageRelationStatistics Valid=1521, Invalid=14735, Unknown=0, NotChecked=0, Total=16256 [2021-06-04 21:28:31,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11499 states. [2021-06-04 21:28:31,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11499 to 9438. [2021-06-04 21:28:31,407 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-04 21:28:31,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9438 states to 9438 states and 24118 transitions. [2021-06-04 21:28:31,420 INFO L78 Accepts]: Start accepts. Automaton has 9438 states and 24118 transitions. Word has length 184 [2021-06-04 21:28:31,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:28:31,421 INFO L482 AbstractCegarLoop]: Abstraction has 9438 states and 24118 transitions. [2021-06-04 21:28:31,421 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-04 21:28:31,421 INFO L276 IsEmpty]: Start isEmpty. Operand 9438 states and 24118 transitions. [2021-06-04 21:28:31,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-04 21:28:31,431 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:28:31,431 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-04 21:28:31,431 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-06-04 21:28:31,432 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-04 21:28:31,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:28:31,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1443982125, now seen corresponding path program 2 times [2021-06-04 21:28:31,432 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:28:31,432 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201049127] [2021-06-04 21:28:31,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:28:31,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:28:32,194 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-04 21:28:32,509 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2021-06-04 21:28:34,447 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-04 21:28:34,710 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2021-06-04 21:28:39,388 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-04 21:28:39,388 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:28:39,388 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201049127] [2021-06-04 21:28:39,388 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201049127] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:28:39,388 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:28:39,389 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-04 21:28:39,389 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263294209] [2021-06-04 21:28:39,389 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-04 21:28:39,389 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:28:39,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-04 21:28:39,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=2574, Unknown=0, NotChecked=0, Total=2756 [2021-06-04 21:28:39,390 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-04 21:28:46,273 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 51 [2021-06-04 21:28:46,919 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 53 [2021-06-04 21:28:48,011 WARN L205 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 78 [2021-06-04 21:28:49,061 WARN L205 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 76 [2021-06-04 21:28:51,267 WARN L205 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2021-06-04 21:28:55,585 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-04 21:28:56,155 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-04 21:28:56,840 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2021-06-04 21:29:01,898 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-04 21:29:08,131 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-04 21:29:13,024 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-04 21:29:14,371 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2021-06-04 21:29:14,778 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-04 21:29:15,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:29:15,459 INFO L93 Difference]: Finished difference Result 13443 states and 34525 transitions. [2021-06-04 21:29:15,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-06-04 21:29:15,459 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-04 21:29:15,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:29:15,472 INFO L225 Difference]: With dead ends: 13443 [2021-06-04 21:29:15,472 INFO L226 Difference]: Without dead ends: 13023 [2021-06-04 21:29:15,473 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4455 ImplicationChecksByTransitivity, 23241.2ms TimeCoverageRelationStatistics Valid=1539, Invalid=14973, Unknown=0, NotChecked=0, Total=16512 [2021-06-04 21:29:15,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13023 states. [2021-06-04 21:29:15,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13023 to 9438. [2021-06-04 21:29:15,582 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-04 21:29:15,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9438 states to 9438 states and 24118 transitions. [2021-06-04 21:29:15,595 INFO L78 Accepts]: Start accepts. Automaton has 9438 states and 24118 transitions. Word has length 184 [2021-06-04 21:29:15,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:29:15,595 INFO L482 AbstractCegarLoop]: Abstraction has 9438 states and 24118 transitions. [2021-06-04 21:29:15,595 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-04 21:29:15,595 INFO L276 IsEmpty]: Start isEmpty. Operand 9438 states and 24118 transitions. [2021-06-04 21:29:15,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-04 21:29:15,605 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:29:15,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-04 21:29:15,605 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-06-04 21:29:15,606 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-04 21:29:15,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:29:15,606 INFO L82 PathProgramCache]: Analyzing trace with hash -679804985, now seen corresponding path program 3 times [2021-06-04 21:29:15,606 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:29:15,606 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954236469] [2021-06-04 21:29:15,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:29:15,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:29:16,301 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-04 21:29:16,556 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2021-06-04 21:29:17,846 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-04 21:29:21,075 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-04 21:29:21,075 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:29:21,075 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954236469] [2021-06-04 21:29:21,076 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954236469] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:29:21,076 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:29:21,076 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-04 21:29:21,076 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198826756] [2021-06-04 21:29:21,076 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-04 21:29:21,076 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:29:21,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-04 21:29:21,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=2577, Unknown=0, NotChecked=0, Total=2756 [2021-06-04 21:29:21,077 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-04 21:29:25,949 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 53 [2021-06-04 21:29:26,752 WARN L205 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 78 [2021-06-04 21:29:27,533 WARN L205 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 76 [2021-06-04 21:29:29,183 WARN L205 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 65 [2021-06-04 21:29:31,852 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-04 21:29:32,213 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-04 21:29:32,596 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2021-06-04 21:29:35,341 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-04 21:29:38,992 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-04 21:29:42,185 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-04 21:29:43,682 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-04 21:29:45,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:29:45,270 INFO L93 Difference]: Finished difference Result 13507 states and 34685 transitions. [2021-06-04 21:29:45,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2021-06-04 21:29:45,270 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-04 21:29:45,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:29:45,285 INFO L225 Difference]: With dead ends: 13507 [2021-06-04 21:29:45,285 INFO L226 Difference]: Without dead ends: 13087 [2021-06-04 21:29:45,287 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 20 SyntacticMatches, 7 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4625 ImplicationChecksByTransitivity, 17984.2ms TimeCoverageRelationStatistics Valid=1582, Invalid=15448, Unknown=0, NotChecked=0, Total=17030 [2021-06-04 21:29:45,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13087 states. [2021-06-04 21:29:45,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13087 to 9438. [2021-06-04 21:29:45,409 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-04 21:29:45,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9438 states to 9438 states and 24118 transitions. [2021-06-04 21:29:45,422 INFO L78 Accepts]: Start accepts. Automaton has 9438 states and 24118 transitions. Word has length 184 [2021-06-04 21:29:45,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:29:45,423 INFO L482 AbstractCegarLoop]: Abstraction has 9438 states and 24118 transitions. [2021-06-04 21:29:45,423 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-04 21:29:45,423 INFO L276 IsEmpty]: Start isEmpty. Operand 9438 states and 24118 transitions. [2021-06-04 21:29:45,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-04 21:29:45,433 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:29:45,433 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-04 21:29:45,433 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-06-04 21:29:45,433 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-04 21:29:45,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:29:45,434 INFO L82 PathProgramCache]: Analyzing trace with hash 99175469, now seen corresponding path program 4 times [2021-06-04 21:29:45,434 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:29:45,434 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018739678] [2021-06-04 21:29:45,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:29:45,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:29:46,149 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-04 21:29:46,527 WARN L205 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-04 21:29:47,136 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2021-06-04 21:29:47,535 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2021-06-04 21:29:47,941 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2021-06-04 21:29:48,371 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2021-06-04 21:29:48,719 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2021-06-04 21:29:49,183 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 37 [2021-06-04 21:29:49,625 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2021-06-04 21:29:50,157 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 34 [2021-06-04 21:29:50,617 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-04 21:29:57,049 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-04 21:29:57,050 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:29:57,050 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018739678] [2021-06-04 21:29:57,050 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018739678] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:29:57,050 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:29:57,050 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-04 21:29:57,050 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46418940] [2021-06-04 21:29:57,050 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-04 21:29:57,050 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:29:57,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-04 21:29:57,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2578, Unknown=0, NotChecked=0, Total=2756 [2021-06-04 21:29:57,051 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-04 21:30:00,436 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 53 [2021-06-04 21:30:01,022 WARN L205 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 78 [2021-06-04 21:30:01,581 WARN L205 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 76 [2021-06-04 21:30:02,943 WARN L205 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 68 [2021-06-04 21:30:05,211 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-04 21:30:05,516 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-04 21:30:05,840 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2021-06-04 21:30:08,049 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-04 21:30:10,833 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-04 21:30:13,541 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-04 21:30:14,801 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-04 21:30:16,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:30:16,093 INFO L93 Difference]: Finished difference Result 13491 states and 34649 transitions. [2021-06-04 21:30:16,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2021-06-04 21:30:16,094 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-04 21:30:16,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:30:16,109 INFO L225 Difference]: With dead ends: 13491 [2021-06-04 21:30:16,109 INFO L226 Difference]: Without dead ends: 13071 [2021-06-04 21:30:16,111 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4693 ImplicationChecksByTransitivity, 21877.3ms TimeCoverageRelationStatistics Valid=1609, Invalid=15683, Unknown=0, NotChecked=0, Total=17292 [2021-06-04 21:30:16,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13071 states. [2021-06-04 21:30:16,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13071 to 9438. [2021-06-04 21:30:16,231 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-04 21:30:16,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9438 states to 9438 states and 24118 transitions. [2021-06-04 21:30:16,244 INFO L78 Accepts]: Start accepts. Automaton has 9438 states and 24118 transitions. Word has length 184 [2021-06-04 21:30:16,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:30:16,244 INFO L482 AbstractCegarLoop]: Abstraction has 9438 states and 24118 transitions. [2021-06-04 21:30:16,244 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-04 21:30:16,245 INFO L276 IsEmpty]: Start isEmpty. Operand 9438 states and 24118 transitions. [2021-06-04 21:30:16,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-04 21:30:16,252 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:30:16,252 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-04 21:30:16,252 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-06-04 21:30:16,252 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-04 21:30:16,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:30:16,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1825177785, now seen corresponding path program 5 times [2021-06-04 21:30:16,253 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:30:16,253 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045810109] [2021-06-04 21:30:16,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:30:16,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:30:16,896 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-04 21:30:17,248 WARN L205 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-04 21:30:17,715 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2021-06-04 21:30:18,030 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2021-06-04 21:30:18,333 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2021-06-04 21:30:18,658 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2021-06-04 21:30:18,933 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2021-06-04 21:30:19,638 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2021-06-04 21:30:20,330 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-04 21:30:25,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:30:25,954 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:30:25,954 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045810109] [2021-06-04 21:30:25,954 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045810109] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:30:25,954 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:30:25,954 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-04 21:30:25,954 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323192234] [2021-06-04 21:30:25,954 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-04 21:30:25,955 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:30:25,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-04 21:30:25,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=2580, Unknown=0, NotChecked=0, Total=2756 [2021-06-04 21:30:25,955 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-04 21:30:32,904 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 49 [2021-06-04 21:30:34,066 WARN L205 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 70 [2021-06-04 21:30:35,120 WARN L205 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 68 [2021-06-04 21:30:37,376 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 48 [2021-06-04 21:30:38,249 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 51 [2021-06-04 21:30:39,153 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 53 [2021-06-04 21:30:40,459 WARN L205 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 78 [2021-06-04 21:30:41,582 WARN L205 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-04 21:30:42,931 WARN L205 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 76 [2021-06-04 21:30:44,325 WARN L205 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 72 [2021-06-04 21:30:46,663 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-04 21:30:46,914 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-04 21:30:47,165 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2021-06-04 21:30:48,898 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-04 21:30:51,142 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-04 21:30:53,310 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-04 21:30:54,293 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-04 21:30:55,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:30:55,047 INFO L93 Difference]: Finished difference Result 13595 states and 34905 transitions. [2021-06-04 21:30:55,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2021-06-04 21:30:55,047 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-04 21:30:55,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:30:55,061 INFO L225 Difference]: With dead ends: 13595 [2021-06-04 21:30:55,062 INFO L226 Difference]: Without dead ends: 13175 [2021-06-04 21:30:55,063 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5123 ImplicationChecksByTransitivity, 29419.4ms TimeCoverageRelationStatistics Valid=1725, Invalid=16907, Unknown=0, NotChecked=0, Total=18632 [2021-06-04 21:30:55,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13175 states. [2021-06-04 21:30:55,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13175 to 9438. [2021-06-04 21:30:55,172 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-04 21:30:55,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9438 states to 9438 states and 24118 transitions. [2021-06-04 21:30:55,184 INFO L78 Accepts]: Start accepts. Automaton has 9438 states and 24118 transitions. Word has length 184 [2021-06-04 21:30:55,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:30:55,185 INFO L482 AbstractCegarLoop]: Abstraction has 9438 states and 24118 transitions. [2021-06-04 21:30:55,185 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-04 21:30:55,185 INFO L276 IsEmpty]: Start isEmpty. Operand 9438 states and 24118 transitions. [2021-06-04 21:30:55,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-04 21:30:55,192 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:30:55,192 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-04 21:30:55,192 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-06-04 21:30:55,192 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-04 21:30:55,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:30:55,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1959078739, now seen corresponding path program 6 times [2021-06-04 21:30:55,193 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:30:55,193 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126998364] [2021-06-04 21:30:55,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:30:55,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:30:55,893 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-04 21:30:57,776 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-04 21:31:01,878 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-04 21:31:01,878 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:31:01,878 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126998364] [2021-06-04 21:31:01,878 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126998364] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:31:01,878 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:31:01,879 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-04 21:31:01,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485915066] [2021-06-04 21:31:01,879 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-04 21:31:01,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:31:01,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-04 21:31:01,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2583, Unknown=0, NotChecked=0, Total=2756 [2021-06-04 21:31:01,880 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-04 21:31:06,634 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 49 [2021-06-04 21:31:07,517 WARN L205 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-04 21:31:08,337 WARN L205 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2021-06-04 21:31:10,154 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 48 [2021-06-04 21:31:10,849 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 51 [2021-06-04 21:31:11,580 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 53 [2021-06-04 21:31:12,675 WARN L205 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 78 [2021-06-04 21:31:13,770 WARN L205 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 76 [2021-06-04 21:31:17,893 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-04 21:31:18,274 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-04 21:31:18,724 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2021-06-04 21:31:21,806 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-04 21:31:25,551 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-04 21:31:27,434 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-04 21:31:28,295 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-04 21:31:28,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:31:28,977 INFO L93 Difference]: Finished difference Result 13507 states and 34707 transitions. [2021-06-04 21:31:28,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2021-06-04 21:31:28,978 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-04 21:31:28,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:31:28,991 INFO L225 Difference]: With dead ends: 13507 [2021-06-04 21:31:28,991 INFO L226 Difference]: Without dead ends: 13087 [2021-06-04 21:31:28,992 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4843 ImplicationChecksByTransitivity, 21890.9ms TimeCoverageRelationStatistics Valid=1647, Invalid=16175, Unknown=0, NotChecked=0, Total=17822 [2021-06-04 21:31:29,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13087 states. [2021-06-04 21:31:29,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13087 to 9516. [2021-06-04 21:31:29,104 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-04 21:31:29,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9516 states to 9516 states and 24328 transitions. [2021-06-04 21:31:29,117 INFO L78 Accepts]: Start accepts. Automaton has 9516 states and 24328 transitions. Word has length 184 [2021-06-04 21:31:29,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:31:29,118 INFO L482 AbstractCegarLoop]: Abstraction has 9516 states and 24328 transitions. [2021-06-04 21:31:29,118 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-04 21:31:29,118 INFO L276 IsEmpty]: Start isEmpty. Operand 9516 states and 24328 transitions. [2021-06-04 21:31:29,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-04 21:31:29,125 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:31:29,125 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-04 21:31:29,125 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-06-04 21:31:29,125 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-04 21:31:29,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:31:29,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1545636179, now seen corresponding path program 7 times [2021-06-04 21:31:29,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:31:29,126 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481425703] [2021-06-04 21:31:29,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:31:29,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:31:29,747 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-04 21:31:31,166 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-04 21:31:34,520 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-04 21:31:34,520 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:31:34,521 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481425703] [2021-06-04 21:31:34,521 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481425703] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:31:34,521 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:31:34,521 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-04 21:31:34,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308984644] [2021-06-04 21:31:34,521 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-04 21:31:34,521 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:31:34,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-04 21:31:34,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=2585, Unknown=0, NotChecked=0, Total=2756 [2021-06-04 21:31:34,522 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-04 21:31:38,875 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 49 [2021-06-04 21:31:39,651 WARN L205 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-04 21:31:40,351 WARN L205 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2021-06-04 21:31:42,819 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 51 [2021-06-04 21:31:43,531 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 53 [2021-06-04 21:31:44,634 WARN L205 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 78 [2021-06-04 21:31:45,767 WARN L205 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 76 [2021-06-04 21:31:51,653 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-04 21:31:52,135 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-04 21:31:52,726 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2021-06-04 21:31:57,216 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-04 21:32:02,920 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-04 21:32:07,640 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-04 21:32:09,745 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-04 21:32:12,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:32:12,767 INFO L93 Difference]: Finished difference Result 13477 states and 34651 transitions. [2021-06-04 21:32:12,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2021-06-04 21:32:12,768 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-04 21:32:12,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:32:12,787 INFO L225 Difference]: With dead ends: 13477 [2021-06-04 21:32:12,787 INFO L226 Difference]: Without dead ends: 13057 [2021-06-04 21:32:12,788 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5072 ImplicationChecksByTransitivity, 21569.1ms TimeCoverageRelationStatistics Valid=1679, Invalid=16953, Unknown=0, NotChecked=0, Total=18632 [2021-06-04 21:32:12,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13057 states. [2021-06-04 21:32:12,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13057 to 9529. [2021-06-04 21:32:12,906 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-04 21:32:12,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9529 states to 9529 states and 24363 transitions. [2021-06-04 21:32:12,920 INFO L78 Accepts]: Start accepts. Automaton has 9529 states and 24363 transitions. Word has length 184 [2021-06-04 21:32:12,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:32:12,921 INFO L482 AbstractCegarLoop]: Abstraction has 9529 states and 24363 transitions. [2021-06-04 21:32:12,921 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-04 21:32:12,921 INFO L276 IsEmpty]: Start isEmpty. Operand 9529 states and 24363 transitions. [2021-06-04 21:32:12,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-04 21:32:12,928 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:32:12,929 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-04 21:32:12,929 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-06-04 21:32:12,929 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-04 21:32:12,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:32:12,929 INFO L82 PathProgramCache]: Analyzing trace with hash 938788039, now seen corresponding path program 8 times [2021-06-04 21:32:12,929 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:32:12,929 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566894926] [2021-06-04 21:32:12,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:32:12,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:32:13,560 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-04 21:32:14,900 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-04 21:32:17,813 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-04 21:32:17,813 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:32:17,813 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566894926] [2021-06-04 21:32:17,813 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566894926] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:32:17,813 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:32:17,813 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-04 21:32:17,814 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204720669] [2021-06-04 21:32:17,814 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-04 21:32:17,814 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:32:17,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-04 21:32:17,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=2585, Unknown=0, NotChecked=0, Total=2756 [2021-06-04 21:32:17,815 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-04 21:32:21,739 WARN L205 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-04 21:32:22,394 WARN L205 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2021-06-04 21:32:24,419 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 51 [2021-06-04 21:32:24,987 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 53 [2021-06-04 21:32:25,967 WARN L205 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 78 [2021-06-04 21:32:26,953 WARN L205 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 76 [2021-06-04 21:32:31,704 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-04 21:32:32,078 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-04 21:32:32,498 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2021-06-04 21:32:35,583 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-04 21:32:39,607 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-04 21:32:43,031 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-04 21:32:44,618 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-04 21:32:46,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:32:46,434 INFO L93 Difference]: Finished difference Result 13453 states and 34597 transitions. [2021-06-04 21:32:46,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2021-06-04 21:32:46,434 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-04 21:32:46,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:32:46,450 INFO L225 Difference]: With dead ends: 13453 [2021-06-04 21:32:46,450 INFO L226 Difference]: Without dead ends: 13033 [2021-06-04 21:32:46,452 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5267 ImplicationChecksByTransitivity, 19402.2ms TimeCoverageRelationStatistics Valid=1702, Invalid=17480, Unknown=0, NotChecked=0, Total=19182 [2021-06-04 21:32:46,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13033 states. [2021-06-04 21:32:46,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13033 to 9542. [2021-06-04 21:32:46,573 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-04 21:32:46,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9542 states to 9542 states and 24398 transitions. [2021-06-04 21:32:46,586 INFO L78 Accepts]: Start accepts. Automaton has 9542 states and 24398 transitions. Word has length 184 [2021-06-04 21:32:46,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:32:46,586 INFO L482 AbstractCegarLoop]: Abstraction has 9542 states and 24398 transitions. [2021-06-04 21:32:46,586 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-04 21:32:46,586 INFO L276 IsEmpty]: Start isEmpty. Operand 9542 states and 24398 transitions. [2021-06-04 21:32:46,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-04 21:32:46,594 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:32:46,594 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-04 21:32:46,594 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-06-04 21:32:46,594 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-04 21:32:46,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:32:46,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1640877331, now seen corresponding path program 9 times [2021-06-04 21:32:46,595 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:32:46,595 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032170170] [2021-06-04 21:32:46,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:32:46,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:32:47,293 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-04 21:32:47,687 WARN L205 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-04 21:32:48,320 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2021-06-04 21:32:48,731 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2021-06-04 21:32:49,151 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2021-06-04 21:32:49,591 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2021-06-04 21:32:49,926 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2021-06-04 21:32:50,376 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 37 [2021-06-04 21:32:50,806 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2021-06-04 21:32:51,348 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 34 [2021-06-04 21:32:51,834 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-04 21:32:57,136 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-04 21:32:57,136 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:32:57,136 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032170170] [2021-06-04 21:32:57,136 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032170170] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:32:57,136 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:32:57,136 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-04 21:32:57,137 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010546417] [2021-06-04 21:32:57,137 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-04 21:32:57,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:32:57,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-04 21:32:57,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2572, Unknown=0, NotChecked=0, Total=2756 [2021-06-04 21:32:57,137 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-04 21:32:59,954 WARN L205 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-04 21:33:00,456 WARN L205 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2021-06-04 21:33:02,176 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 51 [2021-06-04 21:33:02,631 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 53 [2021-06-04 21:33:03,486 WARN L205 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 78 [2021-06-04 21:33:04,332 WARN L205 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 76 [2021-06-04 21:33:08,337 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-04 21:33:08,664 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-04 21:33:09,001 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2021-06-04 21:33:11,323 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-04 21:33:14,384 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-04 21:33:17,148 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-04 21:33:18,489 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-04 21:33:19,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:33:19,763 INFO L93 Difference]: Finished difference Result 14681 states and 37799 transitions. [2021-06-04 21:33:19,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2021-06-04 21:33:19,763 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-04 21:33:19,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:33:19,780 INFO L225 Difference]: With dead ends: 14681 [2021-06-04 21:33:19,780 INFO L226 Difference]: Without dead ends: 14261 [2021-06-04 21:33:19,782 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5269 ImplicationChecksByTransitivity, 23078.4ms TimeCoverageRelationStatistics Valid=1789, Invalid=17393, Unknown=0, NotChecked=0, Total=19182 [2021-06-04 21:33:19,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14261 states. [2021-06-04 21:33:19,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14261 to 9646. [2021-06-04 21:33:19,905 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-04 21:33:19,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9646 states to 9646 states and 24678 transitions. [2021-06-04 21:33:19,919 INFO L78 Accepts]: Start accepts. Automaton has 9646 states and 24678 transitions. Word has length 184 [2021-06-04 21:33:19,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:33:19,919 INFO L482 AbstractCegarLoop]: Abstraction has 9646 states and 24678 transitions. [2021-06-04 21:33:19,919 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-04 21:33:19,919 INFO L276 IsEmpty]: Start isEmpty. Operand 9646 states and 24678 transitions. [2021-06-04 21:33:19,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-04 21:33:19,926 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:33:19,926 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-04 21:33:19,927 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-06-04 21:33:19,927 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-04 21:33:19,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:33:19,927 INFO L82 PathProgramCache]: Analyzing trace with hash -761059539, now seen corresponding path program 10 times [2021-06-04 21:33:19,927 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:33:19,927 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922771459] [2021-06-04 21:33:19,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:33:19,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:33:20,524 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-04 21:33:20,828 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-04 21:33:21,143 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2021-06-04 21:33:21,460 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2021-06-04 21:33:21,780 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2021-06-04 21:33:22,108 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2021-06-04 21:33:22,368 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2021-06-04 21:33:23,047 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2021-06-04 21:33:23,906 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-04 21:33:29,951 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-04 21:33:29,952 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:33:29,952 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922771459] [2021-06-04 21:33:29,952 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922771459] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:33:29,952 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:33:29,952 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-04 21:33:29,952 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535988644] [2021-06-04 21:33:29,952 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-04 21:33:29,952 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:33:29,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-04 21:33:29,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2555, Unknown=0, NotChecked=0, Total=2756 [2021-06-04 21:33:29,953 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-04 21:33:36,683 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 47 [2021-06-04 21:33:37,345 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 49 [2021-06-04 21:33:38,561 WARN L205 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-04 21:33:39,672 WARN L205 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2021-06-04 21:33:42,199 WARN L205 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 48 [2021-06-04 21:33:42,747 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 53 [2021-06-04 21:33:43,233 WARN L205 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 78 [2021-06-04 21:33:43,714 WARN L205 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 76 [2021-06-04 21:33:46,614 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-04 21:33:46,895 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-04 21:33:47,155 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2021-06-04 21:33:49,056 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-04 21:33:51,660 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-04 21:33:54,007 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-04 21:33:55,014 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-04 21:33:56,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:33:56,129 INFO L93 Difference]: Finished difference Result 14609 states and 37563 transitions. [2021-06-04 21:33:56,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2021-06-04 21:33:56,129 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-04 21:33:56,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:33:56,146 INFO L225 Difference]: With dead ends: 14609 [2021-06-04 21:33:56,146 INFO L226 Difference]: Without dead ends: 14189 [2021-06-04 21:33:56,148 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5337 ImplicationChecksByTransitivity, 26274.5ms TimeCoverageRelationStatistics Valid=1898, Invalid=17284, Unknown=0, NotChecked=0, Total=19182 [2021-06-04 21:33:56,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14189 states. [2021-06-04 21:33:56,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14189 to 9659. [2021-06-04 21:33:56,274 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-04 21:33:56,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9659 states to 9659 states and 24713 transitions. [2021-06-04 21:33:56,288 INFO L78 Accepts]: Start accepts. Automaton has 9659 states and 24713 transitions. Word has length 184 [2021-06-04 21:33:56,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:33:56,288 INFO L482 AbstractCegarLoop]: Abstraction has 9659 states and 24713 transitions. [2021-06-04 21:33:56,288 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-04 21:33:56,288 INFO L276 IsEmpty]: Start isEmpty. Operand 9659 states and 24713 transitions. [2021-06-04 21:33:56,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-04 21:33:56,296 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:33:56,296 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-04 21:33:56,297 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-06-04 21:33:56,297 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-04 21:33:56,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:33:56,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1135479111, now seen corresponding path program 11 times [2021-06-04 21:33:56,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:33:56,297 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261601492] [2021-06-04 21:33:56,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:33:56,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:33:57,024 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-04 21:33:57,251 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2021-06-04 21:33:59,377 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-04 21:34:04,263 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-04 21:34:04,264 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:34:04,264 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261601492] [2021-06-04 21:34:04,264 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261601492] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:34:04,264 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:34:04,264 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-04 21:34:04,264 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759450683] [2021-06-04 21:34:04,264 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-04 21:34:04,264 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:34:04,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-04 21:34:04,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=2559, Unknown=0, NotChecked=0, Total=2756 [2021-06-04 21:34:04,265 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-04 21:34:10,090 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 49 [2021-06-04 21:34:10,988 WARN L205 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-04 21:34:11,853 WARN L205 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2021-06-04 21:34:17,967 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-04 21:34:18,478 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-04 21:34:18,979 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2021-06-04 21:34:23,464 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-04 21:34:28,606 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-04 21:34:30,646 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-04 21:34:31,546 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-04 21:34:32,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:34:32,592 INFO L93 Difference]: Finished difference Result 14313 states and 36777 transitions. [2021-06-04 21:34:32,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-06-04 21:34:32,593 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-04 21:34:32,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:34:32,607 INFO L225 Difference]: With dead ends: 14313 [2021-06-04 21:34:32,607 INFO L226 Difference]: Without dead ends: 13893 [2021-06-04 21:34:32,608 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4476 ImplicationChecksByTransitivity, 20833.6ms TimeCoverageRelationStatistics Valid=1578, Invalid=14934, Unknown=0, NotChecked=0, Total=16512 [2021-06-04 21:34:32,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13893 states. [2021-06-04 21:34:32,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13893 to 9698. [2021-06-04 21:34:32,725 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-04 21:34:32,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9698 states to 9698 states and 24818 transitions. [2021-06-04 21:34:32,739 INFO L78 Accepts]: Start accepts. Automaton has 9698 states and 24818 transitions. Word has length 184 [2021-06-04 21:34:32,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:34:32,740 INFO L482 AbstractCegarLoop]: Abstraction has 9698 states and 24818 transitions. [2021-06-04 21:34:32,740 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-04 21:34:32,740 INFO L276 IsEmpty]: Start isEmpty. Operand 9698 states and 24818 transitions. [2021-06-04 21:34:32,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-04 21:34:32,747 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:34:32,748 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-04 21:34:32,748 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-06-04 21:34:32,748 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-04 21:34:32,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:34:32,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1066712083, now seen corresponding path program 12 times [2021-06-04 21:34:32,748 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:34:32,749 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751201498] [2021-06-04 21:34:32,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:34:32,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:34:33,432 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-04 21:34:33,669 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2021-06-04 21:34:35,176 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-04 21:34:39,133 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-04 21:34:39,133 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:34:39,133 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751201498] [2021-06-04 21:34:39,134 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751201498] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:34:39,134 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:34:39,134 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-04 21:34:39,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068886184] [2021-06-04 21:34:39,134 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-04 21:34:39,134 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:34:39,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-04 21:34:39,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=2559, Unknown=0, NotChecked=0, Total=2756 [2021-06-04 21:34:39,135 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-04 21:34:43,329 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 49 [2021-06-04 21:34:44,059 WARN L205 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-04 21:34:44,772 WARN L205 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2021-06-04 21:34:49,763 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-04 21:34:50,190 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-04 21:34:50,602 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2021-06-04 21:34:54,229 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-04 21:34:59,315 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-04 21:35:03,503 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-04 21:35:05,165 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-04 21:35:07,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:35:07,818 INFO L93 Difference]: Finished difference Result 14281 states and 36705 transitions. [2021-06-04 21:35:07,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-06-04 21:35:07,819 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-04 21:35:07,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:35:07,836 INFO L225 Difference]: With dead ends: 14281 [2021-06-04 21:35:07,836 INFO L226 Difference]: Without dead ends: 13861 [2021-06-04 21:35:07,838 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 20 SyntacticMatches, 7 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4484 ImplicationChecksByTransitivity, 18988.6ms TimeCoverageRelationStatistics Valid=1578, Invalid=14934, Unknown=0, NotChecked=0, Total=16512 [2021-06-04 21:35:07,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13861 states. [2021-06-04 21:35:07,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13861 to 9711. [2021-06-04 21:35:07,969 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-04 21:35:07,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9711 states to 9711 states and 24853 transitions. [2021-06-04 21:35:07,984 INFO L78 Accepts]: Start accepts. Automaton has 9711 states and 24853 transitions. Word has length 184 [2021-06-04 21:35:07,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:35:07,984 INFO L482 AbstractCegarLoop]: Abstraction has 9711 states and 24853 transitions. [2021-06-04 21:35:07,984 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-04 21:35:07,984 INFO L276 IsEmpty]: Start isEmpty. Operand 9711 states and 24853 transitions. [2021-06-04 21:35:07,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-04 21:35:07,992 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:35:07,992 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-04 21:35:07,993 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-06-04 21:35:07,993 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-04 21:35:07,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:35:07,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1230698425, now seen corresponding path program 13 times [2021-06-04 21:35:07,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:35:07,993 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464957589] [2021-06-04 21:35:07,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:35:08,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:35:08,721 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-04 21:35:09,186 WARN L205 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-04 21:35:09,914 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2021-06-04 21:35:10,480 WARN L205 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2021-06-04 21:35:11,437 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-04 21:35:14,122 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-04 21:35:14,122 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:35:14,122 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464957589] [2021-06-04 21:35:14,122 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464957589] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:35:14,123 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:35:14,123 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-04 21:35:14,123 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808900407] [2021-06-04 21:35:14,123 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-04 21:35:14,123 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:35:14,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-04 21:35:14,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=2559, Unknown=0, NotChecked=0, Total=2756 [2021-06-04 21:35:14,124 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-04 21:35:17,471 WARN L205 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-04 21:35:18,034 WARN L205 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2021-06-04 21:35:21,129 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-06-04 21:35:22,031 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-04 21:35:22,354 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-04 21:35:22,601 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2021-06-04 21:35:24,956 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-04 21:35:28,295 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-04 21:35:31,130 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-04 21:35:32,339 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-04 21:35:33,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:35:33,812 INFO L93 Difference]: Finished difference Result 13833 states and 35557 transitions. [2021-06-04 21:35:33,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2021-06-04 21:35:33,813 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-04 21:35:33,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:35:33,828 INFO L225 Difference]: With dead ends: 13833 [2021-06-04 21:35:33,828 INFO L226 Difference]: Without dead ends: 13413 [2021-06-04 21:35:33,830 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4398 ImplicationChecksByTransitivity, 16274.2ms TimeCoverageRelationStatistics Valid=1548, Invalid=14708, Unknown=0, NotChecked=0, Total=16256 [2021-06-04 21:35:33,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13413 states. [2021-06-04 21:35:33,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13413 to 9724. [2021-06-04 21:35:33,953 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-04 21:35:33,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9724 states to 9724 states and 24888 transitions. [2021-06-04 21:35:33,968 INFO L78 Accepts]: Start accepts. Automaton has 9724 states and 24888 transitions. Word has length 184 [2021-06-04 21:35:33,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:35:33,969 INFO L482 AbstractCegarLoop]: Abstraction has 9724 states and 24888 transitions. [2021-06-04 21:35:33,969 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-04 21:35:33,969 INFO L276 IsEmpty]: Start isEmpty. Operand 9724 states and 24888 transitions. [2021-06-04 21:35:33,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-04 21:35:33,977 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:35:33,977 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-04 21:35:33,977 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-06-04 21:35:33,977 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-04 21:35:33,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:35:33,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1256034409, now seen corresponding path program 14 times [2021-06-04 21:35:33,978 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:35:33,978 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005098893] [2021-06-04 21:35:33,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:35:34,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:35:34,851 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-04 21:35:35,502 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2021-06-04 21:35:35,821 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2021-06-04 21:35:36,165 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2021-06-04 21:35:36,513 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2021-06-04 21:35:36,810 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2021-06-04 21:35:37,186 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 37 [2021-06-04 21:35:37,556 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2021-06-04 21:35:38,415 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-04 21:35:44,479 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-04 21:35:44,479 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:35:44,479 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005098893] [2021-06-04 21:35:44,479 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005098893] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:35:44,479 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:35:44,479 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-04 21:35:44,480 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588616618] [2021-06-04 21:35:44,480 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-04 21:35:44,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:35:44,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-04 21:35:44,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2555, Unknown=0, NotChecked=0, Total=2756 [2021-06-04 21:35:44,481 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-04 21:35:51,147 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 47 [2021-06-04 21:35:51,727 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 49 [2021-06-04 21:35:52,848 WARN L205 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-04 21:35:53,907 WARN L205 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2021-06-04 21:35:56,083 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2021-06-04 21:35:57,437 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-06-04 21:35:57,725 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-06-04 21:35:58,548 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-04 21:35:58,771 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2021-06-04 21:35:59,850 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 71 [2021-06-04 21:36:00,935 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-04 21:36:03,673 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-04 21:36:06,185 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-04 21:36:07,257 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-04 21:36:08,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:36:08,662 INFO L93 Difference]: Finished difference Result 14269 states and 36720 transitions. [2021-06-04 21:36:08,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2021-06-04 21:36:08,662 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-04 21:36:08,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:36:08,679 INFO L225 Difference]: With dead ends: 14269 [2021-06-04 21:36:08,679 INFO L226 Difference]: Without dead ends: 13849 [2021-06-04 21:36:08,681 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 20 SyntacticMatches, 7 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4571 ImplicationChecksByTransitivity, 23969.9ms TimeCoverageRelationStatistics Valid=1600, Invalid=15170, Unknown=0, NotChecked=0, Total=16770 [2021-06-04 21:36:08,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13849 states. [2021-06-04 21:36:08,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13849 to 9737. [2021-06-04 21:36:08,803 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-04 21:36:08,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9737 states to 9737 states and 24923 transitions. [2021-06-04 21:36:08,816 INFO L78 Accepts]: Start accepts. Automaton has 9737 states and 24923 transitions. Word has length 184 [2021-06-04 21:36:08,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:36:08,817 INFO L482 AbstractCegarLoop]: Abstraction has 9737 states and 24923 transitions. [2021-06-04 21:36:08,817 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-04 21:36:08,817 INFO L276 IsEmpty]: Start isEmpty. Operand 9737 states and 24923 transitions. [2021-06-04 21:36:08,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-04 21:36:08,824 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:36:08,825 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-04 21:36:08,825 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-06-04 21:36:08,825 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-04 21:36:08,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:36:08,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1126659863, now seen corresponding path program 15 times [2021-06-04 21:36:08,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:36:08,825 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241316586] [2021-06-04 21:36:08,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:36:08,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:36:09,380 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-04 21:36:09,611 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-04 21:36:10,062 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2021-06-04 21:36:12,112 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-04 21:36:17,012 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-04 21:36:17,012 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:36:17,012 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241316586] [2021-06-04 21:36:17,012 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241316586] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:36:17,012 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:36:17,012 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-04 21:36:17,013 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942279306] [2021-06-04 21:36:17,013 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-04 21:36:17,013 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:36:17,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-04 21:36:17,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=2554, Unknown=0, NotChecked=0, Total=2756 [2021-06-04 21:36:17,014 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-04 21:36:22,966 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 49 [2021-06-04 21:36:23,865 WARN L205 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-04 21:36:24,711 WARN L205 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2021-06-04 21:36:29,633 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-06-04 21:36:30,134 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-06-04 21:36:32,988 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2021-06-04 21:36:37,590 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-04 21:36:44,271 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2021-06-04 21:36:44,447 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-04 21:36:46,459 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-04 21:36:47,329 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-04 21:36:48,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:36:48,265 INFO L93 Difference]: Finished difference Result 13801 states and 35485 transitions. [2021-06-04 21:36:48,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-06-04 21:36:48,266 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-04 21:36:48,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:36:48,279 INFO L225 Difference]: With dead ends: 13801 [2021-06-04 21:36:48,280 INFO L226 Difference]: Without dead ends: 13381 [2021-06-04 21:36:48,281 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 20 SyntacticMatches, 7 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4465 ImplicationChecksByTransitivity, 21357.9ms TimeCoverageRelationStatistics Valid=1579, Invalid=14933, Unknown=0, NotChecked=0, Total=16512 [2021-06-04 21:36:48,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13381 states. [2021-06-04 21:36:48,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13381 to 9854. [2021-06-04 21:36:48,398 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-04 21:36:48,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9854 states to 9854 states and 25238 transitions. [2021-06-04 21:36:48,412 INFO L78 Accepts]: Start accepts. Automaton has 9854 states and 25238 transitions. Word has length 184 [2021-06-04 21:36:48,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:36:48,412 INFO L482 AbstractCegarLoop]: Abstraction has 9854 states and 25238 transitions. [2021-06-04 21:36:48,412 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-04 21:36:48,412 INFO L276 IsEmpty]: Start isEmpty. Operand 9854 states and 25238 transitions. [2021-06-04 21:36:48,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-04 21:36:48,420 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:36:48,421 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-04 21:36:48,421 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-06-04 21:36:48,421 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-04 21:36:48,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:36:48,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1048916267, now seen corresponding path program 16 times [2021-06-04 21:36:48,421 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:36:48,421 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123848537] [2021-06-04 21:36:48,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:36:48,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:36:48,997 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-04 21:36:50,627 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-04 21:36:54,345 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-04 21:36:54,345 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:36:54,345 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123848537] [2021-06-04 21:36:54,345 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123848537] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:36:54,345 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:36:54,345 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-04 21:36:54,345 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012216188] [2021-06-04 21:36:54,346 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-04 21:36:54,346 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:36:54,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-04 21:36:54,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2555, Unknown=0, NotChecked=0, Total=2756 [2021-06-04 21:36:54,347 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-04 21:36:59,121 WARN L205 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-04 21:36:59,802 WARN L205 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2021-06-04 21:37:03,700 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-06-04 21:37:04,091 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-06-04 21:37:06,285 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2021-06-04 21:37:10,401 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-04 21:37:15,304 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-04 21:37:19,574 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-04 21:37:21,422 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-04 21:37:23,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:37:23,789 INFO L93 Difference]: Finished difference Result 15755 states and 40499 transitions. [2021-06-04 21:37:23,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2021-06-04 21:37:23,789 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-04 21:37:23,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:37:23,807 INFO L225 Difference]: With dead ends: 15755 [2021-06-04 21:37:23,807 INFO L226 Difference]: Without dead ends: 15335 [2021-06-04 21:37:23,809 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4636 ImplicationChecksByTransitivity, 18703.0ms TimeCoverageRelationStatistics Valid=1612, Invalid=15418, Unknown=0, NotChecked=0, Total=17030 [2021-06-04 21:37:23,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15335 states. [2021-06-04 21:37:23,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15335 to 9958. [2021-06-04 21:37:23,948 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-04 21:37:23,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9958 states to 9958 states and 25531 transitions. [2021-06-04 21:37:23,963 INFO L78 Accepts]: Start accepts. Automaton has 9958 states and 25531 transitions. Word has length 184 [2021-06-04 21:37:23,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:37:23,963 INFO L482 AbstractCegarLoop]: Abstraction has 9958 states and 25531 transitions. [2021-06-04 21:37:23,963 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-04 21:37:23,963 INFO L276 IsEmpty]: Start isEmpty. Operand 9958 states and 25531 transitions. [2021-06-04 21:37:23,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-04 21:37:23,971 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:37:23,971 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-04 21:37:23,971 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-06-04 21:37:23,971 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-04 21:37:23,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:37:23,972 INFO L82 PathProgramCache]: Analyzing trace with hash 734173673, now seen corresponding path program 17 times [2021-06-04 21:37:23,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:37:23,972 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90407552] [2021-06-04 21:37:23,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:37:23,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:37:24,636 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-04 21:37:25,077 WARN L205 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-04 21:37:25,823 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2021-06-04 21:37:26,311 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2021-06-04 21:37:26,788 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2021-06-04 21:37:27,285 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2021-06-04 21:37:27,645 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2021-06-04 21:37:28,153 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 37 [2021-06-04 21:37:28,625 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2021-06-04 21:37:29,234 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 34 [2021-06-04 21:37:29,805 WARN L205 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-04 21:37:32,196 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-04 21:37:32,197 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:37:32,197 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90407552] [2021-06-04 21:37:32,197 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90407552] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:37:32,197 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:37:32,197 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-04 21:37:32,197 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985259147] [2021-06-04 21:37:32,197 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-04 21:37:32,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:37:32,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-04 21:37:32,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=2558, Unknown=0, NotChecked=0, Total=2756 [2021-06-04 21:37:32,198 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-04 21:37:35,209 WARN L205 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-04 21:37:35,757 WARN L205 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2021-06-04 21:37:39,045 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-06-04 21:37:39,423 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-06-04 21:37:41,281 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2021-06-04 21:37:45,497 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-04 21:37:49,926 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-04 21:37:53,873 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-04 21:37:55,598 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-04 21:37:57,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:37:57,936 INFO L93 Difference]: Finished difference Result 15667 states and 40285 transitions. [2021-06-04 21:37:57,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2021-06-04 21:37:57,937 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-04 21:37:57,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:37:57,954 INFO L225 Difference]: With dead ends: 15667 [2021-06-04 21:37:57,954 INFO L226 Difference]: Without dead ends: 15247 [2021-06-04 21:37:57,956 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4717 ImplicationChecksByTransitivity, 18849.4ms TimeCoverageRelationStatistics Valid=1624, Invalid=15668, Unknown=0, NotChecked=0, Total=17292 [2021-06-04 21:37:57,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15247 states. [2021-06-04 21:37:58,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15247 to 9997. [2021-06-04 21:37:58,091 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-04 21:37:58,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9997 states to 9997 states and 25636 transitions. [2021-06-04 21:37:58,106 INFO L78 Accepts]: Start accepts. Automaton has 9997 states and 25636 transitions. Word has length 184 [2021-06-04 21:37:58,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:37:58,106 INFO L482 AbstractCegarLoop]: Abstraction has 9997 states and 25636 transitions. [2021-06-04 21:37:58,106 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-04 21:37:58,106 INFO L276 IsEmpty]: Start isEmpty. Operand 9997 states and 25636 transitions. [2021-06-04 21:37:58,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-04 21:37:58,114 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:37:58,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:37:58,115 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-06-04 21:37:58,115 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-04 21:37:58,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:37:58,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1053236985, now seen corresponding path program 18 times [2021-06-04 21:37:58,115 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:37:58,115 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882565731] [2021-06-04 21:37:58,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:37:58,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:37:59,079 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-04 21:37:59,443 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2021-06-04 21:37:59,819 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2021-06-04 21:38:00,209 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2021-06-04 21:38:00,613 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2021-06-04 21:38:00,939 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2021-06-04 21:38:01,364 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 37 [2021-06-04 21:38:01,756 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2021-06-04 21:38:02,701 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-04 21:38:09,688 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-04 21:38:09,689 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:38:09,689 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882565731] [2021-06-04 21:38:09,689 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882565731] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:38:09,689 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:38:09,689 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-04 21:38:09,689 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688944753] [2021-06-04 21:38:09,689 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-04 21:38:09,690 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:38:09,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-04 21:38:09,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=2560, Unknown=0, NotChecked=0, Total=2756 [2021-06-04 21:38:09,690 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-04 21:38:17,956 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 47 [2021-06-04 21:38:18,630 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 49 [2021-06-04 21:38:19,887 WARN L205 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-04 21:38:21,040 WARN L205 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2021-06-04 21:38:22,195 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2021-06-04 21:38:24,047 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-06-04 21:38:24,332 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-06-04 21:38:25,592 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2021-06-04 21:38:28,758 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-04 21:38:31,770 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-04 21:38:34,678 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-04 21:38:36,020 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-04 21:38:37,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:38:37,604 INFO L93 Difference]: Finished difference Result 15627 states and 40195 transitions. [2021-06-04 21:38:37,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2021-06-04 21:38:37,604 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-04 21:38:37,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:38:37,621 INFO L225 Difference]: With dead ends: 15627 [2021-06-04 21:38:37,621 INFO L226 Difference]: Without dead ends: 15207 [2021-06-04 21:38:37,623 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4798 ImplicationChecksByTransitivity, 26416.9ms TimeCoverageRelationStatistics Valid=1639, Invalid=15917, Unknown=0, NotChecked=0, Total=17556 [2021-06-04 21:38:37,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15207 states. [2021-06-04 21:38:37,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15207 to 10023. [2021-06-04 21:38:37,763 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-04 21:38:37,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10023 states to 10023 states and 25706 transitions. [2021-06-04 21:38:37,778 INFO L78 Accepts]: Start accepts. Automaton has 10023 states and 25706 transitions. Word has length 184 [2021-06-04 21:38:37,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:38:37,778 INFO L482 AbstractCegarLoop]: Abstraction has 10023 states and 25706 transitions. [2021-06-04 21:38:37,779 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-04 21:38:37,779 INFO L276 IsEmpty]: Start isEmpty. Operand 10023 states and 25706 transitions. [2021-06-04 21:38:37,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-04 21:38:37,787 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:38:37,787 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-04 21:38:37,787 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-06-04 21:38:37,787 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-04 21:38:37,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:38:37,788 INFO L82 PathProgramCache]: Analyzing trace with hash -591523705, now seen corresponding path program 19 times [2021-06-04 21:38:37,788 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:38:37,788 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272179543] [2021-06-04 21:38:37,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:38:37,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:38:38,543 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-04 21:38:38,798 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2021-06-04 21:38:39,065 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2021-06-04 21:38:41,081 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-04 21:38:46,271 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-04 21:38:46,271 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:38:46,271 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272179543] [2021-06-04 21:38:46,271 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272179543] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:38:46,271 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:38:46,271 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-04 21:38:46,271 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793450834] [2021-06-04 21:38:46,272 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-04 21:38:46,272 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:38:46,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-04 21:38:46,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=2568, Unknown=0, NotChecked=0, Total=2756 [2021-06-04 21:38:46,273 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-04 21:38:51,723 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 49 [2021-06-04 21:38:52,672 WARN L205 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 73 [2021-06-04 21:38:53,575 WARN L205 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 71 [2021-06-04 21:38:57,848 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 77 [2021-06-04 21:39:06,983 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2021-06-04 21:39:08,271 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2021-06-04 21:39:10,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:39:10,549 INFO L93 Difference]: Finished difference Result 15649 states and 40255 transitions. [2021-06-04 21:39:10,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2021-06-04 21:39:10,549 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-04 21:39:10,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:39:10,569 INFO L225 Difference]: With dead ends: 15649 [2021-06-04 21:39:10,569 INFO L226 Difference]: Without dead ends: 15229 [2021-06-04 21:39:10,570 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 19 SyntacticMatches, 5 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4995 ImplicationChecksByTransitivity, 22470.3ms TimeCoverageRelationStatistics Valid=1669, Invalid=16691, Unknown=0, NotChecked=0, Total=18360 [2021-06-04 21:39:10,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15229 states. [2021-06-04 21:39:10,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15229 to 10036. [2021-06-04 21:39:10,699 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-04 21:39:10,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10036 states to 10036 states and 25741 transitions. [2021-06-04 21:39:10,713 INFO L78 Accepts]: Start accepts. Automaton has 10036 states and 25741 transitions. Word has length 184 [2021-06-04 21:39:10,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:39:10,713 INFO L482 AbstractCegarLoop]: Abstraction has 10036 states and 25741 transitions. [2021-06-04 21:39:10,713 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-04 21:39:10,714 INFO L276 IsEmpty]: Start isEmpty. Operand 10036 states and 25741 transitions. [2021-06-04 21:39:10,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-04 21:39:10,721 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:39:10,722 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-04 21:39:10,722 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-06-04 21:39:10,722 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-04 21:39:10,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:39:10,722 INFO L82 PathProgramCache]: Analyzing trace with hash -635223827, now seen corresponding path program 20 times [2021-06-04 21:39:10,722 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:39:10,722 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495781368] [2021-06-04 21:39:10,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:39:10,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:39:11,289 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-04 21:39:12,629 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-04 21:39:15,742 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-04 21:39:15,742 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:39:15,743 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495781368] [2021-06-04 21:39:15,743 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495781368] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:39:15,743 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:39:15,743 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-04 21:39:15,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867092560] [2021-06-04 21:39:15,743 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-04 21:39:15,743 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:39:15,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-04 21:39:15,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2566, Unknown=0, NotChecked=0, Total=2756 [2021-06-04 21:39:15,744 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-04 21:39:19,622 WARN L205 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-04 21:39:20,257 WARN L205 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2021-06-04 21:39:23,531 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-06-04 21:39:23,862 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-06-04 21:39:25,451 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2021-06-04 21:39:27,602 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 79 [2021-06-04 21:39:29,730 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-04 21:39:32,928 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-04 21:39:35,851 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-04 21:39:37,180 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-04 21:39:38,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:39:38,320 INFO L93 Difference]: Finished difference Result 16779 states and 43195 transitions. [2021-06-04 21:39:38,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2021-06-04 21:39:38,320 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-04 21:39:38,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:39:38,339 INFO L225 Difference]: With dead ends: 16779 [2021-06-04 21:39:38,339 INFO L226 Difference]: Without dead ends: 16359 [2021-06-04 21:39:38,340 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5062 ImplicationChecksByTransitivity, 17415.0ms TimeCoverageRelationStatistics Valid=1697, Invalid=16663, Unknown=0, NotChecked=0, Total=18360 [2021-06-04 21:39:38,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16359 states. [2021-06-04 21:39:38,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16359 to 10348. [2021-06-04 21:39:38,574 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-04 21:39:38,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10348 states to 10348 states and 26581 transitions. [2021-06-04 21:39:38,590 INFO L78 Accepts]: Start accepts. Automaton has 10348 states and 26581 transitions. Word has length 184 [2021-06-04 21:39:38,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:39:38,590 INFO L482 AbstractCegarLoop]: Abstraction has 10348 states and 26581 transitions. [2021-06-04 21:39:38,590 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-04 21:39:38,590 INFO L276 IsEmpty]: Start isEmpty. Operand 10348 states and 26581 transitions. [2021-06-04 21:39:38,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-04 21:39:38,598 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:39:38,599 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-04 21:39:38,599 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-06-04 21:39:38,599 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-04 21:39:38,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:39:38,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1587804165, now seen corresponding path program 21 times [2021-06-04 21:39:38,604 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:39:38,605 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945008504] [2021-06-04 21:39:38,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:39:38,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:39:39,243 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-04 21:39:39,489 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2021-06-04 21:39:39,644 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2021-06-04 21:39:40,243 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2021-06-04 21:39:42,336 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-04 21:39:42,336 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:39:42,336 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945008504] [2021-06-04 21:39:42,337 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945008504] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:39:42,337 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:39:42,337 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2021-06-04 21:39:42,337 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307674356] [2021-06-04 21:39:42,337 INFO L462 AbstractCegarLoop]: Interpolant automaton has 46 states [2021-06-04 21:39:42,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:39:42,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-06-04 21:39:42,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1934, Unknown=0, NotChecked=0, Total=2070 [2021-06-04 21:39:42,338 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-04 21:39:45,112 WARN L205 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 74 [2021-06-04 21:39:45,644 WARN L205 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 72 [2021-06-04 21:39:50,130 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 69 [2021-06-04 21:39:52,261 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2021-06-04 21:39:53,769 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2021-06-04 21:39:55,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:39:55,308 INFO L93 Difference]: Finished difference Result 16051 states and 41310 transitions. [2021-06-04 21:39:55,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2021-06-04 21:39:55,308 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-04 21:39:55,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:39:55,326 INFO L225 Difference]: With dead ends: 16051 [2021-06-04 21:39:55,327 INFO L226 Difference]: Without dead ends: 15631 [2021-06-04 21:39:55,328 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 14 SyntacticMatches, 12 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3415 ImplicationChecksByTransitivity, 10598.4ms TimeCoverageRelationStatistics Valid=1160, Invalid=11050, Unknown=0, NotChecked=0, Total=12210 [2021-06-04 21:39:55,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15631 states. [2021-06-04 21:39:55,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15631 to 10660. [2021-06-04 21:39:55,469 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-04 21:39:55,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10660 states to 10660 states and 27421 transitions. [2021-06-04 21:39:55,484 INFO L78 Accepts]: Start accepts. Automaton has 10660 states and 27421 transitions. Word has length 184 [2021-06-04 21:39:55,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:39:55,484 INFO L482 AbstractCegarLoop]: Abstraction has 10660 states and 27421 transitions. [2021-06-04 21:39:55,484 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-04 21:39:55,485 INFO L276 IsEmpty]: Start isEmpty. Operand 10660 states and 27421 transitions. [2021-06-04 21:39:55,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-04 21:39:55,493 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:39:55,494 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-04 21:39:55,494 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-06-04 21:39:55,494 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-04 21:39:55,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:39:55,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1257388649, now seen corresponding path program 22 times [2021-06-04 21:39:55,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:39:55,494 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852789632] [2021-06-04 21:39:55,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:39:55,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:39:56,317 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-04 21:39:56,910 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2021-06-04 21:39:57,236 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2021-06-04 21:39:58,698 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2021-06-04 21:40:02,839 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-04 21:40:02,840 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:40:02,840 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852789632] [2021-06-04 21:40:02,840 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852789632] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:40:02,840 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:40:02,840 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2021-06-04 21:40:02,840 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603526152] [2021-06-04 21:40:02,840 INFO L462 AbstractCegarLoop]: Interpolant automaton has 46 states [2021-06-04 21:40:02,840 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:40:02,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-06-04 21:40:02,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1935, Unknown=0, NotChecked=0, Total=2070 [2021-06-04 21:40:02,841 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) Received shutdown request... [2021-06-04 21:40:03,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-04 21:40:03,673 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-06-04 21:40:03,673 WARN L547 AbstractCegarLoop]: Verification canceled [2021-06-04 21:40:03,675 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-04 21:40:03,676 WARN L196 ceAbstractionStarter]: Timeout [2021-06-04 21:40:03,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.06 09:40:03 BasicIcfg [2021-06-04 21:40:03,677 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-04 21:40:03,677 INFO L168 Benchmark]: Toolchain (without parser) took 789336.75 ms. Allocated memory was 360.7 MB in the beginning and 8.6 GB in the end (delta: 8.2 GB). Free memory was 322.2 MB in the beginning and 3.9 GB in the end (delta: -3.6 GB). Peak memory consumption was 4.7 GB. Max. memory is 16.0 GB. [2021-06-04 21:40:03,677 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 360.7 MB. Free memory was 340.8 MB in the beginning and 340.8 MB in the end (delta: 70.4 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-04 21:40:03,678 INFO L168 Benchmark]: CACSL2BoogieTranslator took 561.10 ms. Allocated memory is still 360.7 MB. Free memory was 322.0 MB in the beginning and 295.1 MB in the end (delta: 26.9 MB). Peak memory consumption was 28.2 MB. Max. memory is 16.0 GB. [2021-06-04 21:40:03,678 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.15 ms. Allocated memory is still 360.7 MB. Free memory was 295.1 MB in the beginning and 292.8 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-04 21:40:03,678 INFO L168 Benchmark]: Boogie Preprocessor took 31.01 ms. Allocated memory is still 360.7 MB. Free memory was 292.8 MB in the beginning and 289.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-06-04 21:40:03,678 INFO L168 Benchmark]: RCFGBuilder took 666.98 ms. Allocated memory is still 360.7 MB. Free memory was 289.8 MB in the beginning and 241.5 MB in the end (delta: 48.2 MB). Peak memory consumption was 48.2 MB. Max. memory is 16.0 GB. [2021-06-04 21:40:03,678 INFO L168 Benchmark]: TraceAbstraction took 788027.02 ms. Allocated memory was 360.7 MB in the beginning and 8.6 GB in the end (delta: 8.2 GB). Free memory was 241.5 MB in the beginning and 3.9 GB in the end (delta: -3.6 GB). Peak memory consumption was 4.6 GB. Max. memory is 16.0 GB. [2021-06-04 21:40:03,678 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 360.7 MB. Free memory was 340.8 MB in the beginning and 340.8 MB in the end (delta: 70.4 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 561.10 ms. Allocated memory is still 360.7 MB. Free memory was 322.0 MB in the beginning and 295.1 MB in the end (delta: 26.9 MB). Peak memory consumption was 28.2 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 46.15 ms. Allocated memory is still 360.7 MB. Free memory was 295.1 MB in the beginning and 292.8 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 31.01 ms. Allocated memory is still 360.7 MB. Free memory was 292.8 MB in the beginning and 289.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * RCFGBuilder took 666.98 ms. Allocated memory is still 360.7 MB. Free memory was 289.8 MB in the beginning and 241.5 MB in the end (delta: 48.2 MB). Peak memory consumption was 48.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 788027.02 ms. Allocated memory was 360.7 MB in the beginning and 8.6 GB in the end (delta: 8.2 GB). Free memory was 241.5 MB in the beginning and 3.9 GB in the end (delta: -3.6 GB). Peak memory consumption was 4.6 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 (10660states) and FLOYD_HOARE automaton (currently 5 states, 46 states before enhancement),while ReachableStatesComputation was computing reachable states (23 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 (10660states) and FLOYD_HOARE automaton (currently 5 states, 46 states before enhancement),while ReachableStatesComputation was computing reachable states (23 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 (10660states) and FLOYD_HOARE automaton (currently 5 states, 46 states before enhancement),while ReachableStatesComputation was computing reachable states (23 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 (10660states) and FLOYD_HOARE automaton (currently 5 states, 46 states before enhancement),while ReachableStatesComputation was computing reachable states (23 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 (10660states) and FLOYD_HOARE automaton (currently 5 states, 46 states before enhancement),while ReachableStatesComputation was computing reachable states (23 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: 787778.1ms, OverallIterations: 44, TraceHistogramMax: 1, EmptinessCheckTime: 494.7ms, AutomataDifference: 593885.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1310.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 17385 SDtfs, 94079 SDslu, 338505 SDs, 0 SdLazy, 163277 SolverSat, 5149 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 255608.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4383 GetRequests, 565 SyntacticMatches, 191 SemanticMatches, 3627 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110421 ImplicationChecksByTransitivity, 480766.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=23654occurred in iteration=0, InterpolantAutomatonStates: 2240, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 10145.9ms AutomataMinimizationTime, 43 MinimizatonAttempts, 133328 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 125.2ms SsaConstructionTime, 1040.7ms SatisfiabilityAnalysisTime, 180278.4ms InterpolantComputationTime, 6754 NumberOfCodeBlocks, 6754 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 6710 ConstructedInterpolants, 0 QuantifiedInterpolants, 441965 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 44 InterpolantComputations, 44 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