/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_longer.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-9bbddad6b14272d9691b7fb6f1c011d15ab18596-9bbddad [2021-06-12 15:07:50,604 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-12 15:07:50,607 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-12 15:07:50,651 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-12 15:07:50,651 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-12 15:07:50,654 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-12 15:07:50,656 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-12 15:07:50,661 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-12 15:07:50,663 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-12 15:07:50,668 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-12 15:07:50,668 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-12 15:07:50,670 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-12 15:07:50,670 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-12 15:07:50,672 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-12 15:07:50,673 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-12 15:07:50,674 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-12 15:07:50,678 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-12 15:07:50,679 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-12 15:07:50,682 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-12 15:07:50,685 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-12 15:07:50,686 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-12 15:07:50,690 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-12 15:07:50,690 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-12 15:07:50,693 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-12 15:07:50,699 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-12 15:07:50,699 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-12 15:07:50,699 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-12 15:07:50,701 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-12 15:07:50,704 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-12 15:07:50,704 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-12 15:07:50,705 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-12 15:07:50,705 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-12 15:07:50,707 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-12 15:07:50,708 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-12 15:07:50,709 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-12 15:07:50,709 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-12 15:07:50,709 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-12 15:07:50,709 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-12 15:07:50,710 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-12 15:07:50,710 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-12 15:07:50,711 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-12 15:07:50,715 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-12 15:07:50,767 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-12 15:07:50,767 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-12 15:07:50,767 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-12 15:07:50,767 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-12 15:07:50,768 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-12 15:07:50,768 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-12 15:07:50,768 INFO L138 SettingsManager]: * Use SBE=true [2021-06-12 15:07:50,769 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-12 15:07:50,769 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-12 15:07:50,769 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-12 15:07:50,769 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-12 15:07:50,769 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-12 15:07:50,769 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-12 15:07:50,770 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-12 15:07:50,770 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-12 15:07:50,770 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-12 15:07:50,770 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-12 15:07:50,770 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-12 15:07:50,770 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-12 15:07:50,770 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-12 15:07:50,770 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-12 15:07:50,770 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-12 15:07:50,771 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-12 15:07:50,771 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-12 15:07:50,771 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-12 15:07:50,771 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-12 15:07:50,771 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-12 15:07:50,771 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-12 15:07:50,771 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-12 15:07:50,771 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-12 15:07:50,771 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-12 15:07:50,771 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-12 15:07:51,074 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-12 15:07:51,104 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-12 15:07:51,107 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-12 15:07:51,108 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-12 15:07:51,108 INFO L275 PluginConnector]: CDTParser initialized [2021-06-12 15:07:51,109 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_longer.i [2021-06-12 15:07:51,170 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec184e98e/7b82bd5ce2f441659a16e58484a882c8/FLAGe37b4f5ef [2021-06-12 15:07:51,666 INFO L306 CDTParser]: Found 1 translation units. [2021-06-12 15:07:51,666 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i [2021-06-12 15:07:51,679 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec184e98e/7b82bd5ce2f441659a16e58484a882c8/FLAGe37b4f5ef [2021-06-12 15:07:52,137 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec184e98e/7b82bd5ce2f441659a16e58484a882c8 [2021-06-12 15:07:52,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-12 15:07:52,141 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-12 15:07:52,143 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-12 15:07:52,143 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-12 15:07:52,160 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-12 15:07:52,161 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.06 03:07:52" (1/1) ... [2021-06-12 15:07:52,162 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15e4c1c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 03:07:52, skipping insertion in model container [2021-06-12 15:07:52,162 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.06 03:07:52" (1/1) ... [2021-06-12 15:07:52,168 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-12 15:07:52,206 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-12 15:07:52,566 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_longer.i[43296,43309] [2021-06-12 15:07:52,571 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_longer.i[43503,43516] [2021-06-12 15:07:52,573 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_longer.i[43783,43796] [2021-06-12 15:07:52,576 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-12 15:07:52,588 INFO L203 MainTranslator]: Completed pre-run [2021-06-12 15:07:52,620 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_longer.i[43296,43309] [2021-06-12 15:07:52,622 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_longer.i[43503,43516] [2021-06-12 15:07:52,624 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_longer.i[43783,43796] [2021-06-12 15:07:52,626 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-12 15:07:52,774 INFO L208 MainTranslator]: Completed translation [2021-06-12 15:07:52,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 03:07:52 WrapperNode [2021-06-12 15:07:52,775 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-12 15:07:52,776 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-12 15:07:52,776 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-12 15:07:52,776 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-12 15:07:52,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 03:07:52" (1/1) ... [2021-06-12 15:07:52,816 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 03:07:52" (1/1) ... [2021-06-12 15:07:52,842 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-12 15:07:52,842 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-12 15:07:52,842 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-12 15:07:52,843 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-12 15:07:52,850 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 03:07:52" (1/1) ... [2021-06-12 15:07:52,850 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 03:07:52" (1/1) ... [2021-06-12 15:07:52,854 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 03:07:52" (1/1) ... [2021-06-12 15:07:52,854 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 03:07:52" (1/1) ... [2021-06-12 15:07:52,863 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 03:07:52" (1/1) ... [2021-06-12 15:07:52,867 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 03:07:52" (1/1) ... [2021-06-12 15:07:52,869 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 03:07:52" (1/1) ... [2021-06-12 15:07:52,873 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-12 15:07:52,874 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-12 15:07:52,874 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-12 15:07:52,874 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-12 15:07:52,875 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 03:07:52" (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-12 15:07:52,935 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2021-06-12 15:07:52,935 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2021-06-12 15:07:52,935 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2021-06-12 15:07:52,935 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2021-06-12 15:07:52,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-12 15:07:52,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-12 15:07:52,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-06-12 15:07:52,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-12 15:07:52,936 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-06-12 15:07:52,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-12 15:07:52,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-12 15:07:52,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-12 15:07:52,938 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-12 15:07:53,504 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-12 15:07:53,505 INFO L299 CfgBuilder]: Removed 18 assume(true) statements. [2021-06-12 15:07:53,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.06 03:07:53 BoogieIcfgContainer [2021-06-12 15:07:53,507 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-12 15:07:53,509 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-12 15:07:53,509 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-12 15:07:53,511 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-12 15:07:53,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.06 03:07:52" (1/3) ... [2021-06-12 15:07:53,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@276f7787 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.06 03:07:53, skipping insertion in model container [2021-06-12 15:07:53,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 03:07:52" (2/3) ... [2021-06-12 15:07:53,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@276f7787 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.06 03:07:53, skipping insertion in model container [2021-06-12 15:07:53,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.06 03:07:53" (3/3) ... [2021-06-12 15:07:53,517 INFO L111 eAbstractionObserver]: Analyzing ICFG queue_longer.i [2021-06-12 15:07:53,522 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-12 15:07:53,522 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-12 15:07:53,523 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2021-06-12 15:07:53,524 INFO L471 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-12 15:07:53,606 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,606 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,606 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,606 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,606 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,606 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,607 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,607 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,607 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,607 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,607 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,608 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,608 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,608 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,609 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,609 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,609 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,609 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,610 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,610 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,610 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,610 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,610 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,611 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,611 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,611 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,611 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,611 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,611 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,612 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,612 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,612 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,613 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,613 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,613 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,613 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,613 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,613 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,614 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,614 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,614 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,614 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,614 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,615 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,616 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,616 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,616 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,616 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,616 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,616 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,616 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,616 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,616 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,617 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,617 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,617 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,617 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,617 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,617 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,617 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,618 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,618 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,618 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,618 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,618 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,618 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,618 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,618 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,618 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,619 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,619 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,619 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,619 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,619 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,619 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,619 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,619 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,619 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,620 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,620 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,620 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,620 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,620 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,620 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,621 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,621 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,621 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,621 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,621 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,621 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,622 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,622 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,623 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,623 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,624 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,626 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,626 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,627 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,627 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,631 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,632 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,632 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,632 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,632 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,632 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,632 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,632 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,633 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,633 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,633 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,633 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,633 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,633 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,633 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,633 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,633 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,634 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,634 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,634 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,634 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,634 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,634 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,634 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,634 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,634 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,634 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,635 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,635 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,635 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,635 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,635 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,635 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,635 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,635 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,635 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,635 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,635 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,636 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,636 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,636 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,636 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,636 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,636 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,636 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,636 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,636 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,637 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,637 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,637 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,637 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,637 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,638 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,638 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,638 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,638 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,638 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,638 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,638 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,638 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,638 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,639 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,639 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,639 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,640 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,640 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,640 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,640 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,640 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,641 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,641 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,641 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,641 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,641 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,641 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,641 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,641 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,641 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,641 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,642 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,642 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,642 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,642 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,642 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,642 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,642 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,642 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,642 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,642 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,642 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,643 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,643 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,643 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,643 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,643 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,643 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,643 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,644 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,644 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,649 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,649 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,650 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,650 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,650 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,650 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,650 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,650 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,650 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,650 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,650 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,650 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,651 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,651 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,651 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,651 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,651 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,651 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,651 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,651 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,652 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,652 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,652 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,653 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,655 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,655 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,656 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,656 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,657 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,657 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,657 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,657 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,657 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,658 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,658 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,658 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,658 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,658 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,658 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,658 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,658 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,658 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,658 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,659 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,659 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,659 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,659 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,659 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,659 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,660 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,660 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,660 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,660 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,660 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,660 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,660 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,660 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,661 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,661 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,661 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,661 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,661 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,661 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,661 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,661 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,661 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,662 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,662 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,662 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,662 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,662 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,662 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,662 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,662 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,662 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,662 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,662 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,663 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,663 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,663 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,663 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,663 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,663 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,663 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,663 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,663 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,663 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,663 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,663 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,663 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,664 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,664 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,664 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,664 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,664 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,664 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,664 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,664 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,664 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,664 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,664 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,664 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,665 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,665 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,665 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,665 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,665 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,665 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,665 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,665 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,666 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,666 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,666 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,666 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,666 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,666 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,666 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,666 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,666 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,666 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,666 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,666 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,667 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,667 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,667 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,667 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,667 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,667 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,667 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,667 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,667 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,667 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,667 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,668 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,668 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,668 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,668 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,668 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,668 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,668 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,668 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,668 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,668 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,668 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,669 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,669 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,669 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,669 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,669 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,669 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,669 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,669 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,669 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,669 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,669 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,670 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,670 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,670 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,670 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,670 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,670 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,670 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,670 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,670 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,670 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,670 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,671 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,671 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,671 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,671 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,671 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,671 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,671 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,671 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,671 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,671 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,671 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,672 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,672 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,672 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,672 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,672 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,672 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,672 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,673 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,673 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,674 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,674 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,674 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,674 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,675 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,675 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,675 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,675 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,675 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,676 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,676 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,676 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,676 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,676 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,676 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,676 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,676 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,676 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,676 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,676 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,677 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,677 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,677 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,677 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,677 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,677 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,677 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,677 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,677 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,677 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,678 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,678 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,678 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,681 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,682 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,682 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,682 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,682 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,682 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,683 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,683 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,683 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,683 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,683 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,683 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,683 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,683 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,683 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,683 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,683 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,683 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,683 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,684 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,684 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,684 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,684 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,684 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,684 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,684 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,684 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,684 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,684 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,684 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,684 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,685 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,685 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,685 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,685 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,685 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,685 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,685 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,685 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,685 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,685 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,686 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,686 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,686 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,686 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,687 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,687 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,687 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,687 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,687 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,687 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,687 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,687 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,687 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,687 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,687 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,688 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,688 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,688 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,688 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,688 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,688 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,688 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,688 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,688 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,688 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,688 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,689 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,689 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,689 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,689 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,689 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,689 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,689 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,689 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,689 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,689 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,689 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,689 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,690 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,690 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,690 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,690 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,690 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,690 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,690 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,690 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,690 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,690 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,690 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,691 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,691 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,691 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,691 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,691 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,691 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,691 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,691 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,691 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,691 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,691 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,692 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,692 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,692 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,692 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,692 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,692 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,692 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,692 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,692 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,692 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,692 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,693 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,693 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,693 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,693 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,693 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,693 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,693 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,693 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,693 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,693 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,693 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,694 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,694 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,694 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,694 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,694 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,694 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,694 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,694 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,694 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,694 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,694 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,695 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,695 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,695 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,695 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,695 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,695 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,695 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,695 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,695 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,695 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,695 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,696 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,696 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,696 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,696 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,696 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,696 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,699 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,700 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,700 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,700 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,701 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,701 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,701 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,701 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,701 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,701 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,701 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,702 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,702 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,702 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,702 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,702 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,702 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,702 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,702 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,702 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,702 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,702 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,703 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,703 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,703 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,703 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,703 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,703 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,703 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,703 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,703 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,703 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,703 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,704 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,704 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,710 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,710 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,710 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,710 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,710 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,711 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,711 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,711 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,711 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,711 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,711 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,711 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,711 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,711 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,711 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,711 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,712 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,712 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,712 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,712 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,712 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,712 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 15:07:53,724 INFO L149 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2021-06-12 15:07:53,746 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-12 15:07:53,769 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-12 15:07:53,770 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-12 15:07:53,770 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-12 15:07:53,770 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-12 15:07:53,770 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-12 15:07:53,770 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-12 15:07:53,770 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-12 15:07:53,770 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == t1Thread1of1ForFork0======== [2021-06-12 15:07:53,792 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 247 places, 257 transitions, 536 flow [2021-06-12 15:07:55,253 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-12 15:07:55,303 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-12 15:07:55,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-06-12 15:07:55,336 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 15:07:55,337 INFO L472 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-12 15:07:55,338 INFO L430 AbstractCegarLoop]: === Iteration 1 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 15:07:55,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 15:07:55,345 INFO L82 PathProgramCache]: Analyzing trace with hash -383819529, now seen corresponding path program 1 times [2021-06-12 15:07:55,353 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 15:07:55,354 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606732265] [2021-06-12 15:07:55,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 15:07:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 15:07:55,877 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-12 15:07:55,877 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 15:07:55,878 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606732265] [2021-06-12 15:07:55,879 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606732265] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 15:07:55,879 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 15:07:55,879 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-12 15:07:55,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174018752] [2021-06-12 15:07:55,883 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-12 15:07:55,884 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 15:07:55,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-12 15:07:55,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-06-12 15:07:55,934 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 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-12 15:07:56,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 15:07:56,703 INFO L93 Difference]: Finished difference Result 23003 states and 64256 transitions. [2021-06-12 15:07:56,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-12 15:07:56,705 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-06-12 15:07:56,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 15:07:56,781 INFO L225 Difference]: With dead ends: 23003 [2021-06-12 15:07:56,781 INFO L226 Difference]: Without dead ends: 12639 [2021-06-12 15:07:56,782 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 357.8ms TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420 [2021-06-12 15:07:56,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12639 states. [2021-06-12 15:07:57,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12639 to 12639. [2021-06-12 15:07:57,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12639 states, 12637 states have (on average 2.783176386800665) internal successors, (35171), 12638 states have internal predecessors, (35171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 15:07:57,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12639 states to 12639 states and 35171 transitions. [2021-06-12 15:07:57,371 INFO L78 Accepts]: Start accepts. Automaton has 12639 states and 35171 transitions. Word has length 83 [2021-06-12 15:07:57,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 15:07:57,371 INFO L482 AbstractCegarLoop]: Abstraction has 12639 states and 35171 transitions. [2021-06-12 15:07:57,371 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-12 15:07:57,372 INFO L276 IsEmpty]: Start isEmpty. Operand 12639 states and 35171 transitions. [2021-06-12 15:07:57,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-06-12 15:07:57,378 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 15:07:57,378 INFO L472 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-12 15:07:57,378 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-12 15:07:57,378 INFO L430 AbstractCegarLoop]: === Iteration 2 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 15:07:57,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 15:07:57,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1409373696, now seen corresponding path program 1 times [2021-06-12 15:07:57,379 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 15:07:57,379 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839991686] [2021-06-12 15:07:57,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 15:07:57,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 15:07:57,456 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-12 15:07:57,456 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 15:07:57,457 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839991686] [2021-06-12 15:07:57,457 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839991686] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 15:07:57,457 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 15:07:57,457 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-12 15:07:57,457 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191899614] [2021-06-12 15:07:57,458 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-12 15:07:57,458 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 15:07:57,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-12 15:07:57,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-12 15:07:57,459 INFO L87 Difference]: Start difference. First operand 12639 states and 35171 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-12 15:07:57,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 15:07:57,657 INFO L93 Difference]: Finished difference Result 12422 states and 34356 transitions. [2021-06-12 15:07:57,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-12 15:07:57,658 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-12 15:07:57,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 15:07:57,719 INFO L225 Difference]: With dead ends: 12422 [2021-06-12 15:07:57,719 INFO L226 Difference]: Without dead ends: 12422 [2021-06-12 15:07:57,720 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-12 15:07:57,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12422 states. [2021-06-12 15:07:58,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12422 to 12422. [2021-06-12 15:07:58,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12422 states, 12420 states have (on average 2.766183574879227) internal successors, (34356), 12421 states have internal predecessors, (34356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 15:07:58,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12422 states to 12422 states and 34356 transitions. [2021-06-12 15:07:58,301 INFO L78 Accepts]: Start accepts. Automaton has 12422 states and 34356 transitions. Word has length 84 [2021-06-12 15:07:58,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 15:07:58,302 INFO L482 AbstractCegarLoop]: Abstraction has 12422 states and 34356 transitions. [2021-06-12 15:07:58,302 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-12 15:07:58,302 INFO L276 IsEmpty]: Start isEmpty. Operand 12422 states and 34356 transitions. [2021-06-12 15:07:58,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-06-12 15:07:58,314 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 15:07:58,314 INFO L472 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-12 15:07:58,315 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-12 15:07:58,315 INFO L430 AbstractCegarLoop]: === Iteration 3 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 15:07:58,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 15:07:58,315 INFO L82 PathProgramCache]: Analyzing trace with hash -477175304, now seen corresponding path program 1 times [2021-06-12 15:07:58,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 15:07:58,316 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985606088] [2021-06-12 15:07:58,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 15:07:58,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 15:07:58,419 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-12 15:07:58,419 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 15:07:58,419 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985606088] [2021-06-12 15:07:58,419 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985606088] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 15:07:58,419 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 15:07:58,419 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-12 15:07:58,420 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628512897] [2021-06-12 15:07:58,420 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-12 15:07:58,420 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 15:07:58,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-12 15:07:58,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-12 15:07:58,421 INFO L87 Difference]: Start difference. First operand 12422 states and 34356 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-12 15:07:58,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 15:07:58,530 INFO L93 Difference]: Finished difference Result 13073 states and 35933 transitions. [2021-06-12 15:07:58,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-12 15:07:58,530 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-12 15:07:58,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 15:07:58,564 INFO L225 Difference]: With dead ends: 13073 [2021-06-12 15:07:58,564 INFO L226 Difference]: Without dead ends: 11771 [2021-06-12 15:07:58,565 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-12 15:07:58,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11771 states. [2021-06-12 15:07:58,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11771 to 11771. [2021-06-12 15:07:58,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11771 states, 11769 states have (on average 2.74832186252018) internal successors, (32345), 11770 states have internal predecessors, (32345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 15:07:58,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11771 states to 11771 states and 32345 transitions. [2021-06-12 15:07:58,935 INFO L78 Accepts]: Start accepts. Automaton has 11771 states and 32345 transitions. Word has length 99 [2021-06-12 15:07:58,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 15:07:58,936 INFO L482 AbstractCegarLoop]: Abstraction has 11771 states and 32345 transitions. [2021-06-12 15:07:58,936 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-12 15:07:58,936 INFO L276 IsEmpty]: Start isEmpty. Operand 11771 states and 32345 transitions. [2021-06-12 15:07:58,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-06-12 15:07:58,953 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 15:07:58,953 INFO L472 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-12 15:07:58,953 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-12 15:07:58,953 INFO L430 AbstractCegarLoop]: === Iteration 4 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 15:07:58,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 15:07:58,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1731505684, now seen corresponding path program 1 times [2021-06-12 15:07:58,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 15:07:58,955 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627020490] [2021-06-12 15:07:58,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 15:07:59,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 15:07:59,442 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-12 15:07:59,442 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 15:07:59,443 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627020490] [2021-06-12 15:07:59,443 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627020490] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 15:07:59,443 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 15:07:59,443 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-06-12 15:07:59,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649260447] [2021-06-12 15:07:59,444 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-12 15:07:59,444 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 15:07:59,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-12 15:07:59,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2021-06-12 15:07:59,445 INFO L87 Difference]: Start difference. First operand 11771 states and 32345 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-12 15:08:00,155 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2021-06-12 15:08:00,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 15:08:00,383 INFO L93 Difference]: Finished difference Result 12185 states and 33496 transitions. [2021-06-12 15:08:00,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-12 15:08:00,383 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-12 15:08:00,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 15:08:00,415 INFO L225 Difference]: With dead ends: 12185 [2021-06-12 15:08:00,415 INFO L226 Difference]: Without dead ends: 12185 [2021-06-12 15:08:00,415 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 691.5ms TimeCoverageRelationStatistics Valid=223, Invalid=533, Unknown=0, NotChecked=0, Total=756 [2021-06-12 15:08:00,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12185 states. [2021-06-12 15:08:00,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12185 to 11973. [2021-06-12 15:08:00,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11973 states, 11971 states have (on average 2.7489766936763846) internal successors, (32908), 11972 states have internal predecessors, (32908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 15:08:00,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11973 states to 11973 states and 32908 transitions. [2021-06-12 15:08:00,723 INFO L78 Accepts]: Start accepts. Automaton has 11973 states and 32908 transitions. Word has length 100 [2021-06-12 15:08:00,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 15:08:00,724 INFO L482 AbstractCegarLoop]: Abstraction has 11973 states and 32908 transitions. [2021-06-12 15:08:00,724 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-12 15:08:00,724 INFO L276 IsEmpty]: Start isEmpty. Operand 11973 states and 32908 transitions. [2021-06-12 15:08:00,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-06-12 15:08:00,741 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 15:08:00,741 INFO L472 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-12 15:08:00,742 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-12 15:08:00,742 INFO L430 AbstractCegarLoop]: === Iteration 5 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 15:08:00,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 15:08:00,742 INFO L82 PathProgramCache]: Analyzing trace with hash 588694202, now seen corresponding path program 1 times [2021-06-12 15:08:00,742 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 15:08:00,743 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690032825] [2021-06-12 15:08:00,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 15:08:00,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 15:08:01,543 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-12 15:08:01,543 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 15:08:01,543 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690032825] [2021-06-12 15:08:01,543 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690032825] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 15:08:01,544 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 15:08:01,544 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-06-12 15:08:01,544 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715817861] [2021-06-12 15:08:01,544 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-06-12 15:08:01,544 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 15:08:01,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-06-12 15:08:01,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=628, Unknown=0, NotChecked=0, Total=702 [2021-06-12 15:08:01,545 INFO L87 Difference]: Start difference. First operand 11973 states and 32908 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-12 15:08:03,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 15:08:03,868 INFO L93 Difference]: Finished difference Result 12135 states and 33184 transitions. [2021-06-12 15:08:03,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-06-12 15:08:03,869 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-12 15:08:03,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 15:08:03,894 INFO L225 Difference]: With dead ends: 12135 [2021-06-12 15:08:03,894 INFO L226 Difference]: Without dead ends: 11918 [2021-06-12 15:08:03,895 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 1823.3ms TimeCoverageRelationStatistics Valid=466, Invalid=1984, Unknown=0, NotChecked=0, Total=2450 [2021-06-12 15:08:03,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11918 states. [2021-06-12 15:08:04,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11918 to 11918. [2021-06-12 15:08:04,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11918 states, 11916 states have (on average 2.75243370258476) internal successors, (32798), 11917 states have internal predecessors, (32798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 15:08:04,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11918 states to 11918 states and 32798 transitions. [2021-06-12 15:08:04,169 INFO L78 Accepts]: Start accepts. Automaton has 11918 states and 32798 transitions. Word has length 104 [2021-06-12 15:08:04,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 15:08:04,169 INFO L482 AbstractCegarLoop]: Abstraction has 11918 states and 32798 transitions. [2021-06-12 15:08:04,169 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-12 15:08:04,169 INFO L276 IsEmpty]: Start isEmpty. Operand 11918 states and 32798 transitions. [2021-06-12 15:08:04,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-12 15:08:04,186 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 15:08:04,186 INFO L472 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-12 15:08:04,187 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-12 15:08:04,187 INFO L430 AbstractCegarLoop]: === Iteration 6 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 15:08:04,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 15:08:04,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1887066075, now seen corresponding path program 1 times [2021-06-12 15:08:04,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 15:08:04,187 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815670612] [2021-06-12 15:08:04,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 15:08:04,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 15:08:04,647 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-12 15:08:04,648 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 15:08:04,648 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815670612] [2021-06-12 15:08:04,649 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815670612] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 15:08:04,649 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 15:08:04,649 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-06-12 15:08:04,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100904058] [2021-06-12 15:08:04,649 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-12 15:08:04,649 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 15:08:04,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-12 15:08:04,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2021-06-12 15:08:04,650 INFO L87 Difference]: Start difference. First operand 11918 states and 32798 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-12 15:08:05,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 15:08:05,698 INFO L93 Difference]: Finished difference Result 16890 states and 46551 transitions. [2021-06-12 15:08:05,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-12 15:08:05,698 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-12 15:08:05,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 15:08:05,731 INFO L225 Difference]: With dead ends: 16890 [2021-06-12 15:08:05,731 INFO L226 Difference]: Without dead ends: 16890 [2021-06-12 15:08:05,732 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 660.5ms TimeCoverageRelationStatistics Valid=313, Invalid=947, Unknown=0, NotChecked=0, Total=1260 [2021-06-12 15:08:05,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16890 states. [2021-06-12 15:08:06,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16890 to 14265. [2021-06-12 15:08:06,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14265 states, 14263 states have (on average 2.7540489378111195) internal successors, (39281), 14264 states have internal predecessors, (39281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 15:08:06,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14265 states to 14265 states and 39281 transitions. [2021-06-12 15:08:06,220 INFO L78 Accepts]: Start accepts. Automaton has 14265 states and 39281 transitions. Word has length 105 [2021-06-12 15:08:06,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 15:08:06,220 INFO L482 AbstractCegarLoop]: Abstraction has 14265 states and 39281 transitions. [2021-06-12 15:08:06,221 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-12 15:08:06,221 INFO L276 IsEmpty]: Start isEmpty. Operand 14265 states and 39281 transitions. [2021-06-12 15:08:06,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-12 15:08:06,248 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 15:08:06,248 INFO L472 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-12 15:08:06,248 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-12 15:08:06,249 INFO L430 AbstractCegarLoop]: === Iteration 7 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 15:08:06,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 15:08:06,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1261951723, now seen corresponding path program 2 times [2021-06-12 15:08:06,250 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 15:08:06,250 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225428020] [2021-06-12 15:08:06,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 15:08:06,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 15:08:07,124 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-12 15:08:07,124 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 15:08:07,124 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225428020] [2021-06-12 15:08:07,124 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225428020] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 15:08:07,124 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 15:08:07,124 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-06-12 15:08:07,125 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045455415] [2021-06-12 15:08:07,125 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-12 15:08:07,125 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 15:08:07,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-12 15:08:07,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2021-06-12 15:08:07,126 INFO L87 Difference]: Start difference. First operand 14265 states and 39281 transitions. Second operand has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 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-12 15:08:09,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 15:08:09,648 INFO L93 Difference]: Finished difference Result 20474 states and 56144 transitions. [2021-06-12 15:08:09,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-06-12 15:08:09,648 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 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-12 15:08:09,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 15:08:09,681 INFO L225 Difference]: With dead ends: 20474 [2021-06-12 15:08:09,682 INFO L226 Difference]: Without dead ends: 19953 [2021-06-12 15:08:09,683 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 1988.0ms TimeCoverageRelationStatistics Valid=492, Invalid=1958, Unknown=0, NotChecked=0, Total=2450 [2021-06-12 15:08:09,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19953 states. [2021-06-12 15:08:10,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19953 to 16773. [2021-06-12 15:08:10,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16773 states, 16771 states have (on average 2.7621489475880985) internal successors, (46324), 16772 states have internal predecessors, (46324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 15:08:10,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16773 states to 16773 states and 46324 transitions. [2021-06-12 15:08:10,104 INFO L78 Accepts]: Start accepts. Automaton has 16773 states and 46324 transitions. Word has length 105 [2021-06-12 15:08:10,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 15:08:10,105 INFO L482 AbstractCegarLoop]: Abstraction has 16773 states and 46324 transitions. [2021-06-12 15:08:10,105 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 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-12 15:08:10,105 INFO L276 IsEmpty]: Start isEmpty. Operand 16773 states and 46324 transitions. [2021-06-12 15:08:10,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-06-12 15:08:10,126 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 15:08:10,126 INFO L472 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-12 15:08:10,126 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-12 15:08:10,126 INFO L430 AbstractCegarLoop]: === Iteration 8 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 15:08:10,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 15:08:10,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1732922443, now seen corresponding path program 1 times [2021-06-12 15:08:10,127 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 15:08:10,127 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714032543] [2021-06-12 15:08:10,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 15:08:10,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 15:08:10,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 15:08:10,868 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 15:08:10,868 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714032543] [2021-06-12 15:08:10,868 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714032543] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 15:08:10,868 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 15:08:10,873 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-06-12 15:08:10,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968569319] [2021-06-12 15:08:10,874 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-06-12 15:08:10,874 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 15:08:10,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-06-12 15:08:10,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=785, Unknown=0, NotChecked=0, Total=870 [2021-06-12 15:08:10,876 INFO L87 Difference]: Start difference. First operand 16773 states and 46324 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-12 15:08:13,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 15:08:13,576 INFO L93 Difference]: Finished difference Result 20614 states and 56541 transitions. [2021-06-12 15:08:13,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-12 15:08:13,576 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-12 15:08:13,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 15:08:13,606 INFO L225 Difference]: With dead ends: 20614 [2021-06-12 15:08:13,606 INFO L226 Difference]: Without dead ends: 19688 [2021-06-12 15:08:13,607 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 1816.4ms TimeCoverageRelationStatistics Valid=542, Invalid=2320, Unknown=0, NotChecked=0, Total=2862 [2021-06-12 15:08:13,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19688 states. [2021-06-12 15:08:13,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19688 to 16940. [2021-06-12 15:08:13,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16940 states, 16938 states have (on average 2.763608454362971) internal successors, (46810), 16939 states have internal predecessors, (46810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 15:08:13,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16940 states to 16940 states and 46810 transitions. [2021-06-12 15:08:13,983 INFO L78 Accepts]: Start accepts. Automaton has 16940 states and 46810 transitions. Word has length 109 [2021-06-12 15:08:13,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 15:08:13,983 INFO L482 AbstractCegarLoop]: Abstraction has 16940 states and 46810 transitions. [2021-06-12 15:08:13,984 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-12 15:08:13,984 INFO L276 IsEmpty]: Start isEmpty. Operand 16940 states and 46810 transitions. [2021-06-12 15:08:14,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-06-12 15:08:14,001 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 15:08:14,002 INFO L472 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-12 15:08:14,002 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-12 15:08:14,002 INFO L430 AbstractCegarLoop]: === Iteration 9 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 15:08:14,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 15:08:14,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1462976531, now seen corresponding path program 2 times [2021-06-12 15:08:14,002 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 15:08:14,002 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991886929] [2021-06-12 15:08:14,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 15:08:14,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 15:08:14,679 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-12 15:08:14,679 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 15:08:14,679 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991886929] [2021-06-12 15:08:14,679 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991886929] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 15:08:14,680 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 15:08:14,680 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-06-12 15:08:14,680 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072862301] [2021-06-12 15:08:14,680 INFO L462 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-06-12 15:08:14,680 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 15:08:14,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-06-12 15:08:14,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=733, Unknown=0, NotChecked=0, Total=812 [2021-06-12 15:08:14,681 INFO L87 Difference]: Start difference. First operand 16940 states and 46810 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-12 15:08:17,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 15:08:17,330 INFO L93 Difference]: Finished difference Result 17603 states and 48359 transitions. [2021-06-12 15:08:17,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-06-12 15:08:17,331 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-12 15:08:17,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 15:08:17,353 INFO L225 Difference]: With dead ends: 17603 [2021-06-12 15:08:17,353 INFO L226 Difference]: Without dead ends: 17217 [2021-06-12 15:08:17,354 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 1974.2ms TimeCoverageRelationStatistics Valid=554, Invalid=2308, Unknown=0, NotChecked=0, Total=2862 [2021-06-12 15:08:17,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17217 states. [2021-06-12 15:08:17,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17217 to 16732. [2021-06-12 15:08:17,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16732 states, 16730 states have (on average 2.7652719665271968) internal successors, (46263), 16731 states have internal predecessors, (46263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 15:08:17,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16732 states to 16732 states and 46263 transitions. [2021-06-12 15:08:17,767 INFO L78 Accepts]: Start accepts. Automaton has 16732 states and 46263 transitions. Word has length 109 [2021-06-12 15:08:17,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 15:08:17,768 INFO L482 AbstractCegarLoop]: Abstraction has 16732 states and 46263 transitions. [2021-06-12 15:08:17,768 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-12 15:08:17,768 INFO L276 IsEmpty]: Start isEmpty. Operand 16732 states and 46263 transitions. [2021-06-12 15:08:17,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-06-12 15:08:17,794 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 15:08:17,794 INFO L472 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] [2021-06-12 15:08:17,795 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-12 15:08:17,795 INFO L430 AbstractCegarLoop]: === Iteration 10 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 15:08:17,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 15:08:17,795 INFO L82 PathProgramCache]: Analyzing trace with hash -91066704, now seen corresponding path program 1 times [2021-06-12 15:08:17,795 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 15:08:17,795 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282037568] [2021-06-12 15:08:17,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 15:08:17,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 15:08:17,848 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-12 15:08:17,848 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 15:08:17,848 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282037568] [2021-06-12 15:08:17,848 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282037568] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 15:08:17,848 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 15:08:17,848 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-12 15:08:17,848 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369818381] [2021-06-12 15:08:17,849 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-12 15:08:17,849 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 15:08:17,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-12 15:08:17,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 15:08:17,849 INFO L87 Difference]: Start difference. First operand 16732 states and 46263 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 15:08:17,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 15:08:17,873 INFO L93 Difference]: Finished difference Result 4749 states and 12040 transitions. [2021-06-12 15:08:17,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-12 15:08:17,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2021-06-12 15:08:17,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 15:08:17,877 INFO L225 Difference]: With dead ends: 4749 [2021-06-12 15:08:17,877 INFO L226 Difference]: Without dead ends: 2943 [2021-06-12 15:08:17,878 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 15:08:17,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2943 states. [2021-06-12 15:08:17,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2943 to 2735. [2021-06-12 15:08:17,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2735 states, 2733 states have (on average 2.538968166849616) internal successors, (6939), 2734 states have internal predecessors, (6939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 15:08:17,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2735 states to 2735 states and 6939 transitions. [2021-06-12 15:08:17,924 INFO L78 Accepts]: Start accepts. Automaton has 2735 states and 6939 transitions. Word has length 126 [2021-06-12 15:08:17,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 15:08:17,925 INFO L482 AbstractCegarLoop]: Abstraction has 2735 states and 6939 transitions. [2021-06-12 15:08:17,925 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 15:08:17,925 INFO L276 IsEmpty]: Start isEmpty. Operand 2735 states and 6939 transitions. [2021-06-12 15:08:17,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-06-12 15:08:17,929 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 15:08:17,929 INFO L472 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] [2021-06-12 15:08:17,929 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-12 15:08:17,929 INFO L430 AbstractCegarLoop]: === Iteration 11 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 15:08:17,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 15:08:17,930 INFO L82 PathProgramCache]: Analyzing trace with hash 116634820, now seen corresponding path program 1 times [2021-06-12 15:08:17,930 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 15:08:17,930 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279762844] [2021-06-12 15:08:17,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 15:08:17,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 15:08:17,977 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-12 15:08:17,977 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 15:08:17,977 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279762844] [2021-06-12 15:08:17,977 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279762844] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 15:08:17,977 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 15:08:17,977 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-12 15:08:17,977 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379339130] [2021-06-12 15:08:17,977 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-12 15:08:17,978 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 15:08:17,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-12 15:08:17,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 15:08:17,980 INFO L87 Difference]: Start difference. First operand 2735 states and 6939 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 15:08:17,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 15:08:17,982 INFO L93 Difference]: Finished difference Result 253 states and 535 transitions. [2021-06-12 15:08:17,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-12 15:08:17,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 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 142 [2021-06-12 15:08:17,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 15:08:17,983 INFO L225 Difference]: With dead ends: 253 [2021-06-12 15:08:17,983 INFO L226 Difference]: Without dead ends: 0 [2021-06-12 15:08:17,983 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 15:08:17,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-12 15:08:17,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-12 15:08:17,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 15:08:17,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-12 15:08:17,984 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 142 [2021-06-12 15:08:17,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 15:08:17,984 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-12 15:08:17,984 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 15:08:17,984 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-12 15:08:17,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-12 15:08:17,985 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-12 15:08:17,985 INFO L301 ceAbstractionStarter]: Result for error location t1Thread1of1ForFork0 was SAFE (1/5) [2021-06-12 15:08:17,987 INFO L255 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-06-12 15:08:17,987 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-12 15:08:17,987 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-12 15:08:17,987 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-12 15:08:17,987 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-12 15:08:17,987 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-12 15:08:17,988 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-12 15:08:17,988 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-12 15:08:17,988 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-06-12 15:08:17,994 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 247 places, 257 transitions, 536 flow [2021-06-12 15:08:18,888 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-12 15:08:18,918 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-12 15:08:18,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-06-12 15:08:18,918 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 15:08:18,919 INFO L472 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-12 15:08:18,919 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 15:08:18,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 15:08:18,919 INFO L82 PathProgramCache]: Analyzing trace with hash 617310073, now seen corresponding path program 1 times [2021-06-12 15:08:18,919 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 15:08:18,919 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147985175] [2021-06-12 15:08:18,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 15:08:18,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 15:08:18,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 15:08:18,933 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 15:08:18,934 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147985175] [2021-06-12 15:08:18,934 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147985175] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 15:08:18,934 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 15:08:18,934 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-12 15:08:18,934 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255008268] [2021-06-12 15:08:18,934 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-12 15:08:18,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 15:08:18,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-12 15:08:18,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-12 15:08:18,968 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-12 15:08:19,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 15:08:19,060 INFO L93 Difference]: Finished difference Result 23006 states and 64260 transitions. [2021-06-12 15:08:19,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-12 15:08:19,060 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-12 15:08:19,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 15:08:19,060 INFO L225 Difference]: With dead ends: 23006 [2021-06-12 15:08:19,060 INFO L226 Difference]: Without dead ends: 0 [2021-06-12 15:08:19,060 INFO L728 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-12 15:08:19,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-12 15:08:19,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-12 15:08:19,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 15:08:19,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-12 15:08:19,061 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2021-06-12 15:08:19,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 15:08:19,061 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-12 15:08:19,061 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-12 15:08:19,061 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-12 15:08:19,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-12 15:08:19,061 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-12 15:08:19,061 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE (2/5) [2021-06-12 15:08:19,062 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-12 15:08:19,062 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-12 15:08:19,062 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-12 15:08:19,063 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-12 15:08:19,063 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-12 15:08:19,063 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-12 15:08:19,063 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-12 15:08:19,063 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-12 15:08:19,063 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == t2Thread1of1ForFork1======== [2021-06-12 15:08:19,064 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 247 places, 257 transitions, 536 flow [2021-06-12 15:08:19,850 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-12 15:08:19,878 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-12 15:08:19,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-06-12 15:08:19,894 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 15:08:19,894 INFO L472 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] [2021-06-12 15:08:19,894 INFO L430 AbstractCegarLoop]: === Iteration 1 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 15:08:19,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 15:08:19,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1979063990, now seen corresponding path program 1 times [2021-06-12 15:08:19,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 15:08:19,895 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708882199] [2021-06-12 15:08:19,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 15:08:19,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 15:08:19,994 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-12 15:08:19,994 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 15:08:19,994 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708882199] [2021-06-12 15:08:19,994 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708882199] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 15:08:19,994 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 15:08:19,994 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-12 15:08:19,994 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315830433] [2021-06-12 15:08:19,995 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-12 15:08:19,995 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 15:08:19,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-12 15:08:19,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-06-12 15:08:20,030 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 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 15:08:20,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 15:08:20,463 INFO L93 Difference]: Finished difference Result 23003 states and 64256 transitions. [2021-06-12 15:08:20,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-12 15:08:20,464 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2021-06-12 15:08:20,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 15:08:20,493 INFO L225 Difference]: With dead ends: 23003 [2021-06-12 15:08:20,493 INFO L226 Difference]: Without dead ends: 21410 [2021-06-12 15:08:20,494 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 214.1ms TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420 [2021-06-12 15:08:20,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21410 states. [2021-06-12 15:08:20,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21410 to 21410. [2021-06-12 15:08:20,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21410 states, 21408 states have (on average 2.8053998505231688) internal successors, (60058), 21409 states have internal predecessors, (60058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 15:08:20,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21410 states to 21410 states and 60058 transitions. [2021-06-12 15:08:20,950 INFO L78 Accepts]: Start accepts. Automaton has 21410 states and 60058 transitions. Word has length 92 [2021-06-12 15:08:20,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 15:08:20,950 INFO L482 AbstractCegarLoop]: Abstraction has 21410 states and 60058 transitions. [2021-06-12 15:08:20,950 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 15:08:20,950 INFO L276 IsEmpty]: Start isEmpty. Operand 21410 states and 60058 transitions. [2021-06-12 15:08:20,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-06-12 15:08:20,955 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 15:08:20,955 INFO L472 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-12 15:08:20,955 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-12 15:08:20,955 INFO L430 AbstractCegarLoop]: === Iteration 2 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 15:08:20,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 15:08:20,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1743993907, now seen corresponding path program 1 times [2021-06-12 15:08:20,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 15:08:20,956 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796866282] [2021-06-12 15:08:20,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 15:08:20,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 15:08:20,983 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-12 15:08:20,984 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 15:08:20,984 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796866282] [2021-06-12 15:08:20,984 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796866282] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 15:08:20,984 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 15:08:20,984 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-12 15:08:20,984 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792312603] [2021-06-12 15:08:20,984 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-12 15:08:20,984 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 15:08:20,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-12 15:08:20,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 15:08:20,985 INFO L87 Difference]: Start difference. First operand 21410 states and 60058 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-12 15:08:21,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 15:08:21,041 INFO L93 Difference]: Finished difference Result 14550 states and 40132 transitions. [2021-06-12 15:08:21,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-12 15:08:21,041 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-12 15:08:21,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 15:08:21,063 INFO L225 Difference]: With dead ends: 14550 [2021-06-12 15:08:21,064 INFO L226 Difference]: Without dead ends: 14107 [2021-06-12 15:08:21,064 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 15:08:21,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14107 states. [2021-06-12 15:08:21,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14107 to 14107. [2021-06-12 15:08:21,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14107 states, 14106 states have (on average 2.7586842478377993) internal successors, (38914), 14106 states have internal predecessors, (38914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 15:08:21,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14107 states to 14107 states and 38914 transitions. [2021-06-12 15:08:21,332 INFO L78 Accepts]: Start accepts. Automaton has 14107 states and 38914 transitions. Word has length 93 [2021-06-12 15:08:21,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 15:08:21,333 INFO L482 AbstractCegarLoop]: Abstraction has 14107 states and 38914 transitions. [2021-06-12 15:08:21,333 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-12 15:08:21,333 INFO L276 IsEmpty]: Start isEmpty. Operand 14107 states and 38914 transitions. [2021-06-12 15:08:21,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-06-12 15:08:21,342 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 15:08:21,343 INFO L472 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] [2021-06-12 15:08:21,343 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-12 15:08:21,343 INFO L430 AbstractCegarLoop]: === Iteration 3 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 15:08:21,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 15:08:21,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1365563195, now seen corresponding path program 1 times [2021-06-12 15:08:21,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 15:08:21,343 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138086599] [2021-06-12 15:08:21,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 15:08:21,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 15:08:21,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 15:08:21,380 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 15:08:21,380 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138086599] [2021-06-12 15:08:21,380 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138086599] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 15:08:21,380 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 15:08:21,380 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-12 15:08:21,380 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614883839] [2021-06-12 15:08:21,380 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-12 15:08:21,381 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 15:08:21,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-12 15:08:21,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 15:08:21,381 INFO L87 Difference]: Start difference. First operand 14107 states and 38914 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 15:08:21,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 15:08:21,417 INFO L93 Difference]: Finished difference Result 6968 states and 17928 transitions. [2021-06-12 15:08:21,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-12 15:08:21,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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 171 [2021-06-12 15:08:21,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 15:08:21,427 INFO L225 Difference]: With dead ends: 6968 [2021-06-12 15:08:21,428 INFO L226 Difference]: Without dead ends: 6968 [2021-06-12 15:08:21,428 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 15:08:21,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6968 states. [2021-06-12 15:08:21,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6968 to 5714. [2021-06-12 15:08:21,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5714 states, 5712 states have (on average 2.5773809523809526) internal successors, (14722), 5713 states have internal predecessors, (14722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 15:08:21,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5714 states to 5714 states and 14722 transitions. [2021-06-12 15:08:21,535 INFO L78 Accepts]: Start accepts. Automaton has 5714 states and 14722 transitions. Word has length 171 [2021-06-12 15:08:21,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 15:08:21,535 INFO L482 AbstractCegarLoop]: Abstraction has 5714 states and 14722 transitions. [2021-06-12 15:08:21,535 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 15:08:21,535 INFO L276 IsEmpty]: Start isEmpty. Operand 5714 states and 14722 transitions. [2021-06-12 15:08:21,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2021-06-12 15:08:21,543 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 15:08:21,543 INFO L472 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] [2021-06-12 15:08:21,543 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-12 15:08:21,543 INFO L430 AbstractCegarLoop]: === Iteration 4 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 15:08:21,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 15:08:21,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1471191579, now seen corresponding path program 1 times [2021-06-12 15:08:21,544 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 15:08:21,544 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603595808] [2021-06-12 15:08:21,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 15:08:21,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 15:08:22,242 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-12 15:08:22,242 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 15:08:22,242 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603595808] [2021-06-12 15:08:22,242 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603595808] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 15:08:22,243 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 15:08:22,243 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-06-12 15:08:22,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450125795] [2021-06-12 15:08:22,243 INFO L462 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-06-12 15:08:22,243 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 15:08:22,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-06-12 15:08:22,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=829, Unknown=0, NotChecked=0, Total=930 [2021-06-12 15:08:22,244 INFO L87 Difference]: Start difference. First operand 5714 states and 14722 transitions. Second operand has 31 states, 31 states have (on average 5.548387096774194) internal successors, (172), 31 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 15:08:23,017 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 59 [2021-06-12 15:08:24,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 15:08:24,226 INFO L93 Difference]: Finished difference Result 10116 states and 26169 transitions. [2021-06-12 15:08:24,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-06-12 15:08:24,226 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 5.548387096774194) internal successors, (172), 31 states have internal predecessors, (172), 0 states have call successors, (0), 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 172 [2021-06-12 15:08:24,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 15:08:24,237 INFO L225 Difference]: With dead ends: 10116 [2021-06-12 15:08:24,237 INFO L226 Difference]: Without dead ends: 10116 [2021-06-12 15:08:24,238 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 1796.2ms TimeCoverageRelationStatistics Valid=564, Invalid=2516, Unknown=0, NotChecked=0, Total=3080 [2021-06-12 15:08:24,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10116 states. [2021-06-12 15:08:24,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10116 to 8359. [2021-06-12 15:08:24,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8359 states, 8357 states have (on average 2.592916118224243) internal successors, (21669), 8358 states have internal predecessors, (21669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 15:08:24,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8359 states to 8359 states and 21669 transitions. [2021-06-12 15:08:24,382 INFO L78 Accepts]: Start accepts. Automaton has 8359 states and 21669 transitions. Word has length 172 [2021-06-12 15:08:24,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 15:08:24,383 INFO L482 AbstractCegarLoop]: Abstraction has 8359 states and 21669 transitions. [2021-06-12 15:08:24,383 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 31 states, 31 states have (on average 5.548387096774194) internal successors, (172), 31 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 15:08:24,383 INFO L276 IsEmpty]: Start isEmpty. Operand 8359 states and 21669 transitions. [2021-06-12 15:08:24,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2021-06-12 15:08:24,394 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 15:08:24,394 INFO L472 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] [2021-06-12 15:08:24,394 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-12 15:08:24,394 INFO L430 AbstractCegarLoop]: === Iteration 5 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 15:08:24,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 15:08:24,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1009136741, now seen corresponding path program 2 times [2021-06-12 15:08:24,395 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 15:08:24,395 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469972541] [2021-06-12 15:08:24,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 15:08:24,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 15:08:24,617 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-12 15:08:24,617 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 15:08:24,617 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469972541] [2021-06-12 15:08:24,617 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469972541] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 15:08:24,618 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 15:08:24,618 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-06-12 15:08:24,618 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441114341] [2021-06-12 15:08:24,618 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-12 15:08:24,618 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 15:08:24,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-12 15:08:24,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2021-06-12 15:08:24,619 INFO L87 Difference]: Start difference. First operand 8359 states and 21669 transitions. Second operand has 16 states, 16 states have (on average 10.75) internal successors, (172), 16 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 15:08:25,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 15:08:25,313 INFO L93 Difference]: Finished difference Result 7534 states and 19551 transitions. [2021-06-12 15:08:25,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-12 15:08:25,313 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 10.75) internal successors, (172), 16 states have internal predecessors, (172), 0 states have call successors, (0), 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 172 [2021-06-12 15:08:25,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 15:08:25,322 INFO L225 Difference]: With dead ends: 7534 [2021-06-12 15:08:25,322 INFO L226 Difference]: Without dead ends: 7534 [2021-06-12 15:08:25,322 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 553.2ms TimeCoverageRelationStatistics Valid=223, Invalid=533, Unknown=0, NotChecked=0, Total=756 [2021-06-12 15:08:25,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7534 states. [2021-06-12 15:08:25,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7534 to 7513. [2021-06-12 15:08:25,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7513 states, 7511 states have (on average 2.59592597523632) internal successors, (19498), 7512 states have internal predecessors, (19498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 15:08:25,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7513 states to 7513 states and 19498 transitions. [2021-06-12 15:08:25,428 INFO L78 Accepts]: Start accepts. Automaton has 7513 states and 19498 transitions. Word has length 172 [2021-06-12 15:08:25,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 15:08:25,428 INFO L482 AbstractCegarLoop]: Abstraction has 7513 states and 19498 transitions. [2021-06-12 15:08:25,428 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 10.75) internal successors, (172), 16 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 15:08:25,428 INFO L276 IsEmpty]: Start isEmpty. Operand 7513 states and 19498 transitions. [2021-06-12 15:08:25,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-06-12 15:08:25,436 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 15:08:25,436 INFO L472 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-12 15:08:25,437 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-12 15:08:25,437 INFO L430 AbstractCegarLoop]: === Iteration 6 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 15:08:25,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 15:08:25,437 INFO L82 PathProgramCache]: Analyzing trace with hash 781502976, now seen corresponding path program 1 times [2021-06-12 15:08:25,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 15:08:25,437 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176403455] [2021-06-12 15:08:25,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 15:08:25,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 15:08:25,912 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2021-06-12 15:08:26,067 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2021-06-12 15:08:26,709 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 35 [2021-06-12 15:08:27,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-12 15:08:27,134 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 15:08:27,134 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176403455] [2021-06-12 15:08:27,134 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176403455] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 15:08:27,134 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 15:08:27,134 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-06-12 15:08:27,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500307464] [2021-06-12 15:08:27,134 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-12 15:08:27,134 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 15:08:27,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-12 15:08:27,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2021-06-12 15:08:27,135 INFO L87 Difference]: Start difference. First operand 7513 states and 19498 transitions. Second operand has 21 states, 21 states have (on average 8.380952380952381) internal successors, (176), 21 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-12 15:08:27,748 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 63 [2021-06-12 15:08:27,938 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 71 [2021-06-12 15:08:28,132 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 73 [2021-06-12 15:08:28,313 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2021-06-12 15:08:28,460 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2021-06-12 15:08:29,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 15:08:29,667 INFO L93 Difference]: Finished difference Result 7672 states and 19802 transitions. [2021-06-12 15:08:29,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-12 15:08:29,667 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 8.380952380952381) internal successors, (176), 21 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-12 15:08:29,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 15:08:29,676 INFO L225 Difference]: With dead ends: 7672 [2021-06-12 15:08:29,676 INFO L226 Difference]: Without dead ends: 7672 [2021-06-12 15:08:29,676 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 18 SyntacticMatches, 8 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 2698.3ms TimeCoverageRelationStatistics Valid=316, Invalid=944, Unknown=0, NotChecked=0, Total=1260 [2021-06-12 15:08:29,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7672 states. [2021-06-12 15:08:29,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7672 to 7462. [2021-06-12 15:08:29,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7462 states, 7460 states have (on average 2.583378016085791) internal successors, (19272), 7461 states have internal predecessors, (19272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 15:08:29,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7462 states to 7462 states and 19272 transitions. [2021-06-12 15:08:29,776 INFO L78 Accepts]: Start accepts. Automaton has 7462 states and 19272 transitions. Word has length 176 [2021-06-12 15:08:29,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 15:08:29,776 INFO L482 AbstractCegarLoop]: Abstraction has 7462 states and 19272 transitions. [2021-06-12 15:08:29,776 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 8.380952380952381) internal successors, (176), 21 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-12 15:08:29,776 INFO L276 IsEmpty]: Start isEmpty. Operand 7462 states and 19272 transitions. [2021-06-12 15:08:29,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-06-12 15:08:29,787 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 15:08:29,787 INFO L472 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-12 15:08:29,787 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-12 15:08:29,787 INFO L430 AbstractCegarLoop]: === Iteration 7 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 15:08:29,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 15:08:29,787 INFO L82 PathProgramCache]: Analyzing trace with hash -399593919, now seen corresponding path program 1 times [2021-06-12 15:08:29,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 15:08:29,788 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309433922] [2021-06-12 15:08:29,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 15:08:29,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 15:08:30,443 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-12 15:08:30,443 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 15:08:30,443 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309433922] [2021-06-12 15:08:30,443 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309433922] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 15:08:30,444 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 15:08:30,444 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-06-12 15:08:30,444 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687800783] [2021-06-12 15:08:30,444 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-06-12 15:08:30,444 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 15:08:30,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-06-12 15:08:30,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=754, Unknown=0, NotChecked=0, Total=870 [2021-06-12 15:08:30,445 INFO L87 Difference]: Start difference. First operand 7462 states and 19272 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-12 15:08:31,530 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2021-06-12 15:08:32,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 15:08:32,967 INFO L93 Difference]: Finished difference Result 7450 states and 19113 transitions. [2021-06-12 15:08:32,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-06-12 15:08:32,974 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-12 15:08:32,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 15:08:32,982 INFO L225 Difference]: With dead ends: 7450 [2021-06-12 15:08:32,982 INFO L226 Difference]: Without dead ends: 7450 [2021-06-12 15:08:32,983 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 800 ImplicationChecksByTransitivity, 2249.2ms TimeCoverageRelationStatistics Valid=768, Invalid=2892, Unknown=0, NotChecked=0, Total=3660 [2021-06-12 15:08:32,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7450 states. [2021-06-12 15:08:33,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7450 to 6542. [2021-06-12 15:08:33,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6542 states, 6540 states have (on average 2.5720183486238533) internal successors, (16821), 6541 states have internal predecessors, (16821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 15:08:33,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6542 states to 6542 states and 16821 transitions. [2021-06-12 15:08:33,071 INFO L78 Accepts]: Start accepts. Automaton has 6542 states and 16821 transitions. Word has length 176 [2021-06-12 15:08:33,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 15:08:33,071 INFO L482 AbstractCegarLoop]: Abstraction has 6542 states and 16821 transitions. [2021-06-12 15:08:33,071 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-12 15:08:33,071 INFO L276 IsEmpty]: Start isEmpty. Operand 6542 states and 16821 transitions. [2021-06-12 15:08:33,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-06-12 15:08:33,077 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 15:08:33,077 INFO L472 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-12 15:08:33,077 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-12 15:08:33,077 INFO L430 AbstractCegarLoop]: === Iteration 8 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 15:08:33,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 15:08:33,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1262122175, now seen corresponding path program 2 times [2021-06-12 15:08:33,077 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 15:08:33,077 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793391265] [2021-06-12 15:08:33,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 15:08:33,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 15:08:34,103 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-12 15:08:34,104 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 15:08:34,104 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793391265] [2021-06-12 15:08:34,104 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793391265] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 15:08:34,104 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 15:08:34,104 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-06-12 15:08:34,104 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339027981] [2021-06-12 15:08:34,104 INFO L462 AbstractCegarLoop]: Interpolant automaton has 36 states [2021-06-12 15:08:34,104 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 15:08:34,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-06-12 15:08:34,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1108, Unknown=0, NotChecked=0, Total=1260 [2021-06-12 15:08:34,105 INFO L87 Difference]: Start difference. First operand 6542 states and 16821 transitions. Second operand has 36 states, 36 states have (on average 4.888888888888889) internal successors, (176), 36 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-12 15:08:37,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 15:08:37,434 INFO L93 Difference]: Finished difference Result 10942 states and 28325 transitions. [2021-06-12 15:08:37,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-06-12 15:08:37,435 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 4.888888888888889) internal successors, (176), 36 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-12 15:08:37,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 15:08:37,447 INFO L225 Difference]: With dead ends: 10942 [2021-06-12 15:08:37,447 INFO L226 Difference]: Without dead ends: 10942 [2021-06-12 15:08:37,449 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 6 SyntacticMatches, 6 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 3199.1ms TimeCoverageRelationStatistics Valid=1103, Invalid=4299, Unknown=0, NotChecked=0, Total=5402 [2021-06-12 15:08:37,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10942 states. [2021-06-12 15:08:37,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10942 to 9393. [2021-06-12 15:08:37,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9393 states, 9391 states have (on average 2.597380470663401) internal successors, (24392), 9392 states have internal predecessors, (24392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 15:08:37,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9393 states to 9393 states and 24392 transitions. [2021-06-12 15:08:37,602 INFO L78 Accepts]: Start accepts. Automaton has 9393 states and 24392 transitions. Word has length 176 [2021-06-12 15:08:37,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 15:08:37,603 INFO L482 AbstractCegarLoop]: Abstraction has 9393 states and 24392 transitions. [2021-06-12 15:08:37,603 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 36 states, 36 states have (on average 4.888888888888889) internal successors, (176), 36 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-12 15:08:37,603 INFO L276 IsEmpty]: Start isEmpty. Operand 9393 states and 24392 transitions. [2021-06-12 15:08:37,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-06-12 15:08:37,611 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 15:08:37,611 INFO L472 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-12 15:08:37,612 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-12 15:08:37,612 INFO L430 AbstractCegarLoop]: === Iteration 9 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 15:08:37,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 15:08:37,612 INFO L82 PathProgramCache]: Analyzing trace with hash -788395354, now seen corresponding path program 1 times [2021-06-12 15:08:37,612 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 15:08:37,612 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480111144] [2021-06-12 15:08:37,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 15:08:37,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 15:08:38,255 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-12 15:08:38,255 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 15:08:38,255 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480111144] [2021-06-12 15:08:38,255 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480111144] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 15:08:38,255 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 15:08:38,255 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-06-12 15:08:38,255 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286268403] [2021-06-12 15:08:38,256 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-12 15:08:38,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 15:08:38,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-12 15:08:38,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2021-06-12 15:08:38,257 INFO L87 Difference]: Start difference. First operand 9393 states and 24392 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-12 15:08:40,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 15:08:40,157 INFO L93 Difference]: Finished difference Result 8472 states and 21820 transitions. [2021-06-12 15:08:40,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-06-12 15:08:40,157 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-12 15:08:40,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 15:08:40,167 INFO L225 Difference]: With dead ends: 8472 [2021-06-12 15:08:40,167 INFO L226 Difference]: Without dead ends: 8472 [2021-06-12 15:08:40,168 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 563 ImplicationChecksByTransitivity, 1803.7ms TimeCoverageRelationStatistics Valid=635, Invalid=2121, Unknown=0, NotChecked=0, Total=2756 [2021-06-12 15:08:40,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8472 states. [2021-06-12 15:08:40,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8472 to 8178. [2021-06-12 15:08:40,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8178 states, 8176 states have (on average 2.5780332681017613) internal successors, (21078), 8177 states have internal predecessors, (21078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 15:08:40,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8178 states to 8178 states and 21078 transitions. [2021-06-12 15:08:40,272 INFO L78 Accepts]: Start accepts. Automaton has 8178 states and 21078 transitions. Word has length 180 [2021-06-12 15:08:40,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 15:08:40,272 INFO L482 AbstractCegarLoop]: Abstraction has 8178 states and 21078 transitions. [2021-06-12 15:08:40,272 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-12 15:08:40,272 INFO L276 IsEmpty]: Start isEmpty. Operand 8178 states and 21078 transitions. [2021-06-12 15:08:40,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-12 15:08:40,278 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 15:08:40,279 INFO L472 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-12 15:08:40,279 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-12 15:08:40,279 INFO L430 AbstractCegarLoop]: === Iteration 10 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 15:08:40,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 15:08:40,279 INFO L82 PathProgramCache]: Analyzing trace with hash -858234869, now seen corresponding path program 1 times [2021-06-12 15:08:40,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 15:08:40,279 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010275639] [2021-06-12 15:08:40,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 15:08:40,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 15:08:40,963 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-06-12 15:08:41,121 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-12 15:08:41,299 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-12 15:08:45,164 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-12 15:08:45,164 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 15:08:45,164 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010275639] [2021-06-12 15:08:45,165 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010275639] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 15:08:45,165 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 15:08:45,165 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-12 15:08:45,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021380372] [2021-06-12 15:08:45,165 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-12 15:08:45,165 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 15:08:45,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-12 15:08:45,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2572, Unknown=0, NotChecked=0, Total=2756 [2021-06-12 15:08:45,166 INFO L87 Difference]: Start difference. First operand 8178 states and 21078 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-12 15:08:47,865 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 52 [2021-06-12 15:08:48,275 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 56 [2021-06-12 15:08:48,684 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 59 [2021-06-12 15:08:49,157 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 61 [2021-06-12 15:08:49,816 WARN L205 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 86 [2021-06-12 15:08:50,533 WARN L205 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 84 [2021-06-12 15:08:51,777 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 59 [2021-06-12 15:08:53,895 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-12 15:08:54,220 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2021-06-12 15:08:56,506 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2021-06-12 15:09:02,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 15:09:02,752 INFO L93 Difference]: Finished difference Result 12591 states and 32503 transitions. [2021-06-12 15:09:02,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-06-12 15:09:02,752 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-12 15:09:02,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 15:09:02,764 INFO L225 Difference]: With dead ends: 12591 [2021-06-12 15:09:02,764 INFO L226 Difference]: Without dead ends: 12171 [2021-06-12 15:09:02,767 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 25 SyntacticMatches, 5 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4461 ImplicationChecksByTransitivity, 14400.9ms TimeCoverageRelationStatistics Valid=1553, Invalid=14959, Unknown=0, NotChecked=0, Total=16512 [2021-06-12 15:09:02,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12171 states. [2021-06-12 15:09:02,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12171 to 9590. [2021-06-12 15:09:02,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9590 states, 9588 states have (on average 2.5602836879432624) internal successors, (24548), 9589 states have internal predecessors, (24548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 15:09:02,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9590 states to 9590 states and 24548 transitions. [2021-06-12 15:09:02,893 INFO L78 Accepts]: Start accepts. Automaton has 9590 states and 24548 transitions. Word has length 184 [2021-06-12 15:09:02,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 15:09:02,893 INFO L482 AbstractCegarLoop]: Abstraction has 9590 states and 24548 transitions. [2021-06-12 15:09:02,893 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-12 15:09:02,894 INFO L276 IsEmpty]: Start isEmpty. Operand 9590 states and 24548 transitions. [2021-06-12 15:09:02,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-12 15:09:02,901 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 15:09:02,901 INFO L472 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-12 15:09:02,902 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-06-12 15:09:02,902 INFO L430 AbstractCegarLoop]: === Iteration 11 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 15:09:02,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 15:09:02,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1302633973, now seen corresponding path program 2 times [2021-06-12 15:09:02,902 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 15:09:02,902 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110662395] [2021-06-12 15:09:02,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 15:09:02,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 15:09:03,612 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-06-12 15:09:03,768 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-12 15:09:03,948 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-12 15:09:05,175 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-12 15:09:05,382 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2021-06-12 15:09:08,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-12 15:09:08,033 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 15:09:08,033 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110662395] [2021-06-12 15:09:08,033 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110662395] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 15:09:08,033 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 15:09:08,033 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-12 15:09:08,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241342174] [2021-06-12 15:09:08,034 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-12 15:09:08,034 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 15:09:08,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-12 15:09:08,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=2574, Unknown=0, NotChecked=0, Total=2756 [2021-06-12 15:09:08,036 INFO L87 Difference]: Start difference. First operand 9590 states and 24548 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-12 15:09:10,141 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 48 [2021-06-12 15:09:11,228 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 52 [2021-06-12 15:09:11,808 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 56 [2021-06-12 15:09:12,364 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 59 [2021-06-12 15:09:12,990 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 61 [2021-06-12 15:09:13,785 WARN L205 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 86 [2021-06-12 15:09:14,654 WARN L205 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 84 [2021-06-12 15:09:15,836 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 69 [2021-06-12 15:09:17,526 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-12 15:09:17,785 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2021-06-12 15:09:20,252 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2021-06-12 15:09:23,696 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2021-06-12 15:09:26,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 15:09:26,527 INFO L93 Difference]: Finished difference Result 14115 states and 36317 transitions. [2021-06-12 15:09:26,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2021-06-12 15:09:26,527 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-12 15:09:26,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 15:09:26,543 INFO L225 Difference]: With dead ends: 14115 [2021-06-12 15:09:26,543 INFO L226 Difference]: Without dead ends: 13695 [2021-06-12 15:09:26,546 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4525 ImplicationChecksByTransitivity, 15711.1ms TimeCoverageRelationStatistics Valid=1579, Invalid=15191, Unknown=0, NotChecked=0, Total=16770 [2021-06-12 15:09:26,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13695 states. [2021-06-12 15:09:26,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13695 to 9590. [2021-06-12 15:09:26,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9590 states, 9588 states have (on average 2.5602836879432624) internal successors, (24548), 9589 states have internal predecessors, (24548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 15:09:26,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9590 states to 9590 states and 24548 transitions. [2021-06-12 15:09:26,686 INFO L78 Accepts]: Start accepts. Automaton has 9590 states and 24548 transitions. Word has length 184 [2021-06-12 15:09:26,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 15:09:26,686 INFO L482 AbstractCegarLoop]: Abstraction has 9590 states and 24548 transitions. [2021-06-12 15:09:26,686 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-12 15:09:26,686 INFO L276 IsEmpty]: Start isEmpty. Operand 9590 states and 24548 transitions. [2021-06-12 15:09:26,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-12 15:09:26,695 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 15:09:26,695 INFO L472 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-12 15:09:26,695 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-06-12 15:09:26,695 INFO L430 AbstractCegarLoop]: === Iteration 12 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 15:09:26,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 15:09:26,695 INFO L82 PathProgramCache]: Analyzing trace with hash 868546213, now seen corresponding path program 3 times [2021-06-12 15:09:26,696 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 15:09:26,696 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883144679] [2021-06-12 15:09:26,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 15:09:26,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 15:09:27,391 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-06-12 15:09:27,545 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-12 15:09:27,725 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-12 15:09:28,848 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-12 15:09:31,758 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-12 15:09:31,758 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 15:09:31,759 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883144679] [2021-06-12 15:09:31,759 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883144679] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 15:09:31,759 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 15:09:31,759 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-12 15:09:31,759 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932962178] [2021-06-12 15:09:31,759 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-12 15:09:31,759 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 15:09:31,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-12 15:09:31,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=2577, Unknown=0, NotChecked=0, Total=2756 [2021-06-12 15:09:31,760 INFO L87 Difference]: Start difference. First operand 9590 states and 24548 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-12 15:09:33,581 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 48 [2021-06-12 15:09:34,325 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 52 [2021-06-12 15:09:34,994 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 52 [2021-06-12 15:09:35,607 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 56 [2021-06-12 15:09:36,171 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 59 [2021-06-12 15:09:36,781 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 61 [2021-06-12 15:09:37,589 WARN L205 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 86 [2021-06-12 15:09:38,414 WARN L205 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 84 [2021-06-12 15:09:39,938 WARN L205 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 74 [2021-06-12 15:09:41,983 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-12 15:09:42,279 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2021-06-12 15:09:44,359 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2021-06-12 15:09:46,479 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-12 15:09:50,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 15:09:50,214 INFO L93 Difference]: Finished difference Result 14179 states and 36477 transitions. [2021-06-12 15:09:50,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2021-06-12 15:09:50,214 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-12 15:09:50,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 15:09:50,231 INFO L225 Difference]: With dead ends: 14179 [2021-06-12 15:09:50,231 INFO L226 Difference]: Without dead ends: 13759 [2021-06-12 15:09:50,233 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4689 ImplicationChecksByTransitivity, 16525.2ms TimeCoverageRelationStatistics Valid=1626, Invalid=15666, Unknown=0, NotChecked=0, Total=17292 [2021-06-12 15:09:50,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13759 states. [2021-06-12 15:09:50,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13759 to 9590. [2021-06-12 15:09:50,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9590 states, 9588 states have (on average 2.5602836879432624) internal successors, (24548), 9589 states have internal predecessors, (24548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 15:09:50,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9590 states to 9590 states and 24548 transitions. [2021-06-12 15:09:50,375 INFO L78 Accepts]: Start accepts. Automaton has 9590 states and 24548 transitions. Word has length 184 [2021-06-12 15:09:50,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 15:09:50,375 INFO L482 AbstractCegarLoop]: Abstraction has 9590 states and 24548 transitions. [2021-06-12 15:09:50,375 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-12 15:09:50,376 INFO L276 IsEmpty]: Start isEmpty. Operand 9590 states and 24548 transitions. [2021-06-12 15:09:50,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-12 15:09:50,384 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 15:09:50,384 INFO L472 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-12 15:09:50,384 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-06-12 15:09:50,385 INFO L430 AbstractCegarLoop]: === Iteration 13 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 15:09:50,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 15:09:50,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1647526667, now seen corresponding path program 4 times [2021-06-12 15:09:50,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 15:09:50,385 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202880731] [2021-06-12 15:09:50,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 15:09:50,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 15:09:51,105 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-06-12 15:09:51,251 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-12 15:09:51,423 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-12 15:09:55,027 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-12 15:09:55,028 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 15:09:55,028 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202880731] [2021-06-12 15:09:55,028 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202880731] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 15:09:55,028 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 15:09:55,028 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-12 15:09:55,028 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136108439] [2021-06-12 15:09:55,028 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-12 15:09:55,028 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 15:09:55,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-12 15:09:55,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2578, Unknown=0, NotChecked=0, Total=2756 [2021-06-12 15:09:55,029 INFO L87 Difference]: Start difference. First operand 9590 states and 24548 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-12 15:09:57,708 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 48 [2021-06-12 15:09:58,620 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 52 [2021-06-12 15:09:59,189 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 55 [2021-06-12 15:10:00,043 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 52 [2021-06-12 15:10:00,892 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 56 [2021-06-12 15:10:01,741 WARN L205 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 59 [2021-06-12 15:10:02,069 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 61 [2021-06-12 15:10:02,590 WARN L205 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 86 [2021-06-12 15:10:03,150 WARN L205 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 84 [2021-06-12 15:10:04,346 WARN L205 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 77 [2021-06-12 15:10:06,428 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2021-06-12 15:10:08,870 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2021-06-12 15:10:12,326 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2021-06-12 15:10:15,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 15:10:15,736 INFO L93 Difference]: Finished difference Result 14163 states and 36441 transitions. [2021-06-12 15:10:15,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2021-06-12 15:10:15,736 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-12 15:10:15,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 15:10:15,751 INFO L225 Difference]: With dead ends: 14163 [2021-06-12 15:10:15,752 INFO L226 Difference]: Without dead ends: 13743 [2021-06-12 15:10:15,753 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4760 ImplicationChecksByTransitivity, 16533.6ms TimeCoverageRelationStatistics Valid=1657, Invalid=15899, Unknown=0, NotChecked=0, Total=17556 [2021-06-12 15:10:15,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13743 states. [2021-06-12 15:10:15,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13743 to 9590. [2021-06-12 15:10:15,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9590 states, 9588 states have (on average 2.5602836879432624) internal successors, (24548), 9589 states have internal predecessors, (24548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 15:10:15,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9590 states to 9590 states and 24548 transitions. [2021-06-12 15:10:15,888 INFO L78 Accepts]: Start accepts. Automaton has 9590 states and 24548 transitions. Word has length 184 [2021-06-12 15:10:15,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 15:10:15,888 INFO L482 AbstractCegarLoop]: Abstraction has 9590 states and 24548 transitions. [2021-06-12 15:10:15,888 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-12 15:10:15,888 INFO L276 IsEmpty]: Start isEmpty. Operand 9590 states and 24548 transitions. [2021-06-12 15:10:15,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-12 15:10:15,896 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 15:10:15,896 INFO L472 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-12 15:10:15,896 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-06-12 15:10:15,896 INFO L430 AbstractCegarLoop]: === Iteration 14 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 15:10:15,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 15:10:15,897 INFO L82 PathProgramCache]: Analyzing trace with hash -276826587, now seen corresponding path program 5 times [2021-06-12 15:10:15,897 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 15:10:15,897 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335906847] [2021-06-12 15:10:15,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 15:10:15,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 15:10:16,510 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-06-12 15:10:16,666 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-12 15:10:16,849 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-12 15:10:18,019 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-12 15:10:21,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 15:10:21,074 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 15:10:21,074 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335906847] [2021-06-12 15:10:21,074 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335906847] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 15:10:21,074 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 15:10:21,074 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-12 15:10:21,074 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069059356] [2021-06-12 15:10:21,075 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-12 15:10:21,075 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 15:10:21,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-12 15:10:21,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=2580, Unknown=0, NotChecked=0, Total=2756 [2021-06-12 15:10:21,076 INFO L87 Difference]: Start difference. First operand 9590 states and 24548 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-12 15:10:23,514 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 52 [2021-06-12 15:10:23,964 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 55 [2021-06-12 15:10:24,473 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 57 [2021-06-12 15:10:25,152 WARN L205 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 79 [2021-06-12 15:10:25,845 WARN L205 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 77 [2021-06-12 15:10:26,488 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 52 [2021-06-12 15:10:27,569 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 56 [2021-06-12 15:10:28,327 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 59 [2021-06-12 15:10:29,116 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 61 [2021-06-12 15:10:30,005 WARN L205 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 86 [2021-06-12 15:10:30,855 WARN L205 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 83 [2021-06-12 15:10:31,853 WARN L205 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 84 [2021-06-12 15:10:32,907 WARN L205 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 81 [2021-06-12 15:10:35,790 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-12 15:10:36,036 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2021-06-12 15:10:38,005 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2021-06-12 15:10:43,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 15:10:43,955 INFO L93 Difference]: Finished difference Result 14267 states and 36697 transitions. [2021-06-12 15:10:43,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2021-06-12 15:10:43,955 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-12 15:10:43,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 15:10:43,971 INFO L225 Difference]: With dead ends: 14267 [2021-06-12 15:10:43,971 INFO L226 Difference]: Without dead ends: 13847 [2021-06-12 15:10:44,029 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5189 ImplicationChecksByTransitivity, 20904.1ms TimeCoverageRelationStatistics Valid=1783, Invalid=17123, Unknown=0, NotChecked=0, Total=18906 [2021-06-12 15:10:44,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13847 states. [2021-06-12 15:10:44,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13847 to 9590. [2021-06-12 15:10:44,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9590 states, 9588 states have (on average 2.5602836879432624) internal successors, (24548), 9589 states have internal predecessors, (24548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 15:10:44,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9590 states to 9590 states and 24548 transitions. [2021-06-12 15:10:44,159 INFO L78 Accepts]: Start accepts. Automaton has 9590 states and 24548 transitions. Word has length 184 [2021-06-12 15:10:44,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 15:10:44,159 INFO L482 AbstractCegarLoop]: Abstraction has 9590 states and 24548 transitions. [2021-06-12 15:10:44,159 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-12 15:10:44,159 INFO L276 IsEmpty]: Start isEmpty. Operand 9590 states and 24548 transitions. [2021-06-12 15:10:44,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-12 15:10:44,167 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 15:10:44,168 INFO L472 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-12 15:10:44,168 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-06-12 15:10:44,168 INFO L430 AbstractCegarLoop]: === Iteration 15 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 15:10:44,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 15:10:44,170 INFO L82 PathProgramCache]: Analyzing trace with hash -410727541, now seen corresponding path program 6 times [2021-06-12 15:10:44,170 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 15:10:44,170 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89092054] [2021-06-12 15:10:44,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 15:10:44,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 15:10:44,855 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-06-12 15:10:44,997 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-12 15:10:45,167 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-12 15:10:48,754 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-12 15:10:48,754 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 15:10:48,754 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89092054] [2021-06-12 15:10:48,755 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89092054] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 15:10:48,755 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 15:10:48,755 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-12 15:10:48,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063074968] [2021-06-12 15:10:48,755 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-12 15:10:48,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 15:10:48,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-12 15:10:48,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2583, Unknown=0, NotChecked=0, Total=2756 [2021-06-12 15:10:48,756 INFO L87 Difference]: Start difference. First operand 9590 states and 24548 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-12 15:10:51,279 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 48 [2021-06-12 15:10:52,180 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 52 [2021-06-12 15:10:52,755 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 55 [2021-06-12 15:10:53,360 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 57 [2021-06-12 15:10:54,252 WARN L205 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 82 [2021-06-12 15:10:54,702 WARN L205 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 80 [2021-06-12 15:10:55,058 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 52 [2021-06-12 15:10:56,012 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 56 [2021-06-12 15:10:56,533 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 59 [2021-06-12 15:10:57,076 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 61 [2021-06-12 15:10:57,774 WARN L205 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 86 [2021-06-12 15:10:58,511 WARN L205 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 84 [2021-06-12 15:11:01,266 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-12 15:11:01,575 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2021-06-12 15:11:04,425 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2021-06-12 15:11:10,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 15:11:10,676 INFO L93 Difference]: Finished difference Result 14179 states and 36499 transitions. [2021-06-12 15:11:10,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2021-06-12 15:11:10,676 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-12 15:11:10,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 15:11:10,689 INFO L225 Difference]: With dead ends: 14179 [2021-06-12 15:11:10,689 INFO L226 Difference]: Without dead ends: 13759 [2021-06-12 15:11:10,690 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4908 ImplicationChecksByTransitivity, 17360.3ms TimeCoverageRelationStatistics Valid=1701, Invalid=16389, Unknown=0, NotChecked=0, Total=18090 [2021-06-12 15:11:10,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13759 states. [2021-06-12 15:11:10,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13759 to 9668. [2021-06-12 15:11:10,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9668 states, 9666 states have (on average 2.5613490585557623) internal successors, (24758), 9667 states have internal predecessors, (24758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 15:11:10,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9668 states to 9668 states and 24758 transitions. [2021-06-12 15:11:10,806 INFO L78 Accepts]: Start accepts. Automaton has 9668 states and 24758 transitions. Word has length 184 [2021-06-12 15:11:10,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 15:11:10,806 INFO L482 AbstractCegarLoop]: Abstraction has 9668 states and 24758 transitions. [2021-06-12 15:11:10,806 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-12 15:11:10,807 INFO L276 IsEmpty]: Start isEmpty. Operand 9668 states and 24758 transitions. [2021-06-12 15:11:10,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-12 15:11:10,814 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 15:11:10,814 INFO L472 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-12 15:11:10,814 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-06-12 15:11:10,814 INFO L430 AbstractCegarLoop]: === Iteration 16 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 15:11:10,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 15:11:10,814 INFO L82 PathProgramCache]: Analyzing trace with hash 2715019, now seen corresponding path program 7 times [2021-06-12 15:11:10,814 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 15:11:10,814 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42074239] [2021-06-12 15:11:10,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 15:11:10,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 15:11:11,416 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-06-12 15:11:11,567 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-12 15:11:11,743 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-12 15:11:15,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 15:11:15,364 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 15:11:15,364 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42074239] [2021-06-12 15:11:15,364 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42074239] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 15:11:15,364 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 15:11:15,364 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-12 15:11:15,364 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111095133] [2021-06-12 15:11:15,364 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-12 15:11:15,364 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 15:11:15,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-12 15:11:15,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=2585, Unknown=0, NotChecked=0, Total=2756 [2021-06-12 15:11:15,365 INFO L87 Difference]: Start difference. First operand 9668 states and 24758 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-12 15:11:17,425 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 52 [2021-06-12 15:11:17,747 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 55 [2021-06-12 15:11:18,195 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 57 [2021-06-12 15:11:18,814 WARN L205 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 82 [2021-06-12 15:11:19,441 WARN L205 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 80 [2021-06-12 15:11:19,971 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 52 [2021-06-12 15:11:21,006 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 56 [2021-06-12 15:11:21,731 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 59 [2021-06-12 15:11:22,476 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 61 [2021-06-12 15:11:23,465 WARN L205 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 86 [2021-06-12 15:11:24,487 WARN L205 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 84 [2021-06-12 15:11:27,190 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2021-06-12 15:11:29,046 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2021-06-12 15:11:34,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 15:11:34,353 INFO L93 Difference]: Finished difference Result 14149 states and 36443 transitions. [2021-06-12 15:11:34,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2021-06-12 15:11:34,353 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-12 15:11:34,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 15:11:34,366 INFO L225 Difference]: With dead ends: 14149 [2021-06-12 15:11:34,366 INFO L226 Difference]: Without dead ends: 13729 [2021-06-12 15:11:34,367 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5140 ImplicationChecksByTransitivity, 17147.7ms TimeCoverageRelationStatistics Valid=1733, Invalid=17173, Unknown=0, NotChecked=0, Total=18906 [2021-06-12 15:11:34,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13729 states. [2021-06-12 15:11:34,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13729 to 9681. [2021-06-12 15:11:34,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9681 states, 9679 states have (on average 2.5615249509246825) internal successors, (24793), 9680 states have internal predecessors, (24793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 15:11:34,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9681 states to 9681 states and 24793 transitions. [2021-06-12 15:11:34,478 INFO L78 Accepts]: Start accepts. Automaton has 9681 states and 24793 transitions. Word has length 184 [2021-06-12 15:11:34,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 15:11:34,478 INFO L482 AbstractCegarLoop]: Abstraction has 9681 states and 24793 transitions. [2021-06-12 15:11:34,478 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-12 15:11:34,478 INFO L276 IsEmpty]: Start isEmpty. Operand 9681 states and 24793 transitions. [2021-06-12 15:11:34,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-12 15:11:34,485 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 15:11:34,485 INFO L472 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-12 15:11:34,485 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-06-12 15:11:34,485 INFO L430 AbstractCegarLoop]: === Iteration 17 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 15:11:34,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 15:11:34,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1807828059, now seen corresponding path program 8 times [2021-06-12 15:11:34,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 15:11:34,486 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321953679] [2021-06-12 15:11:34,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 15:11:34,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 15:11:35,127 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-06-12 15:11:35,302 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-12 15:11:35,465 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-12 15:11:38,913 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-12 15:11:38,913 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 15:11:38,913 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321953679] [2021-06-12 15:11:38,913 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321953679] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 15:11:38,913 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 15:11:38,913 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-12 15:11:38,913 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472285790] [2021-06-12 15:11:38,914 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-12 15:11:38,914 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 15:11:38,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-12 15:11:38,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=2585, Unknown=0, NotChecked=0, Total=2756 [2021-06-12 15:11:38,914 INFO L87 Difference]: Start difference. First operand 9681 states and 24793 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-12 15:11:41,466 WARN L205 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 52 [2021-06-12 15:11:41,722 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 55 [2021-06-12 15:11:41,995 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 57 [2021-06-12 15:11:42,515 WARN L205 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 82 [2021-06-12 15:11:42,950 WARN L205 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 80 [2021-06-12 15:11:43,307 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 52 [2021-06-12 15:11:44,180 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 56 [2021-06-12 15:11:44,618 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 59 [2021-06-12 15:11:45,083 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 61 [2021-06-12 15:11:45,825 WARN L205 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 86 [2021-06-12 15:11:46,637 WARN L205 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 84 [2021-06-12 15:11:50,012 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2021-06-12 15:11:51,866 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2021-06-12 15:11:52,338 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2021-06-12 15:11:57,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 15:11:57,792 INFO L93 Difference]: Finished difference Result 14125 states and 36389 transitions. [2021-06-12 15:11:57,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2021-06-12 15:11:57,793 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-12 15:11:57,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 15:11:57,807 INFO L225 Difference]: With dead ends: 14125 [2021-06-12 15:11:57,807 INFO L226 Difference]: Without dead ends: 13705 [2021-06-12 15:11:57,808 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5337 ImplicationChecksByTransitivity, 15592.8ms TimeCoverageRelationStatistics Valid=1756, Invalid=17704, Unknown=0, NotChecked=0, Total=19460 [2021-06-12 15:11:57,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13705 states. [2021-06-12 15:11:57,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13705 to 9694. [2021-06-12 15:11:57,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9694 states, 9692 states have (on average 2.561700371440363) internal successors, (24828), 9693 states have internal predecessors, (24828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 15:11:57,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9694 states to 9694 states and 24828 transitions. [2021-06-12 15:11:57,926 INFO L78 Accepts]: Start accepts. Automaton has 9694 states and 24828 transitions. Word has length 184 [2021-06-12 15:11:57,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 15:11:57,926 INFO L482 AbstractCegarLoop]: Abstraction has 9694 states and 24828 transitions. [2021-06-12 15:11:57,927 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-12 15:11:57,927 INFO L276 IsEmpty]: Start isEmpty. Operand 9694 states and 24828 transitions. [2021-06-12 15:11:57,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-12 15:11:57,933 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 15:11:57,934 INFO L472 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-12 15:11:57,934 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-06-12 15:11:57,934 INFO L430 AbstractCegarLoop]: === Iteration 18 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 15:11:57,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 15:11:57,934 INFO L82 PathProgramCache]: Analyzing trace with hash -92526133, now seen corresponding path program 9 times [2021-06-12 15:11:57,934 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 15:11:57,934 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78616789] [2021-06-12 15:11:57,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 15:11:57,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 15:11:58,519 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-06-12 15:11:58,671 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-12 15:11:58,846 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-12 15:11:59,446 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 37 [2021-06-12 15:12:02,201 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-12 15:12:02,201 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 15:12:02,201 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78616789] [2021-06-12 15:12:02,201 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78616789] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 15:12:02,201 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 15:12:02,202 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-12 15:12:02,202 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359208405] [2021-06-12 15:12:02,202 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-12 15:12:02,202 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 15:12:02,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-12 15:12:02,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2572, Unknown=0, NotChecked=0, Total=2756 [2021-06-12 15:12:02,203 INFO L87 Difference]: Start difference. First operand 9694 states and 24828 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-12 15:12:04,365 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 52 [2021-06-12 15:12:04,732 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 55 [2021-06-12 15:12:05,141 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 57 [2021-06-12 15:12:05,794 WARN L205 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 82 [2021-06-12 15:12:06,484 WARN L205 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 80 [2021-06-12 15:12:07,114 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 52 [2021-06-12 15:12:08,254 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 56 [2021-06-12 15:12:09,010 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 59 [2021-06-12 15:12:09,847 WARN L205 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 61 [2021-06-12 15:12:10,431 WARN L205 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 86 [2021-06-12 15:12:11,008 WARN L205 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 84 [2021-06-12 15:12:13,895 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2021-06-12 15:12:15,910 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2021-06-12 15:12:21,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 15:12:21,169 INFO L93 Difference]: Finished difference Result 15477 states and 39922 transitions. [2021-06-12 15:12:21,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2021-06-12 15:12:21,169 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-12 15:12:21,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 15:12:21,183 INFO L225 Difference]: With dead ends: 15477 [2021-06-12 15:12:21,183 INFO L226 Difference]: Without dead ends: 15057 [2021-06-12 15:12:21,184 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5436 ImplicationChecksByTransitivity, 16835.6ms TimeCoverageRelationStatistics Valid=1857, Invalid=17883, Unknown=0, NotChecked=0, Total=19740 [2021-06-12 15:12:21,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15057 states. [2021-06-12 15:12:21,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15057 to 9798. [2021-06-12 15:12:21,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9798 states, 9796 states have (on average 2.5630869742752145) internal successors, (25108), 9797 states have internal predecessors, (25108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 15:12:21,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9798 states to 9798 states and 25108 transitions. [2021-06-12 15:12:21,306 INFO L78 Accepts]: Start accepts. Automaton has 9798 states and 25108 transitions. Word has length 184 [2021-06-12 15:12:21,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 15:12:21,307 INFO L482 AbstractCegarLoop]: Abstraction has 9798 states and 25108 transitions. [2021-06-12 15:12:21,307 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-12 15:12:21,307 INFO L276 IsEmpty]: Start isEmpty. Operand 9798 states and 25108 transitions. [2021-06-12 15:12:21,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-12 15:12:21,314 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 15:12:21,314 INFO L472 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-12 15:12:21,314 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-06-12 15:12:21,314 INFO L430 AbstractCegarLoop]: === Iteration 19 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 15:12:21,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 15:12:21,314 INFO L82 PathProgramCache]: Analyzing trace with hash 787291659, now seen corresponding path program 10 times [2021-06-12 15:12:21,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 15:12:21,314 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709830011] [2021-06-12 15:12:21,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 15:12:21,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 15:12:21,917 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-06-12 15:12:22,105 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-12 15:12:22,325 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-12 15:12:25,843 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-12 15:12:25,844 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 15:12:25,844 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709830011] [2021-06-12 15:12:25,844 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709830011] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 15:12:25,844 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 15:12:25,844 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-12 15:12:25,844 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794300058] [2021-06-12 15:12:25,844 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-12 15:12:25,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 15:12:25,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-12 15:12:25,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2555, Unknown=0, NotChecked=0, Total=2756 [2021-06-12 15:12:25,845 INFO L87 Difference]: Start difference. First operand 9798 states and 25108 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-12 15:12:27,998 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 52 [2021-06-12 15:12:28,287 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 55 [2021-06-12 15:12:28,616 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 57 [2021-06-12 15:12:29,114 WARN L205 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 82 [2021-06-12 15:12:29,711 WARN L205 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 80 [2021-06-12 15:12:30,139 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 52 [2021-06-12 15:12:31,171 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 56 [2021-06-12 15:12:31,801 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 59 [2021-06-12 15:12:32,422 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 61 [2021-06-12 15:12:33,254 WARN L205 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 86 [2021-06-12 15:12:34,144 WARN L205 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 84 [2021-06-12 15:12:37,716 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2021-06-12 15:12:39,862 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2021-06-12 15:12:45,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 15:12:45,232 INFO L93 Difference]: Finished difference Result 15333 states and 39480 transitions. [2021-06-12 15:12:45,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2021-06-12 15:12:45,233 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-12 15:12:45,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 15:12:45,248 INFO L225 Difference]: With dead ends: 15333 [2021-06-12 15:12:45,248 INFO L226 Difference]: Without dead ends: 14913 [2021-06-12 15:12:45,249 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5507 ImplicationChecksByTransitivity, 16252.2ms TimeCoverageRelationStatistics Valid=1973, Invalid=17767, Unknown=0, NotChecked=0, Total=19740 [2021-06-12 15:12:45,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14913 states. [2021-06-12 15:12:45,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14913 to 9811. [2021-06-12 15:12:45,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9811 states, 9809 states have (on average 2.563258232235702) internal successors, (25143), 9810 states have internal predecessors, (25143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 15:12:45,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9811 states to 9811 states and 25143 transitions. [2021-06-12 15:12:45,375 INFO L78 Accepts]: Start accepts. Automaton has 9811 states and 25143 transitions. Word has length 184 [2021-06-12 15:12:45,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 15:12:45,375 INFO L482 AbstractCegarLoop]: Abstraction has 9811 states and 25143 transitions. [2021-06-12 15:12:45,375 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-12 15:12:45,376 INFO L276 IsEmpty]: Start isEmpty. Operand 9811 states and 25143 transitions. [2021-06-12 15:12:45,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-12 15:12:45,383 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 15:12:45,384 INFO L472 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-12 15:12:45,384 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-06-12 15:12:45,384 INFO L430 AbstractCegarLoop]: === Iteration 20 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 15:12:45,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 15:12:45,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1611136987, now seen corresponding path program 11 times [2021-06-12 15:12:45,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 15:12:45,384 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070717107] [2021-06-12 15:12:45,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 15:12:45,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 15:12:46,058 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-06-12 15:12:46,240 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-12 15:12:46,454 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-12 15:12:49,943 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-12 15:12:49,944 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 15:12:49,944 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070717107] [2021-06-12 15:12:49,944 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070717107] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 15:12:49,944 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 15:12:49,944 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-12 15:12:49,944 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172058424] [2021-06-12 15:12:49,944 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-12 15:12:49,944 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 15:12:49,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-12 15:12:49,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=2559, Unknown=0, NotChecked=0, Total=2756 [2021-06-12 15:12:49,945 INFO L87 Difference]: Start difference. First operand 9811 states and 25143 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-12 15:12:52,028 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 52 [2021-06-12 15:12:52,399 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 55 [2021-06-12 15:12:52,827 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 57 [2021-06-12 15:12:53,492 WARN L205 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 82 [2021-06-12 15:12:54,181 WARN L205 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 80 [2021-06-12 15:12:57,266 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2021-06-12 15:12:59,360 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2021-06-12 15:13:04,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 15:13:04,883 INFO L93 Difference]: Finished difference Result 15037 states and 38694 transitions. [2021-06-12 15:13:04,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2021-06-12 15:13:04,884 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-12 15:13:04,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 15:13:04,896 INFO L225 Difference]: With dead ends: 15037 [2021-06-12 15:13:04,896 INFO L226 Difference]: Without dead ends: 14617 [2021-06-12 15:13:04,897 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4642 ImplicationChecksByTransitivity, 13512.6ms TimeCoverageRelationStatistics Valid=1631, Invalid=15399, Unknown=0, NotChecked=0, Total=17030 [2021-06-12 15:13:04,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14617 states. [2021-06-12 15:13:04,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14617 to 9850. [2021-06-12 15:13:04,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9850 states, 9848 states have (on average 2.563769293257514) internal successors, (25248), 9849 states have internal predecessors, (25248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 15:13:05,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9850 states to 9850 states and 25248 transitions. [2021-06-12 15:13:05,013 INFO L78 Accepts]: Start accepts. Automaton has 9850 states and 25248 transitions. Word has length 184 [2021-06-12 15:13:05,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 15:13:05,013 INFO L482 AbstractCegarLoop]: Abstraction has 9850 states and 25248 transitions. [2021-06-12 15:13:05,013 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-12 15:13:05,013 INFO L276 IsEmpty]: Start isEmpty. Operand 9850 states and 25248 transitions. [2021-06-12 15:13:05,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-12 15:13:05,020 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 15:13:05,021 INFO L472 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-12 15:13:05,021 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-06-12 15:13:05,021 INFO L430 AbstractCegarLoop]: === Iteration 21 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 15:13:05,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 15:13:05,021 INFO L82 PathProgramCache]: Analyzing trace with hash 481639115, now seen corresponding path program 12 times [2021-06-12 15:13:05,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 15:13:05,021 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765097981] [2021-06-12 15:13:05,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 15:13:05,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 15:13:05,618 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-06-12 15:13:05,810 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-12 15:13:05,983 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-12 15:13:09,327 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-12 15:13:09,328 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 15:13:09,328 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765097981] [2021-06-12 15:13:09,328 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765097981] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 15:13:09,328 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 15:13:09,328 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-12 15:13:09,328 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787098324] [2021-06-12 15:13:09,328 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-12 15:13:09,328 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 15:13:09,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-12 15:13:09,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=2559, Unknown=0, NotChecked=0, Total=2756 [2021-06-12 15:13:09,329 INFO L87 Difference]: Start difference. First operand 9850 states and 25248 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-12 15:13:11,134 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 48 [2021-06-12 15:13:11,479 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 52 [2021-06-12 15:13:11,903 WARN L205 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 55 [2021-06-12 15:13:12,161 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 57 [2021-06-12 15:13:12,581 WARN L205 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 82 [2021-06-12 15:13:12,987 WARN L205 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 80 [2021-06-12 15:13:15,934 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2021-06-12 15:13:17,982 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2021-06-12 15:13:23,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 15:13:23,169 INFO L93 Difference]: Finished difference Result 14565 states and 37492 transitions. [2021-06-12 15:13:23,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2021-06-12 15:13:23,170 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-12 15:13:23,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 15:13:23,184 INFO L225 Difference]: With dead ends: 14565 [2021-06-12 15:13:23,184 INFO L226 Difference]: Without dead ends: 14145 [2021-06-12 15:13:23,185 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4547 ImplicationChecksByTransitivity, 12471.6ms TimeCoverageRelationStatistics Valid=1611, Invalid=15159, Unknown=0, NotChecked=0, Total=16770 [2021-06-12 15:13:23,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14145 states. [2021-06-12 15:13:23,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14145 to 9863. [2021-06-12 15:13:23,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9863 states, 9861 states have (on average 2.563938748605618) internal successors, (25283), 9862 states have internal predecessors, (25283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 15:13:23,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9863 states to 9863 states and 25283 transitions. [2021-06-12 15:13:23,302 INFO L78 Accepts]: Start accepts. Automaton has 9863 states and 25283 transitions. Word has length 184 [2021-06-12 15:13:23,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 15:13:23,302 INFO L482 AbstractCegarLoop]: Abstraction has 9863 states and 25283 transitions. [2021-06-12 15:13:23,302 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-12 15:13:23,302 INFO L276 IsEmpty]: Start isEmpty. Operand 9863 states and 25283 transitions. [2021-06-12 15:13:23,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-12 15:13:23,309 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 15:13:23,309 INFO L472 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-12 15:13:23,309 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-06-12 15:13:23,309 INFO L430 AbstractCegarLoop]: === Iteration 22 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 15:13:23,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 15:13:23,309 INFO L82 PathProgramCache]: Analyzing trace with hash 317652773, now seen corresponding path program 13 times [2021-06-12 15:13:23,310 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 15:13:23,310 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780749017] [2021-06-12 15:13:23,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 15:13:23,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 15:13:23,989 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-12 15:13:24,150 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-12 15:13:27,565 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-12 15:13:27,565 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 15:13:27,565 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780749017] [2021-06-12 15:13:27,565 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780749017] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 15:13:27,565 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 15:13:27,566 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-12 15:13:27,566 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644577417] [2021-06-12 15:13:27,566 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-12 15:13:27,566 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 15:13:27,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-12 15:13:27,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=2559, Unknown=0, NotChecked=0, Total=2756 [2021-06-12 15:13:27,567 INFO L87 Difference]: Start difference. First operand 9863 states and 25283 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-12 15:13:29,400 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 52 [2021-06-12 15:13:29,745 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 55 [2021-06-12 15:13:30,062 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 57 [2021-06-12 15:13:30,575 WARN L205 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 82 [2021-06-12 15:13:31,059 WARN L205 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 80 [2021-06-12 15:13:34,103 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2021-06-12 15:13:35,862 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2021-06-12 15:13:40,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 15:13:40,803 INFO L93 Difference]: Finished difference Result 14085 states and 36272 transitions. [2021-06-12 15:13:40,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2021-06-12 15:13:40,804 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-12 15:13:40,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 15:13:40,816 INFO L225 Difference]: With dead ends: 14085 [2021-06-12 15:13:40,816 INFO L226 Difference]: Without dead ends: 13665 [2021-06-12 15:13:40,817 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4382 ImplicationChecksByTransitivity, 12213.3ms TimeCoverageRelationStatistics Valid=1559, Invalid=14697, Unknown=0, NotChecked=0, Total=16256 [2021-06-12 15:13:40,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13665 states. [2021-06-12 15:13:40,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13665 to 9876. [2021-06-12 15:13:40,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9876 states, 9874 states have (on average 2.56410775774762) internal successors, (25318), 9875 states have internal predecessors, (25318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 15:13:40,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9876 states to 9876 states and 25318 transitions. [2021-06-12 15:13:40,933 INFO L78 Accepts]: Start accepts. Automaton has 9876 states and 25318 transitions. Word has length 184 [2021-06-12 15:13:40,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 15:13:40,933 INFO L482 AbstractCegarLoop]: Abstraction has 9876 states and 25318 transitions. [2021-06-12 15:13:40,933 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-12 15:13:40,933 INFO L276 IsEmpty]: Start isEmpty. Operand 9876 states and 25318 transitions. [2021-06-12 15:13:40,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-12 15:13:40,941 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 15:13:40,941 INFO L472 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-12 15:13:40,942 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-06-12 15:13:40,942 INFO L430 AbstractCegarLoop]: === Iteration 23 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 15:13:40,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 15:13:40,942 INFO L82 PathProgramCache]: Analyzing trace with hash 421691335, now seen corresponding path program 14 times [2021-06-12 15:13:40,942 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 15:13:40,942 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621789248] [2021-06-12 15:13:40,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 15:13:40,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 15:13:41,532 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-06-12 15:13:41,718 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-12 15:13:41,887 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-12 15:13:45,249 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-12 15:13:45,250 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 15:13:45,250 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621789248] [2021-06-12 15:13:45,250 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621789248] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 15:13:45,250 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 15:13:45,250 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-12 15:13:45,250 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903645663] [2021-06-12 15:13:45,250 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-12 15:13:45,250 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 15:13:45,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-12 15:13:45,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=2554, Unknown=0, NotChecked=0, Total=2756 [2021-06-12 15:13:45,251 INFO L87 Difference]: Start difference. First operand 9876 states and 25318 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-12 15:13:46,960 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 52 [2021-06-12 15:13:47,228 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 55 [2021-06-12 15:13:47,572 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 57 [2021-06-12 15:13:48,084 WARN L205 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 82 [2021-06-12 15:13:48,632 WARN L205 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 80 [2021-06-12 15:13:51,069 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-06-12 15:13:54,097 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2021-06-12 15:13:59,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 15:13:59,222 INFO L93 Difference]: Finished difference Result 15042 states and 38753 transitions. [2021-06-12 15:13:59,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2021-06-12 15:13:59,223 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-12 15:13:59,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 15:13:59,243 INFO L225 Difference]: With dead ends: 15042 [2021-06-12 15:13:59,243 INFO L226 Difference]: Without dead ends: 14622 [2021-06-12 15:13:59,244 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4626 ImplicationChecksByTransitivity, 12368.5ms TimeCoverageRelationStatistics Valid=1630, Invalid=15400, Unknown=0, NotChecked=0, Total=17030 [2021-06-12 15:13:59,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14622 states. [2021-06-12 15:13:59,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14622 to 10006. [2021-06-12 15:13:59,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10006 states, 10004 states have (on average 2.567073170731707) internal successors, (25681), 10005 states have internal predecessors, (25681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 15:13:59,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10006 states to 10006 states and 25681 transitions. [2021-06-12 15:13:59,397 INFO L78 Accepts]: Start accepts. Automaton has 10006 states and 25681 transitions. Word has length 184 [2021-06-12 15:13:59,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 15:13:59,397 INFO L482 AbstractCegarLoop]: Abstraction has 10006 states and 25681 transitions. [2021-06-12 15:13:59,398 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-12 15:13:59,398 INFO L276 IsEmpty]: Start isEmpty. Operand 10006 states and 25681 transitions. [2021-06-12 15:13:59,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-12 15:13:59,405 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 15:13:59,406 INFO L472 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-12 15:13:59,406 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-06-12 15:13:59,406 INFO L430 AbstractCegarLoop]: === Iteration 24 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 15:13:59,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 15:13:59,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1697699831, now seen corresponding path program 15 times [2021-06-12 15:13:59,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 15:13:59,406 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170773355] [2021-06-12 15:13:59,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 15:13:59,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 15:13:59,982 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-06-12 15:14:00,133 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-12 15:14:00,305 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-12 15:14:01,406 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-12 15:14:03,669 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-12 15:14:03,670 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 15:14:03,670 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170773355] [2021-06-12 15:14:03,670 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170773355] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 15:14:03,670 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 15:14:03,670 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-12 15:14:03,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736636479] [2021-06-12 15:14:03,670 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-12 15:14:03,670 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 15:14:03,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-12 15:14:03,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2555, Unknown=0, NotChecked=0, Total=2756 [2021-06-12 15:14:03,671 INFO L87 Difference]: Start difference. First operand 10006 states and 25681 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-12 15:14:05,511 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 52 [2021-06-12 15:14:05,802 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 55 [2021-06-12 15:14:06,186 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 57 [2021-06-12 15:14:06,770 WARN L205 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 82 [2021-06-12 15:14:07,393 WARN L205 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 80 [2021-06-12 15:14:10,272 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-06-12 15:14:13,646 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2021-06-12 15:14:19,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 15:14:19,019 INFO L93 Difference]: Finished difference Result 16996 states and 43767 transitions. [2021-06-12 15:14:19,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2021-06-12 15:14:19,020 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-12 15:14:19,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 15:14:19,037 INFO L225 Difference]: With dead ends: 16996 [2021-06-12 15:14:19,037 INFO L226 Difference]: Without dead ends: 16576 [2021-06-12 15:14:19,039 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4803 ImplicationChecksByTransitivity, 12909.8ms TimeCoverageRelationStatistics Valid=1667, Invalid=15889, Unknown=0, NotChecked=0, Total=17556 [2021-06-12 15:14:19,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16576 states. [2021-06-12 15:14:19,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16576 to 10110. [2021-06-12 15:14:19,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10110 states, 10108 states have (on average 2.569647803719826) internal successors, (25974), 10109 states have internal predecessors, (25974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 15:14:19,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10110 states to 10110 states and 25974 transitions. [2021-06-12 15:14:19,218 INFO L78 Accepts]: Start accepts. Automaton has 10110 states and 25974 transitions. Word has length 184 [2021-06-12 15:14:19,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 15:14:19,218 INFO L482 AbstractCegarLoop]: Abstraction has 10110 states and 25974 transitions. [2021-06-12 15:14:19,218 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-12 15:14:19,218 INFO L276 IsEmpty]: Start isEmpty. Operand 10110 states and 25974 transitions. [2021-06-12 15:14:19,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-12 15:14:19,225 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 15:14:19,225 INFO L472 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-12 15:14:19,225 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-06-12 15:14:19,226 INFO L430 AbstractCegarLoop]: === Iteration 25 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 15:14:19,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 15:14:19,227 INFO L82 PathProgramCache]: Analyzing trace with hash 769432839, now seen corresponding path program 16 times [2021-06-12 15:14:19,228 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 15:14:19,228 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598478533] [2021-06-12 15:14:19,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 15:14:19,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 15:14:19,744 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-06-12 15:14:19,882 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-12 15:14:20,046 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-12 15:14:23,231 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-12 15:14:23,231 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 15:14:23,231 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598478533] [2021-06-12 15:14:23,231 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598478533] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 15:14:23,231 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 15:14:23,231 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-12 15:14:23,231 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075564355] [2021-06-12 15:14:23,231 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-12 15:14:23,232 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 15:14:23,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-12 15:14:23,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=2558, Unknown=0, NotChecked=0, Total=2756 [2021-06-12 15:14:23,232 INFO L87 Difference]: Start difference. First operand 10110 states and 25974 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-12 15:14:25,342 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 52 [2021-06-12 15:14:25,682 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 55 [2021-06-12 15:14:26,081 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 57 [2021-06-12 15:14:26,742 WARN L205 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 82 [2021-06-12 15:14:27,486 WARN L205 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 80 [2021-06-12 15:14:30,024 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-06-12 15:14:33,910 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2021-06-12 15:14:36,972 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2021-06-12 15:14:39,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 15:14:39,709 INFO L93 Difference]: Finished difference Result 16908 states and 43553 transitions. [2021-06-12 15:14:39,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2021-06-12 15:14:39,709 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-12 15:14:39,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 15:14:39,726 INFO L225 Difference]: With dead ends: 16908 [2021-06-12 15:14:39,726 INFO L226 Difference]: Without dead ends: 16488 [2021-06-12 15:14:39,727 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4885 ImplicationChecksByTransitivity, 13304.6ms TimeCoverageRelationStatistics Valid=1681, Invalid=16141, Unknown=0, NotChecked=0, Total=17822 [2021-06-12 15:14:39,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16488 states. [2021-06-12 15:14:39,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16488 to 10149. [2021-06-12 15:14:39,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10149 states, 10147 states have (on average 2.570119247068099) internal successors, (26079), 10148 states have internal predecessors, (26079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 15:14:39,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10149 states to 10149 states and 26079 transitions. [2021-06-12 15:14:39,865 INFO L78 Accepts]: Start accepts. Automaton has 10149 states and 26079 transitions. Word has length 184 [2021-06-12 15:14:39,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 15:14:39,865 INFO L482 AbstractCegarLoop]: Abstraction has 10149 states and 26079 transitions. [2021-06-12 15:14:39,865 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-12 15:14:39,866 INFO L276 IsEmpty]: Start isEmpty. Operand 10149 states and 26079 transitions. [2021-06-12 15:14:39,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-12 15:14:39,873 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 15:14:39,873 INFO L472 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-12 15:14:39,873 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-06-12 15:14:39,874 INFO L430 AbstractCegarLoop]: === Iteration 26 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 15:14:39,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 15:14:39,874 INFO L82 PathProgramCache]: Analyzing trace with hash 495114213, now seen corresponding path program 17 times [2021-06-12 15:14:39,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 15:14:39,874 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37107569] [2021-06-12 15:14:39,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 15:14:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 15:14:40,446 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-06-12 15:14:40,593 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-12 15:14:40,763 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-12 15:14:44,244 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-12 15:14:44,244 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 15:14:44,244 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37107569] [2021-06-12 15:14:44,244 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37107569] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 15:14:44,244 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 15:14:44,245 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-12 15:14:44,245 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970781441] [2021-06-12 15:14:44,245 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-12 15:14:44,245 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 15:14:44,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-12 15:14:44,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=2560, Unknown=0, NotChecked=0, Total=2756 [2021-06-12 15:14:44,246 INFO L87 Difference]: Start difference. First operand 10149 states and 26079 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-12 15:14:46,161 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 52 [2021-06-12 15:14:46,426 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 55 [2021-06-12 15:14:46,725 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 57 [2021-06-12 15:14:47,213 WARN L205 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 82 [2021-06-12 15:14:47,689 WARN L205 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 80 [2021-06-12 15:14:50,294 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-06-12 15:14:54,208 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 71 [2021-06-12 15:14:54,460 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2021-06-12 15:14:59,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 15:14:59,831 INFO L93 Difference]: Finished difference Result 16868 states and 43463 transitions. [2021-06-12 15:14:59,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2021-06-12 15:14:59,832 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-12 15:14:59,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 15:14:59,848 INFO L225 Difference]: With dead ends: 16868 [2021-06-12 15:14:59,848 INFO L226 Difference]: Without dead ends: 16448 [2021-06-12 15:14:59,849 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4972 ImplicationChecksByTransitivity, 13028.3ms TimeCoverageRelationStatistics Valid=1698, Invalid=16392, Unknown=0, NotChecked=0, Total=18090 [2021-06-12 15:14:59,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16448 states. [2021-06-12 15:14:59,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16448 to 10175. [2021-06-12 15:14:59,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10175 states, 10173 states have (on average 2.5704315344539466) internal successors, (26149), 10174 states have internal predecessors, (26149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 15:14:59,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10175 states to 10175 states and 26149 transitions. [2021-06-12 15:14:59,983 INFO L78 Accepts]: Start accepts. Automaton has 10175 states and 26149 transitions. Word has length 184 [2021-06-12 15:14:59,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 15:14:59,983 INFO L482 AbstractCegarLoop]: Abstraction has 10175 states and 26149 transitions. [2021-06-12 15:14:59,983 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-12 15:14:59,983 INFO L276 IsEmpty]: Start isEmpty. Operand 10175 states and 26149 transitions. [2021-06-12 15:14:59,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-12 15:14:59,991 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 15:14:59,991 INFO L472 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-12 15:14:59,991 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-06-12 15:14:59,992 INFO L430 AbstractCegarLoop]: === Iteration 27 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 15:14:59,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 15:14:59,992 INFO L82 PathProgramCache]: Analyzing trace with hash 956827493, now seen corresponding path program 18 times [2021-06-12 15:14:59,992 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 15:14:59,992 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752580576] [2021-06-12 15:14:59,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 15:15:00,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 15:15:00,544 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-06-12 15:15:00,694 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-12 15:15:00,865 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-12 15:15:01,636 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-12 15:15:04,072 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-12 15:15:04,073 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 15:15:04,073 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752580576] [2021-06-12 15:15:04,073 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752580576] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 15:15:04,073 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 15:15:04,073 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-12 15:15:04,073 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949151503] [2021-06-12 15:15:04,073 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-12 15:15:04,073 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 15:15:04,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-12 15:15:04,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=2568, Unknown=0, NotChecked=0, Total=2756 [2021-06-12 15:15:04,074 INFO L87 Difference]: Start difference. First operand 10175 states and 26149 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-12 15:15:06,145 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 52 [2021-06-12 15:15:06,527 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 55 [2021-06-12 15:15:06,935 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 57 [2021-06-12 15:15:07,602 WARN L205 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 81 [2021-06-12 15:15:08,278 WARN L205 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 79 [2021-06-12 15:15:10,998 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2021-06-12 15:15:17,001 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2021-06-12 15:15:18,098 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2021-06-12 15:15:19,192 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 71 [2021-06-12 15:15:20,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 15:15:20,722 INFO L93 Difference]: Finished difference Result 16890 states and 43523 transitions. [2021-06-12 15:15:20,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2021-06-12 15:15:20,722 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-12 15:15:20,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 15:15:20,737 INFO L225 Difference]: With dead ends: 16890 [2021-06-12 15:15:20,737 INFO L226 Difference]: Without dead ends: 16470 [2021-06-12 15:15:20,738 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 19 SyntacticMatches, 5 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5172 ImplicationChecksByTransitivity, 13598.3ms TimeCoverageRelationStatistics Valid=1730, Invalid=17176, Unknown=0, NotChecked=0, Total=18906 [2021-06-12 15:15:20,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16470 states. [2021-06-12 15:15:20,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16470 to 10188. [2021-06-12 15:15:20,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10188 states, 10186 states have (on average 2.5705870803063027) internal successors, (26184), 10187 states have internal predecessors, (26184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 15:15:20,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10188 states to 10188 states and 26184 transitions. [2021-06-12 15:15:20,866 INFO L78 Accepts]: Start accepts. Automaton has 10188 states and 26184 transitions. Word has length 184 [2021-06-12 15:15:20,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 15:15:20,866 INFO L482 AbstractCegarLoop]: Abstraction has 10188 states and 26184 transitions. [2021-06-12 15:15:20,866 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-12 15:15:20,866 INFO L276 IsEmpty]: Start isEmpty. Operand 10188 states and 26184 transitions. [2021-06-12 15:15:20,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-12 15:15:20,874 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 15:15:20,874 INFO L472 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-12 15:15:20,874 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-06-12 15:15:20,874 INFO L430 AbstractCegarLoop]: === Iteration 28 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 15:15:20,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 15:15:20,874 INFO L82 PathProgramCache]: Analyzing trace with hash 913127371, now seen corresponding path program 19 times [2021-06-12 15:15:20,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 15:15:20,874 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086796283] [2021-06-12 15:15:20,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 15:15:20,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 15:15:21,444 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-06-12 15:15:21,584 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-12 15:15:21,756 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-12 15:15:25,002 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-12 15:15:25,002 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 15:15:25,002 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086796283] [2021-06-12 15:15:25,002 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086796283] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 15:15:25,002 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 15:15:25,002 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-12 15:15:25,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435107415] [2021-06-12 15:15:25,003 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-12 15:15:25,003 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 15:15:25,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-12 15:15:25,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2566, Unknown=0, NotChecked=0, Total=2756 [2021-06-12 15:15:25,004 INFO L87 Difference]: Start difference. First operand 10188 states and 26184 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-12 15:15:27,208 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 52 [2021-06-12 15:15:27,457 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 55 [2021-06-12 15:15:27,742 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 57 [2021-06-12 15:15:28,241 WARN L205 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 82 [2021-06-12 15:15:28,743 WARN L205 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 80 [2021-06-12 15:15:31,261 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-06-12 15:15:34,216 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 81 [2021-06-12 15:15:35,951 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2021-06-12 15:15:41,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 15:15:41,703 INFO L93 Difference]: Finished difference Result 18020 states and 46463 transitions. [2021-06-12 15:15:41,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2021-06-12 15:15:41,704 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-12 15:15:41,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 15:15:41,724 INFO L225 Difference]: With dead ends: 18020 [2021-06-12 15:15:41,724 INFO L226 Difference]: Without dead ends: 17600 [2021-06-12 15:15:41,726 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5236 ImplicationChecksByTransitivity, 13268.3ms TimeCoverageRelationStatistics Valid=1758, Invalid=17148, Unknown=0, NotChecked=0, Total=18906 [2021-06-12 15:15:41,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17600 states. [2021-06-12 15:15:41,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17600 to 10500. [2021-06-12 15:15:41,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10500 states, 10498 states have (on average 2.5742046104019813) internal successors, (27024), 10499 states have internal predecessors, (27024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 15:15:41,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10500 states to 10500 states and 27024 transitions. [2021-06-12 15:15:41,866 INFO L78 Accepts]: Start accepts. Automaton has 10500 states and 27024 transitions. Word has length 184 [2021-06-12 15:15:41,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 15:15:41,866 INFO L482 AbstractCegarLoop]: Abstraction has 10500 states and 27024 transitions. [2021-06-12 15:15:41,866 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-12 15:15:41,866 INFO L276 IsEmpty]: Start isEmpty. Operand 10500 states and 27024 transitions. [2021-06-12 15:15:41,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-12 15:15:41,873 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 15:15:41,874 INFO L472 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-12 15:15:41,874 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-06-12 15:15:41,874 INFO L430 AbstractCegarLoop]: === Iteration 29 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 15:15:41,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 15:15:41,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1490581689, now seen corresponding path program 20 times [2021-06-12 15:15:41,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 15:15:41,874 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97192355] [2021-06-12 15:15:41,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 15:15:41,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 15:15:42,420 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-06-12 15:15:42,580 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-12 15:15:42,753 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-12 15:15:46,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 15:15:46,169 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 15:15:46,169 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97192355] [2021-06-12 15:15:46,169 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97192355] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 15:15:46,169 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 15:15:46,169 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-12 15:15:46,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081470323] [2021-06-12 15:15:46,169 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-12 15:15:46,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 15:15:46,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-12 15:15:46,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2555, Unknown=0, NotChecked=0, Total=2756 [2021-06-12 15:15:46,170 INFO L87 Difference]: Start difference. First operand 10500 states and 27024 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-12 15:15:48,051 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 52 [2021-06-12 15:15:48,338 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 55 [2021-06-12 15:15:48,728 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 57 [2021-06-12 15:15:49,343 WARN L205 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 82 [2021-06-12 15:15:49,936 WARN L205 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 80 [2021-06-12 15:15:52,777 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-06-12 15:15:53,781 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2021-06-12 15:15:55,949 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2021-06-12 15:16:01,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 15:16:01,463 INFO L93 Difference]: Finished difference Result 15114 states and 39033 transitions. [2021-06-12 15:16:01,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2021-06-12 15:16:01,463 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-12 15:16:01,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 15:16:01,482 INFO L225 Difference]: With dead ends: 15114 [2021-06-12 15:16:01,482 INFO L226 Difference]: Without dead ends: 14694 [2021-06-12 15:16:01,484 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4715 ImplicationChecksByTransitivity, 12975.3ms TimeCoverageRelationStatistics Valid=1646, Invalid=15646, Unknown=0, NotChecked=0, Total=17292 [2021-06-12 15:16:01,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14694 states. [2021-06-12 15:16:01,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14694 to 10500. [2021-06-12 15:16:01,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10500 states, 10498 states have (on average 2.5742046104019813) internal successors, (27024), 10499 states have internal predecessors, (27024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 15:16:01,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10500 states to 10500 states and 27024 transitions. [2021-06-12 15:16:01,617 INFO L78 Accepts]: Start accepts. Automaton has 10500 states and 27024 transitions. Word has length 184 [2021-06-12 15:16:01,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 15:16:01,617 INFO L482 AbstractCegarLoop]: Abstraction has 10500 states and 27024 transitions. [2021-06-12 15:16:01,617 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-12 15:16:01,617 INFO L276 IsEmpty]: Start isEmpty. Operand 10500 states and 27024 transitions. [2021-06-12 15:16:01,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-12 15:16:01,625 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 15:16:01,625 INFO L472 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-12 15:16:01,625 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-06-12 15:16:01,625 INFO L430 AbstractCegarLoop]: === Iteration 30 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 15:16:01,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 15:16:01,625 INFO L82 PathProgramCache]: Analyzing trace with hash 473197579, now seen corresponding path program 21 times [2021-06-12 15:16:01,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 15:16:01,626 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336463801] [2021-06-12 15:16:01,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 15:16:01,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2021-06-12 15:20:37,448 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-12 15:20:37,452 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-12 15:20:37,453 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-12 15:20:37,454 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-12 15:20:37,455 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-12 15:20:37,456 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-12 15:20:37,457 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-12 15:20:37,458 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-12 15:20:37,459 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-12 15:20:37,459 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-12 15:20:37,460 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-12 15:20:37,461 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-12 15:20:37,462 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-12 15:20:37,462 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-12 15:20:37,463 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-12 15:20:37,464 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-12 15:20:37,465 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-12 15:20:37,465 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-12 15:20:37,465 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-12 15:20:37,466 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-12 15:20:37,466 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-12 15:20:37,467 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-12 15:20:37,467 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-12 15:20:37,467 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-12 15:20:37,468 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-12 15:20:37,468 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-12 15:20:37,468 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-12 15:20:37,469 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-12 15:20:37,469 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-12 15:20:37,469 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-12 15:20:37,470 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-12 15:20:37,480 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-12 15:20:37,481 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-12 15:20:37,481 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-12 15:20:37,481 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-12 15:20:37,482 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-12 15:20:37,482 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-12 15:20:37,482 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-12 15:20:37,482 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-12 15:20:37,483 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-12 15:20:37,483 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-12 15:20:37,483 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-12 15:20:37,483 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-12 15:20:37,483 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-12 15:20:37,483 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-12 15:20:37,486 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-06-12 15:20:37,486 WARN L547 AbstractCegarLoop]: Verification canceled [2021-06-12 15:20:37,486 INFO L301 ceAbstractionStarter]: Result for error location t2Thread1of1ForFork1 was TIMEOUT (3/5) [2021-06-12 15:20:37,487 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-12 15:20:37,487 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-12 15:20:37,487 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-12 15:20:37,487 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-12 15:20:37,487 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-12 15:20:37,487 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-12 15:20:37,487 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-12 15:20:37,487 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-12 15:20:37,487 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == t1======== [2021-06-12 15:20:37,491 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 247 places, 257 transitions, 536 flow [2021-06-12 15:20:37,492 WARN L547 AbstractCegarLoop]: Verification canceled [2021-06-12 15:20:37,492 INFO L301 ceAbstractionStarter]: Result for error location t1 was TIMEOUT (4/5) [2021-06-12 15:20:37,493 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-12 15:20:37,493 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-12 15:20:37,493 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-12 15:20:37,494 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-12 15:20:37,494 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-12 15:20:37,494 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-12 15:20:37,494 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-12 15:20:37,494 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-12 15:20:37,494 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == t2======== [2021-06-12 15:20:37,495 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 247 places, 257 transitions, 536 flow [2021-06-12 15:20:37,495 WARN L547 AbstractCegarLoop]: Verification canceled [2021-06-12 15:20:37,496 INFO L301 ceAbstractionStarter]: Result for error location t2 was TIMEOUT (5/5) [2021-06-12 15:20:37,496 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-12 15:20:37,498 WARN L196 ceAbstractionStarter]: Timeout [2021-06-12 15:20:37,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.06 03:20:37 BasicIcfg [2021-06-12 15:20:37,498 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-12 15:20:37,499 INFO L168 Benchmark]: Toolchain (without parser) took 765357.98 ms. Allocated memory was 186.6 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 149.1 MB in the beginning and 941.4 MB in the end (delta: -792.3 MB). Peak memory consumption was 2.2 GB. Max. memory is 8.0 GB. [2021-06-12 15:20:37,499 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 186.6 MB. Free memory is still 167.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-06-12 15:20:37,499 INFO L168 Benchmark]: CACSL2BoogieTranslator took 632.49 ms. Allocated memory is still 186.6 MB. Free memory was 148.9 MB in the beginning and 122.6 MB in the end (delta: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 8.0 GB. [2021-06-12 15:20:37,499 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.13 ms. Allocated memory is still 186.6 MB. Free memory was 122.6 MB in the beginning and 119.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-06-12 15:20:37,499 INFO L168 Benchmark]: Boogie Preprocessor took 30.78 ms. Allocated memory is still 186.6 MB. Free memory was 119.5 MB in the beginning and 117.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-06-12 15:20:37,499 INFO L168 Benchmark]: RCFGBuilder took 633.76 ms. Allocated memory is still 186.6 MB. Free memory was 117.4 MB in the beginning and 69.7 MB in the end (delta: 47.7 MB). Peak memory consumption was 47.2 MB. Max. memory is 8.0 GB. [2021-06-12 15:20:37,499 INFO L168 Benchmark]: TraceAbstraction took 763989.30 ms. Allocated memory was 186.6 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 69.1 MB in the beginning and 941.4 MB in the end (delta: -872.3 MB). Peak memory consumption was 2.1 GB. Max. memory is 8.0 GB. [2021-06-12 15:20:37,500 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 186.6 MB. Free memory is still 167.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 632.49 ms. Allocated memory is still 186.6 MB. Free memory was 148.9 MB in the beginning and 122.6 MB in the end (delta: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 66.13 ms. Allocated memory is still 186.6 MB. Free memory was 122.6 MB in the beginning and 119.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 30.78 ms. Allocated memory is still 186.6 MB. Free memory was 119.5 MB in the beginning and 117.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 633.76 ms. Allocated memory is still 186.6 MB. Free memory was 117.4 MB in the beginning and 69.7 MB in the end (delta: 47.7 MB). Peak memory consumption was 47.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 763989.30 ms. Allocated memory was 186.6 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 69.1 MB in the beginning and 941.4 MB in the end (delta: -872.3 MB). Peak memory consumption was 2.1 GB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1032]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing initial abstraction,while PetriNet2FiniteAutomaton was constructing automaton for Petri net that has has 247 places, 257 transitions, 536 flow. Already constructed 2 states. Currently 1 states in worklist.. - PositiveResult [Line: 1059]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was analyzing trace of length 185 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 183 interpolants. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t1Thread1of1ForFork0 with 1 thread instances CFG has 5 procedures, 402 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 24217.6ms, OverallIterations: 11, TraceHistogramMax: 1, EmptinessCheckTime: 247.3ms, AutomataDifference: 13703.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1483.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 3197 SDtfs, 12031 SDslu, 24787 SDs, 0 SdLazy, 9133 SolverSat, 607 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4370.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 329 GetRequests, 34 SyntacticMatches, 8 SemanticMatches, 287 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2322 ImplicationChecksByTransitivity, 9340.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=23654occurred in iteration=0, InterpolantAutomatonStates: 167, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 3855.4ms AutomataMinimizationTime, 11 MinimizatonAttempts, 9458 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 49.0ms SsaConstructionTime, 316.7ms SatisfiabilityAnalysisTime, 4295.7ms InterpolantComputationTime, 1166 NumberOfCodeBlocks, 1166 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1155 ConstructedInterpolants, 0 QuantifiedInterpolants, 10984 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 402 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1074.1ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 30.7ms, AutomataDifference: 126.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 900.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 244 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=23654occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 0.3ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.2ms SsaConstructionTime, 3.3ms SatisfiabilityAnalysisTime, 6.7ms InterpolantComputationTime, 48 NumberOfCodeBlocks, 48 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 47 ConstructedInterpolants, 0 QuantifiedInterpolants, 47 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t2Thread1of1ForFork1 with 1 thread instances CFG has 5 procedures, 402 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 738423.4ms, OverallIterations: 30, TraceHistogramMax: 1, EmptinessCheckTime: 266.1ms, AutomataDifference: 362286.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 787.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 12521 SDtfs, 72856 SDslu, 292210 SDs, 0 SdLazy, 145096 SolverSat, 3800 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 118770.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3605 GetRequests, 518 SyntacticMatches, 123 SemanticMatches, 2964 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101689 ImplicationChecksByTransitivity, 309433.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=23654occurred in iteration=0, InterpolantAutomatonStates: 1871, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 4138.6ms AutomataMinimizationTime, 29 MinimizatonAttempts, 101877 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 80.3ms SsaConstructionTime, 700.6ms SatisfiabilityAnalysisTime, 94036.6ms InterpolantComputationTime, 5088 NumberOfCodeBlocks, 5088 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 5059 ConstructedInterpolants, 0 QuantifiedInterpolants, 378503 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t1 with 1 thread instances CFG has 5 procedures, 402 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 4.8ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 4.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t2 with 1 thread instances CFG has 5 procedures, 402 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 2.1ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown