/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_longest.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2abb09bbbae98a04ae2fcc735832bfdba44f6fbc-2abb09b [2021-06-05 18:05:52,649 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 18:05:52,652 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 18:05:52,692 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 18:05:52,692 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 18:05:52,696 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 18:05:52,698 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 18:05:52,705 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 18:05:52,707 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 18:05:52,712 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 18:05:52,713 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 18:05:52,713 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 18:05:52,714 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 18:05:52,714 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 18:05:52,715 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 18:05:52,716 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 18:05:52,716 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 18:05:52,717 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 18:05:52,718 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 18:05:52,719 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 18:05:52,722 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 18:05:52,723 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 18:05:52,726 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 18:05:52,729 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 18:05:52,736 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 18:05:52,736 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 18:05:52,737 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 18:05:52,738 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 18:05:52,738 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 18:05:52,739 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 18:05:52,739 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 18:05:52,740 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 18:05:52,741 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 18:05:52,742 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 18:05:52,743 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 18:05:52,743 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 18:05:52,743 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 18:05:52,743 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 18:05:52,743 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 18:05:52,744 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 18:05:52,745 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 18:05:52,748 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-05 18:05:52,781 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 18:05:52,782 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 18:05:52,782 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 18:05:52,782 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 18:05:52,785 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 18:05:52,785 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 18:05:52,785 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 18:05:52,785 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 18:05:52,785 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 18:05:52,785 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 18:05:52,786 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 18:05:52,786 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 18:05:52,786 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 18:05:52,786 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 18:05:52,787 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 18:05:52,787 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 18:05:52,787 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 18:05:52,787 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 18:05:52,787 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 18:05:52,787 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 18:05:52,787 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 18:05:52,787 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 18:05:52,788 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 18:05:52,788 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 18:05:52,788 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 18:05:52,788 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 18:05:52,788 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 18:05:52,788 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 18:05:52,788 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 18:05:52,788 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 18:05:52,789 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 18:05:52,789 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-05 18:05:53,053 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 18:05:53,071 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 18:05:53,073 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 18:05:53,074 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-05 18:05:53,075 INFO L275 PluginConnector]: CDTParser initialized [2021-06-05 18:05:53,075 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_longest.i [2021-06-05 18:05:53,142 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fade30c7/cb44b1dce1f64407ada396bf16916a99/FLAG8614745bd [2021-06-05 18:05:53,707 INFO L306 CDTParser]: Found 1 translation units. [2021-06-05 18:05:53,708 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i [2021-06-05 18:05:53,727 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fade30c7/cb44b1dce1f64407ada396bf16916a99/FLAG8614745bd [2021-06-05 18:05:54,139 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fade30c7/cb44b1dce1f64407ada396bf16916a99 [2021-06-05 18:05:54,141 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 18:05:54,143 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-05 18:05:54,156 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-05 18:05:54,156 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-05 18:05:54,158 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-05 18:05:54,159 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 06:05:54" (1/1) ... [2021-06-05 18:05:54,161 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bd0305 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 06:05:54, skipping insertion in model container [2021-06-05 18:05:54,161 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 06:05:54" (1/1) ... [2021-06-05 18:05:54,166 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-05 18:05:54,213 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-05 18:05:54,538 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_longest.i[43296,43309] [2021-06-05 18:05:54,542 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_longest.i[43503,43516] [2021-06-05 18:05:54,544 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_longest.i[43783,43796] [2021-06-05 18:05:54,546 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 18:05:54,554 INFO L203 MainTranslator]: Completed pre-run [2021-06-05 18:05:54,586 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_longest.i[43296,43309] [2021-06-05 18:05:54,588 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_longest.i[43503,43516] [2021-06-05 18:05:54,590 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_longest.i[43783,43796] [2021-06-05 18:05:54,591 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 18:05:54,697 INFO L208 MainTranslator]: Completed translation [2021-06-05 18:05:54,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 06:05:54 WrapperNode [2021-06-05 18:05:54,697 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-05 18:05:54,698 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 18:05:54,698 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 18:05:54,699 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 18:05:54,704 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 06:05:54" (1/1) ... [2021-06-05 18:05:54,728 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 06:05:54" (1/1) ... [2021-06-05 18:05:54,770 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 18:05:54,771 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 18:05:54,772 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 18:05:54,772 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 18:05:54,778 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 06:05:54" (1/1) ... [2021-06-05 18:05:54,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 06:05:54" (1/1) ... [2021-06-05 18:05:54,795 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 06:05:54" (1/1) ... [2021-06-05 18:05:54,795 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 06:05:54" (1/1) ... [2021-06-05 18:05:54,804 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 06:05:54" (1/1) ... [2021-06-05 18:05:54,818 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 06:05:54" (1/1) ... [2021-06-05 18:05:54,825 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 06:05:54" (1/1) ... [2021-06-05 18:05:54,828 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 18:05:54,829 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 18:05:54,829 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 18:05:54,829 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 18:05:54,829 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 06:05:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 18:05:54,903 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2021-06-05 18:05:54,904 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2021-06-05 18:05:54,904 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2021-06-05 18:05:54,904 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2021-06-05 18:05:54,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-05 18:05:54,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-05 18:05:54,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-06-05 18:05:54,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-05 18:05:54,904 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-06-05 18:05:54,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-05 18:05:54,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 18:05:54,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 18:05:54,906 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-05 18:05:55,581 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 18:05:55,581 INFO L299 CfgBuilder]: Removed 18 assume(true) statements. [2021-06-05 18:05:55,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 06:05:55 BoogieIcfgContainer [2021-06-05 18:05:55,582 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 18:05:55,583 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 18:05:55,584 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 18:05:55,586 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 18:05:55,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.06 06:05:54" (1/3) ... [2021-06-05 18:05:55,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@472d0680 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 06:05:55, skipping insertion in model container [2021-06-05 18:05:55,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 06:05:54" (2/3) ... [2021-06-05 18:05:55,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@472d0680 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 06:05:55, skipping insertion in model container [2021-06-05 18:05:55,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 06:05:55" (3/3) ... [2021-06-05 18:05:55,588 INFO L111 eAbstractionObserver]: Analyzing ICFG queue_longest.i [2021-06-05 18:05:55,592 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 18:05:55,593 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 18:05:55,593 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2021-06-05 18:05:55,593 INFO L471 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 18:05:55,626 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,626 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,627 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,627 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,627 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,627 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,627 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,627 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,628 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,628 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,628 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,628 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,628 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,628 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,629 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,629 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,629 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,629 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,629 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,629 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,629 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,629 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,630 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,630 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,630 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,630 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,630 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,630 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,630 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,630 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,631 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,631 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,631 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,631 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,631 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,631 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,631 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,632 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,632 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,632 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,632 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,632 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,632 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,632 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,632 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,632 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,632 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,633 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,633 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,633 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,633 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,633 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,633 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,633 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,633 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,633 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,634 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,634 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,634 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,634 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,634 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,634 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,634 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,634 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,634 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,635 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,635 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,635 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,635 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,635 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,635 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,635 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,635 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,635 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,636 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,636 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,636 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,636 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,636 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,636 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,636 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,636 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,637 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,637 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,637 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,637 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,637 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,637 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,637 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,637 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,638 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,638 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,638 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,638 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,638 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,638 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,638 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,638 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,639 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,639 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,639 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,639 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,639 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,639 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,639 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,640 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,640 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,640 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,640 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,640 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,640 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,640 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,640 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,641 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,641 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,641 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,641 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,641 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,641 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,641 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,641 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,642 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,642 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,642 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,642 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,642 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,642 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,642 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,642 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,642 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,643 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,643 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,643 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,643 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,643 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,643 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,643 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,643 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,643 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,644 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,644 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,644 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,644 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,644 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,644 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,644 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,644 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,645 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,645 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,645 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,645 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,645 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,645 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,645 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,645 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,646 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,646 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,646 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,646 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,646 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,646 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,646 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,646 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,646 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,647 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,647 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,647 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,647 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,647 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,647 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,647 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,647 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,647 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,648 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,648 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,648 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,648 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,648 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,648 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,648 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,648 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,649 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,649 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,649 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,649 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,649 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,649 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,649 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,649 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,649 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,650 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,650 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,650 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,650 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,650 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,650 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,650 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,650 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,651 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,651 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,651 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,651 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,651 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,651 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,651 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,651 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,651 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,652 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,652 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,652 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,652 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,652 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,652 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,652 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,652 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,653 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,653 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,653 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,653 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,653 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,653 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,653 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,653 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,653 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,654 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,654 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,654 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,654 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,654 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,654 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,654 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,654 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,655 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,655 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,655 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,655 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,655 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,655 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,655 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,655 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,656 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,656 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,656 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,656 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,656 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,656 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,657 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,657 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,657 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,657 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,657 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,657 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,657 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,657 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,658 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,658 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,658 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,658 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,658 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,658 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,659 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,659 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,659 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,659 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,659 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,659 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,659 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,659 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,660 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,660 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,660 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,660 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,660 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,660 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,660 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,660 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,661 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,661 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,661 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,661 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,661 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,661 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,661 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,661 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,661 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,662 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,662 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,662 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,662 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,662 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,663 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,663 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,663 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,663 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,663 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,663 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,663 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,663 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,664 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,664 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,664 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,664 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,664 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,664 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,664 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,664 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,665 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,665 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,665 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,665 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,665 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,665 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,665 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,665 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,666 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,666 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,666 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,666 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,666 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,666 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,666 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,666 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,667 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,667 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,667 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,667 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,667 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,667 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,667 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,667 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,667 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,668 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,668 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,668 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,668 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,668 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,668 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,669 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,669 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,669 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,669 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,669 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,669 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,669 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,669 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,670 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,670 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,670 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,670 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,670 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,670 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,670 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,671 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,671 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,671 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,671 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,671 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,671 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,671 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,672 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,672 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,672 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,672 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,672 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,672 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,672 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,673 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,673 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,673 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,673 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,673 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,673 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,673 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,674 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,674 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,674 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,674 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,674 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,674 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,674 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,674 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,675 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,675 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,675 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,675 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,675 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,675 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,675 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,676 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,676 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,677 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,677 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,677 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,677 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,677 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,677 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,677 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,678 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,678 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,678 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,678 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,678 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,678 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,678 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,678 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,679 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,679 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,679 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,679 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,679 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,679 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,679 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,680 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,680 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,680 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,680 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,680 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,680 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,681 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,681 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,681 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,681 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,681 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,681 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,681 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,681 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,682 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,682 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,682 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,682 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,682 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,682 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,682 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,682 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,682 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,682 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,683 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,683 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,683 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,683 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,683 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,683 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,683 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,683 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,683 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,684 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,684 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,684 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,684 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,684 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,684 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,685 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,685 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,685 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,685 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,685 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,685 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,685 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,685 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,686 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,686 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,686 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,686 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,686 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,686 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,686 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,686 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,686 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,687 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,687 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,687 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,687 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,687 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,687 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,687 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,687 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,688 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,688 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,688 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,688 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,688 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,688 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,688 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,688 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,688 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,689 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,689 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,689 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,689 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,689 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,689 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,689 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,690 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,690 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,690 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,690 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,690 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,690 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,690 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,690 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,691 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,691 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,691 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,691 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,691 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,691 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,691 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,691 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,691 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,692 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,692 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,692 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,692 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,692 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,692 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,692 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,692 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,693 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,693 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,693 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,693 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,693 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,693 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,693 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,693 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,693 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,694 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,694 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,694 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,694 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,694 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,694 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,694 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,694 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,694 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,695 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,695 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,695 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,695 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,695 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,695 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,695 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,695 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,695 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,696 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,696 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,696 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,696 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,696 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,696 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,696 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,697 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,697 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,697 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,697 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,697 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,697 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,697 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,697 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,698 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,698 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,698 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,698 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,698 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,698 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,698 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,698 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,699 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,701 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,701 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,701 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,701 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,701 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,701 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,701 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,701 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,701 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,702 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,702 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,702 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,702 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,702 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,702 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,702 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,702 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,702 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,702 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,702 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,702 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,703 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,703 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,703 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,703 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,703 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,703 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,703 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,703 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,703 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,703 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,703 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,703 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,704 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,704 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,707 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,707 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,707 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,707 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,707 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,707 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,707 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,708 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,708 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,708 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,708 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,708 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,708 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,708 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,708 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,708 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,709 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,709 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,709 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,709 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,709 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,709 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:05:55,715 INFO L149 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2021-06-05 18:05:55,733 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 18:05:55,749 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 18:05:55,749 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 18:05:55,749 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 18:05:55,749 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 18:05:55,749 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 18:05:55,749 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 18:05:55,750 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 18:05:55,750 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == t1Thread1of1ForFork0======== [2021-06-05 18:05:55,761 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 247 places, 257 transitions, 536 flow [2021-06-05 18:05:56,727 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 23654 states, 23649 states have (on average 2.8479428305636603) internal successors, (67351), 23653 states have internal predecessors, (67351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:05:56,764 INFO L276 IsEmpty]: Start isEmpty. Operand has 23654 states, 23649 states have (on average 2.8479428305636603) internal successors, (67351), 23653 states have internal predecessors, (67351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:05:56,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-06-05 18:05:56,811 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:05:56,812 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:05:56,812 INFO L430 AbstractCegarLoop]: === Iteration 1 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:05:56,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:05:56,821 INFO L82 PathProgramCache]: Analyzing trace with hash -383819529, now seen corresponding path program 1 times [2021-06-05 18:05:56,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:05:56,829 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658977232] [2021-06-05 18:05:56,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:05:57,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:05:57,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:05:57,341 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:05:57,341 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658977232] [2021-06-05 18:05:57,342 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658977232] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:05:57,342 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:05:57,342 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-05 18:05:57,343 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031003411] [2021-06-05 18:05:57,346 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 18:05:57,346 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:05:57,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 18:05:57,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-06-05 18:05:57,398 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-05 18:05:58,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:05:58,165 INFO L93 Difference]: Finished difference Result 23003 states and 64256 transitions. [2021-06-05 18:05:58,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 18:05:58,167 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-06-05 18:05:58,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:05:58,237 INFO L225 Difference]: With dead ends: 23003 [2021-06-05 18:05:58,237 INFO L226 Difference]: Without dead ends: 12639 [2021-06-05 18:05:58,238 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 355.0ms TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420 [2021-06-05 18:05:58,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12639 states. [2021-06-05 18:05:58,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12639 to 12639. [2021-06-05 18:05:58,762 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-05 18:05:58,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12639 states to 12639 states and 35171 transitions. [2021-06-05 18:05:58,815 INFO L78 Accepts]: Start accepts. Automaton has 12639 states and 35171 transitions. Word has length 83 [2021-06-05 18:05:58,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:05:58,815 INFO L482 AbstractCegarLoop]: Abstraction has 12639 states and 35171 transitions. [2021-06-05 18:05:58,815 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:05:58,816 INFO L276 IsEmpty]: Start isEmpty. Operand 12639 states and 35171 transitions. [2021-06-05 18:05:58,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-06-05 18:05:58,824 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:05:58,824 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:05:58,825 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 18:05:58,825 INFO L430 AbstractCegarLoop]: === Iteration 2 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:05:58,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:05:58,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1409373696, now seen corresponding path program 1 times [2021-06-05 18:05:58,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:05:58,828 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587846584] [2021-06-05 18:05:58,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:05:58,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:05:58,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:05:58,955 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:05:58,955 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587846584] [2021-06-05 18:05:58,955 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587846584] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:05:58,955 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:05:58,955 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 18:05:58,955 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401481907] [2021-06-05 18:05:58,956 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 18:05:58,957 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:05:58,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 18:05:58,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 18:05:58,959 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-05 18:05:59,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:05:59,060 INFO L93 Difference]: Finished difference Result 12422 states and 34356 transitions. [2021-06-05 18:05:59,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 18:05:59,061 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-06-05 18:05:59,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:05:59,117 INFO L225 Difference]: With dead ends: 12422 [2021-06-05 18:05:59,117 INFO L226 Difference]: Without dead ends: 12422 [2021-06-05 18:05:59,118 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 18:05:59,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12422 states. [2021-06-05 18:05:59,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12422 to 12422. [2021-06-05 18:05:59,487 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-05 18:05:59,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12422 states to 12422 states and 34356 transitions. [2021-06-05 18:05:59,524 INFO L78 Accepts]: Start accepts. Automaton has 12422 states and 34356 transitions. Word has length 84 [2021-06-05 18:05:59,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:05:59,595 INFO L482 AbstractCegarLoop]: Abstraction has 12422 states and 34356 transitions. [2021-06-05 18:05:59,595 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:05:59,596 INFO L276 IsEmpty]: Start isEmpty. Operand 12422 states and 34356 transitions. [2021-06-05 18:05:59,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-06-05 18:05:59,611 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:05:59,612 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:05:59,612 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 18:05:59,612 INFO L430 AbstractCegarLoop]: === Iteration 3 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:05:59,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:05:59,612 INFO L82 PathProgramCache]: Analyzing trace with hash -477175304, now seen corresponding path program 1 times [2021-06-05 18:05:59,613 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:05:59,613 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149300954] [2021-06-05 18:05:59,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:05:59,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:05:59,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:05:59,661 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:05:59,661 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149300954] [2021-06-05 18:05:59,661 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149300954] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:05:59,661 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:05:59,661 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 18:05:59,662 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399335051] [2021-06-05 18:05:59,662 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 18:05:59,662 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:05:59,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 18:05:59,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 18:05:59,663 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-05 18:05:59,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:05:59,741 INFO L93 Difference]: Finished difference Result 13073 states and 35933 transitions. [2021-06-05 18:05:59,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 18:05:59,742 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2021-06-05 18:05:59,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:05:59,770 INFO L225 Difference]: With dead ends: 13073 [2021-06-05 18:05:59,770 INFO L226 Difference]: Without dead ends: 11771 [2021-06-05 18:05:59,770 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 18:05:59,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11771 states. [2021-06-05 18:06:00,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11771 to 11771. [2021-06-05 18:06:00,042 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-05 18:06:00,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11771 states to 11771 states and 32345 transitions. [2021-06-05 18:06:00,069 INFO L78 Accepts]: Start accepts. Automaton has 11771 states and 32345 transitions. Word has length 99 [2021-06-05 18:06:00,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:06:00,069 INFO L482 AbstractCegarLoop]: Abstraction has 11771 states and 32345 transitions. [2021-06-05 18:06:00,069 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:06:00,069 INFO L276 IsEmpty]: Start isEmpty. Operand 11771 states and 32345 transitions. [2021-06-05 18:06:00,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-06-05 18:06:00,083 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:06:00,083 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:06:00,084 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 18:06:00,084 INFO L430 AbstractCegarLoop]: === Iteration 4 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:06:00,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:06:00,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1731505684, now seen corresponding path program 1 times [2021-06-05 18:06:00,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:06:00,085 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708136190] [2021-06-05 18:06:00,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:06:00,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:06:00,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:06:00,458 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:06:00,458 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708136190] [2021-06-05 18:06:00,458 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708136190] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:06:00,458 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:06:00,458 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-06-05 18:06:00,458 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858592989] [2021-06-05 18:06:00,458 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 18:06:00,459 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:06:00,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 18:06:00,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2021-06-05 18:06:00,460 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-05 18:06:00,762 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 35 [2021-06-05 18:06:01,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:06:01,434 INFO L93 Difference]: Finished difference Result 12185 states and 33496 transitions. [2021-06-05 18:06:01,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 18:06:01,435 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.25) internal successors, (100), 16 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-06-05 18:06:01,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:06:01,465 INFO L225 Difference]: With dead ends: 12185 [2021-06-05 18:06:01,465 INFO L226 Difference]: Without dead ends: 12185 [2021-06-05 18:06:01,466 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 676.1ms TimeCoverageRelationStatistics Valid=207, Invalid=549, Unknown=0, NotChecked=0, Total=756 [2021-06-05 18:06:01,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12185 states. [2021-06-05 18:06:01,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12185 to 11973. [2021-06-05 18:06:01,749 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-05 18:06:01,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11973 states to 11973 states and 32908 transitions. [2021-06-05 18:06:01,774 INFO L78 Accepts]: Start accepts. Automaton has 11973 states and 32908 transitions. Word has length 100 [2021-06-05 18:06:01,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:06:01,775 INFO L482 AbstractCegarLoop]: Abstraction has 11973 states and 32908 transitions. [2021-06-05 18:06:01,776 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 6.25) internal successors, (100), 16 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:06:01,776 INFO L276 IsEmpty]: Start isEmpty. Operand 11973 states and 32908 transitions. [2021-06-05 18:06:01,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-06-05 18:06:01,789 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:06:01,789 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:06:01,789 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-05 18:06:01,789 INFO L430 AbstractCegarLoop]: === Iteration 5 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:06:01,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:06:01,790 INFO L82 PathProgramCache]: Analyzing trace with hash 588694202, now seen corresponding path program 1 times [2021-06-05 18:06:01,790 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:06:01,790 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579079918] [2021-06-05 18:06:01,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:06:01,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:06:02,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:06:02,673 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:06:02,673 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579079918] [2021-06-05 18:06:02,673 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579079918] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:06:02,673 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:06:02,673 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-06-05 18:06:02,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441052838] [2021-06-05 18:06:02,674 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-06-05 18:06:02,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:06:02,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-06-05 18:06:02,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=628, Unknown=0, NotChecked=0, Total=702 [2021-06-05 18:06:02,675 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-05 18:06:04,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:06:04,874 INFO L93 Difference]: Finished difference Result 12135 states and 33184 transitions. [2021-06-05 18:06:04,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-06-05 18:06:04,874 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.8518518518518516) internal successors, (104), 27 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2021-06-05 18:06:04,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:06:04,903 INFO L225 Difference]: With dead ends: 12135 [2021-06-05 18:06:04,903 INFO L226 Difference]: Without dead ends: 11918 [2021-06-05 18:06:04,904 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 1883.3ms TimeCoverageRelationStatistics Valid=446, Invalid=2004, Unknown=0, NotChecked=0, Total=2450 [2021-06-05 18:06:04,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11918 states. [2021-06-05 18:06:05,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11918 to 11918. [2021-06-05 18:06:05,127 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-05 18:06:05,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11918 states to 11918 states and 32798 transitions. [2021-06-05 18:06:05,152 INFO L78 Accepts]: Start accepts. Automaton has 11918 states and 32798 transitions. Word has length 104 [2021-06-05 18:06:05,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:06:05,152 INFO L482 AbstractCegarLoop]: Abstraction has 11918 states and 32798 transitions. [2021-06-05 18:06:05,152 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 3.8518518518518516) internal successors, (104), 27 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:06:05,152 INFO L276 IsEmpty]: Start isEmpty. Operand 11918 states and 32798 transitions. [2021-06-05 18:06:05,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 18:06:05,166 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:06:05,166 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:06:05,166 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-05 18:06:05,166 INFO L430 AbstractCegarLoop]: === Iteration 6 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:06:05,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:06:05,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1887066075, now seen corresponding path program 1 times [2021-06-05 18:06:05,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:06:05,167 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826517475] [2021-06-05 18:06:05,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:06:05,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:06:05,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-05 18:06:05,754 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:06:05,755 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826517475] [2021-06-05 18:06:05,755 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826517475] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:06:05,755 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:06:05,755 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-06-05 18:06:05,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949205771] [2021-06-05 18:06:05,755 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 18:06:05,756 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:06:05,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 18:06:05,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2021-06-05 18:06:05,756 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-05 18:06:06,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:06:06,956 INFO L93 Difference]: Finished difference Result 16890 states and 46551 transitions. [2021-06-05 18:06:06,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 18:06:06,956 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-05 18:06:06,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:06:06,989 INFO L225 Difference]: With dead ends: 16890 [2021-06-05 18:06:06,989 INFO L226 Difference]: Without dead ends: 16890 [2021-06-05 18:06:06,990 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 931.9ms TimeCoverageRelationStatistics Valid=301, Invalid=959, Unknown=0, NotChecked=0, Total=1260 [2021-06-05 18:06:07,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16890 states. [2021-06-05 18:06:07,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16890 to 14265. [2021-06-05 18:06:07,365 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-05 18:06:07,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14265 states to 14265 states and 39281 transitions. [2021-06-05 18:06:07,398 INFO L78 Accepts]: Start accepts. Automaton has 14265 states and 39281 transitions. Word has length 105 [2021-06-05 18:06:07,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:06:07,399 INFO L482 AbstractCegarLoop]: Abstraction has 14265 states and 39281 transitions. [2021-06-05 18:06:07,399 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:06:07,399 INFO L276 IsEmpty]: Start isEmpty. Operand 14265 states and 39281 transitions. [2021-06-05 18:06:07,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 18:06:07,415 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:06:07,415 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:06:07,415 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-05 18:06:07,415 INFO L430 AbstractCegarLoop]: === Iteration 7 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:06:07,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:06:07,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1261951723, now seen corresponding path program 2 times [2021-06-05 18:06:07,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:06:07,416 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526347871] [2021-06-05 18:06:07,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:06:07,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:06:08,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:06:08,234 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:06:08,234 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526347871] [2021-06-05 18:06:08,234 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526347871] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:06:08,235 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:06:08,235 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-06-05 18:06:08,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320950717] [2021-06-05 18:06:08,235 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 18:06:08,235 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:06:08,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 18:06:08,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2021-06-05 18:06:08,236 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-05 18:06:09,328 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 46 [2021-06-05 18:06:10,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:06:10,669 INFO L93 Difference]: Finished difference Result 20474 states and 56144 transitions. [2021-06-05 18:06:10,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-06-05 18:06:10,669 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-05 18:06:10,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:06:10,699 INFO L225 Difference]: With dead ends: 20474 [2021-06-05 18:06:10,699 INFO L226 Difference]: Without dead ends: 19953 [2021-06-05 18:06:10,702 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1999.3ms TimeCoverageRelationStatistics Valid=501, Invalid=2049, Unknown=0, NotChecked=0, Total=2550 [2021-06-05 18:06:10,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19953 states. [2021-06-05 18:06:11,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19953 to 16773. [2021-06-05 18:06:11,023 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-05 18:06:11,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16773 states to 16773 states and 46324 transitions. [2021-06-05 18:06:11,062 INFO L78 Accepts]: Start accepts. Automaton has 16773 states and 46324 transitions. Word has length 105 [2021-06-05 18:06:11,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:06:11,062 INFO L482 AbstractCegarLoop]: Abstraction has 16773 states and 46324 transitions. [2021-06-05 18:06:11,062 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-05 18:06:11,062 INFO L276 IsEmpty]: Start isEmpty. Operand 16773 states and 46324 transitions. [2021-06-05 18:06:11,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-06-05 18:06:11,080 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:06:11,080 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:06:11,081 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-05 18:06:11,081 INFO L430 AbstractCegarLoop]: === Iteration 8 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:06:11,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:06:11,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1732922443, now seen corresponding path program 1 times [2021-06-05 18:06:11,081 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:06:11,081 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343285148] [2021-06-05 18:06:11,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:06:11,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:06:12,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:06:12,010 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:06:12,010 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343285148] [2021-06-05 18:06:12,010 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343285148] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:06:12,010 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:06:12,010 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-06-05 18:06:12,010 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065522659] [2021-06-05 18:06:12,011 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-06-05 18:06:12,011 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:06:12,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-06-05 18:06:12,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=785, Unknown=0, NotChecked=0, Total=870 [2021-06-05 18:06:12,012 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-05 18:06:14,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:06:14,855 INFO L93 Difference]: Finished difference Result 20614 states and 56541 transitions. [2021-06-05 18:06:14,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-05 18:06:14,855 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.6333333333333333) internal successors, (109), 30 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2021-06-05 18:06:14,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:06:14,880 INFO L225 Difference]: With dead ends: 20614 [2021-06-05 18:06:14,880 INFO L226 Difference]: Without dead ends: 19688 [2021-06-05 18:06:14,881 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 2158.4ms TimeCoverageRelationStatistics Valid=522, Invalid=2340, Unknown=0, NotChecked=0, Total=2862 [2021-06-05 18:06:14,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19688 states. [2021-06-05 18:06:15,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19688 to 16940. [2021-06-05 18:06:15,247 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-05 18:06:15,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16940 states to 16940 states and 46810 transitions. [2021-06-05 18:06:15,288 INFO L78 Accepts]: Start accepts. Automaton has 16940 states and 46810 transitions. Word has length 109 [2021-06-05 18:06:15,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:06:15,288 INFO L482 AbstractCegarLoop]: Abstraction has 16940 states and 46810 transitions. [2021-06-05 18:06:15,288 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 3.6333333333333333) internal successors, (109), 30 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:06:15,289 INFO L276 IsEmpty]: Start isEmpty. Operand 16940 states and 46810 transitions. [2021-06-05 18:06:15,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-06-05 18:06:15,303 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:06:15,304 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:06:15,304 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-05 18:06:15,304 INFO L430 AbstractCegarLoop]: === Iteration 9 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:06:15,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:06:15,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1462976531, now seen corresponding path program 2 times [2021-06-05 18:06:15,304 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:06:15,304 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158610552] [2021-06-05 18:06:15,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:06:15,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:06:16,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:06:16,132 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:06:16,133 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158610552] [2021-06-05 18:06:16,133 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158610552] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:06:16,133 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:06:16,133 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-06-05 18:06:16,133 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646576816] [2021-06-05 18:06:16,133 INFO L462 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-06-05 18:06:16,133 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:06:16,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-06-05 18:06:16,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=733, Unknown=0, NotChecked=0, Total=812 [2021-06-05 18:06:16,134 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-05 18:06:19,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:06:19,033 INFO L93 Difference]: Finished difference Result 17603 states and 48359 transitions. [2021-06-05 18:06:19,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-06-05 18:06:19,034 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.7586206896551726) internal successors, (109), 29 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2021-06-05 18:06:19,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:06:19,053 INFO L225 Difference]: With dead ends: 17603 [2021-06-05 18:06:19,053 INFO L226 Difference]: Without dead ends: 17217 [2021-06-05 18:06:19,054 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 2315.1ms TimeCoverageRelationStatistics Valid=555, Invalid=2415, Unknown=0, NotChecked=0, Total=2970 [2021-06-05 18:06:19,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17217 states. [2021-06-05 18:06:19,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17217 to 16732. [2021-06-05 18:06:19,317 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-05 18:06:19,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16732 states to 16732 states and 46263 transitions. [2021-06-05 18:06:19,355 INFO L78 Accepts]: Start accepts. Automaton has 16732 states and 46263 transitions. Word has length 109 [2021-06-05 18:06:19,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:06:19,355 INFO L482 AbstractCegarLoop]: Abstraction has 16732 states and 46263 transitions. [2021-06-05 18:06:19,356 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 29 states, 29 states have (on average 3.7586206896551726) internal successors, (109), 29 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:06:19,356 INFO L276 IsEmpty]: Start isEmpty. Operand 16732 states and 46263 transitions. [2021-06-05 18:06:19,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-06-05 18:06:19,379 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:06:19,379 INFO L554 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-05 18:06:19,379 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-05 18:06:19,379 INFO L430 AbstractCegarLoop]: === Iteration 10 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:06:19,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:06:19,380 INFO L82 PathProgramCache]: Analyzing trace with hash -91066704, now seen corresponding path program 1 times [2021-06-05 18:06:19,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:06:19,380 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674442588] [2021-06-05 18:06:19,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:06:19,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:06:19,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:06:19,422 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:06:19,422 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674442588] [2021-06-05 18:06:19,422 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674442588] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:06:19,422 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:06:19,422 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 18:06:19,422 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376138387] [2021-06-05 18:06:19,423 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 18:06:19,423 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:06:19,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 18:06:19,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 18:06:19,423 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-05 18:06:19,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:06:19,447 INFO L93 Difference]: Finished difference Result 4749 states and 12040 transitions. [2021-06-05 18:06:19,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 18:06:19,448 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-05 18:06:19,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:06:19,451 INFO L225 Difference]: With dead ends: 4749 [2021-06-05 18:06:19,451 INFO L226 Difference]: Without dead ends: 2943 [2021-06-05 18:06:19,452 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 18:06:19,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2943 states. [2021-06-05 18:06:19,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2943 to 2735. [2021-06-05 18:06:19,481 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-05 18:06:19,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2735 states to 2735 states and 6939 transitions. [2021-06-05 18:06:19,485 INFO L78 Accepts]: Start accepts. Automaton has 2735 states and 6939 transitions. Word has length 126 [2021-06-05 18:06:19,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:06:19,486 INFO L482 AbstractCegarLoop]: Abstraction has 2735 states and 6939 transitions. [2021-06-05 18:06:19,486 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-05 18:06:19,486 INFO L276 IsEmpty]: Start isEmpty. Operand 2735 states and 6939 transitions. [2021-06-05 18:06:19,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-06-05 18:06:19,489 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:06:19,489 INFO L554 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-05 18:06:19,489 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-05 18:06:19,489 INFO L430 AbstractCegarLoop]: === Iteration 11 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:06:19,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:06:19,490 INFO L82 PathProgramCache]: Analyzing trace with hash 116634820, now seen corresponding path program 1 times [2021-06-05 18:06:19,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:06:19,490 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183596757] [2021-06-05 18:06:19,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:06:19,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:06:19,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:06:19,536 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:06:19,536 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183596757] [2021-06-05 18:06:19,536 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183596757] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:06:19,536 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:06:19,536 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 18:06:19,536 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511499446] [2021-06-05 18:06:19,537 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 18:06:19,537 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:06:19,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 18:06:19,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 18:06:19,539 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-05 18:06:19,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:06:19,541 INFO L93 Difference]: Finished difference Result 253 states and 535 transitions. [2021-06-05 18:06:19,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 18:06:19,541 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-05 18:06:19,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:06:19,542 INFO L225 Difference]: With dead ends: 253 [2021-06-05 18:06:19,542 INFO L226 Difference]: Without dead ends: 0 [2021-06-05 18:06:19,543 INFO L810 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-05 18:06:19,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-05 18:06:19,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-05 18:06:19,543 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-05 18:06:19,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-05 18:06:19,544 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 142 [2021-06-05 18:06:19,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:06:19,544 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-05 18:06:19,544 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-05 18:06:19,544 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-05 18:06:19,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-05 18:06:19,544 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-05 18:06:19,544 INFO L301 ceAbstractionStarter]: Result for error location t1Thread1of1ForFork0 was SAFE (1/5) [2021-06-05 18:06:19,546 INFO L255 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-06-05 18:06:19,547 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 18:06:19,547 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 18:06:19,548 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 18:06:19,548 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 18:06:19,548 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 18:06:19,548 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 18:06:19,548 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 18:06:19,548 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-06-05 18:06:19,553 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 247 places, 257 transitions, 536 flow [2021-06-05 18:06:20,267 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 23654 states, 23649 states have (on average 2.8479428305636603) internal successors, (67351), 23653 states have internal predecessors, (67351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:06:20,297 INFO L276 IsEmpty]: Start isEmpty. Operand has 23654 states, 23649 states have (on average 2.8479428305636603) internal successors, (67351), 23653 states have internal predecessors, (67351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:06:20,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-06-05 18:06:20,298 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:06:20,298 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:06:20,298 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:06:20,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:06:20,299 INFO L82 PathProgramCache]: Analyzing trace with hash 617310073, now seen corresponding path program 1 times [2021-06-05 18:06:20,299 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:06:20,299 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085297836] [2021-06-05 18:06:20,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:06:20,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:06:20,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:06:20,312 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:06:20,312 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085297836] [2021-06-05 18:06:20,312 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085297836] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:06:20,312 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:06:20,312 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 18:06:20,312 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555485803] [2021-06-05 18:06:20,313 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-05 18:06:20,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:06:20,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-05 18:06:20,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 18:06:20,348 INFO L87 Difference]: Start difference. First operand has 23654 states, 23649 states have (on average 2.8479428305636603) internal successors, (67351), 23653 states have internal predecessors, (67351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:06:20,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:06:20,464 INFO L93 Difference]: Finished difference Result 23006 states and 64260 transitions. [2021-06-05 18:06:20,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-05 18:06:20,464 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-06-05 18:06:20,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:06:20,465 INFO L225 Difference]: With dead ends: 23006 [2021-06-05 18:06:20,465 INFO L226 Difference]: Without dead ends: 0 [2021-06-05 18:06:20,465 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 18:06:20,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-05 18:06:20,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-05 18:06:20,465 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-05 18:06:20,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-05 18:06:20,466 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2021-06-05 18:06:20,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:06:20,466 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-05 18:06:20,466 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:06:20,466 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-05 18:06:20,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-05 18:06:20,466 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-05 18:06:20,466 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE (2/5) [2021-06-05 18:06:20,467 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 18:06:20,467 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 18:06:20,468 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 18:06:20,468 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 18:06:20,468 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 18:06:20,468 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 18:06:20,468 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 18:06:20,468 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 18:06:20,468 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == t2Thread1of1ForFork1======== [2021-06-05 18:06:20,471 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 247 places, 257 transitions, 536 flow [2021-06-05 18:06:21,106 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 23654 states, 23649 states have (on average 2.8479428305636603) internal successors, (67351), 23653 states have internal predecessors, (67351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:06:21,135 INFO L276 IsEmpty]: Start isEmpty. Operand has 23654 states, 23649 states have (on average 2.8479428305636603) internal successors, (67351), 23653 states have internal predecessors, (67351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:06:21,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-06-05 18:06:21,142 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:06:21,143 INFO L554 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-05 18:06:21,143 INFO L430 AbstractCegarLoop]: === Iteration 1 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:06:21,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:06:21,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1979063990, now seen corresponding path program 1 times [2021-06-05 18:06:21,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:06:21,144 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413678080] [2021-06-05 18:06:21,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:06:21,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:06:21,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:06:21,251 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:06:21,251 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413678080] [2021-06-05 18:06:21,252 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413678080] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:06:21,252 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:06:21,252 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-05 18:06:21,252 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643907741] [2021-06-05 18:06:21,252 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 18:06:21,252 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:06:21,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 18:06:21,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-06-05 18:06:21,286 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-05 18:06:21,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:06:21,732 INFO L93 Difference]: Finished difference Result 23003 states and 64256 transitions. [2021-06-05 18:06:21,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 18:06:21,732 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-05 18:06:21,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:06:21,761 INFO L225 Difference]: With dead ends: 23003 [2021-06-05 18:06:21,761 INFO L226 Difference]: Without dead ends: 21410 [2021-06-05 18:06:21,761 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 228.5ms TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420 [2021-06-05 18:06:21,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21410 states. [2021-06-05 18:06:22,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21410 to 21410. [2021-06-05 18:06:22,135 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-05 18:06:22,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21410 states to 21410 states and 60058 transitions. [2021-06-05 18:06:22,179 INFO L78 Accepts]: Start accepts. Automaton has 21410 states and 60058 transitions. Word has length 92 [2021-06-05 18:06:22,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:06:22,179 INFO L482 AbstractCegarLoop]: Abstraction has 21410 states and 60058 transitions. [2021-06-05 18:06:22,179 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-05 18:06:22,179 INFO L276 IsEmpty]: Start isEmpty. Operand 21410 states and 60058 transitions. [2021-06-05 18:06:22,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-06-05 18:06:22,183 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:06:22,183 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:06:22,183 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-05 18:06:22,184 INFO L430 AbstractCegarLoop]: === Iteration 2 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:06:22,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:06:22,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1743993907, now seen corresponding path program 1 times [2021-06-05 18:06:22,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:06:22,184 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406576016] [2021-06-05 18:06:22,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:06:22,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:06:22,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:06:22,210 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:06:22,210 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406576016] [2021-06-05 18:06:22,210 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406576016] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:06:22,210 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:06:22,210 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 18:06:22,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12456618] [2021-06-05 18:06:22,210 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 18:06:22,211 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:06:22,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 18:06:22,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 18:06:22,211 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-05 18:06:22,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:06:22,260 INFO L93 Difference]: Finished difference Result 14550 states and 40132 transitions. [2021-06-05 18:06:22,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 18:06:22,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2021-06-05 18:06:22,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:06:22,276 INFO L225 Difference]: With dead ends: 14550 [2021-06-05 18:06:22,277 INFO L226 Difference]: Without dead ends: 14107 [2021-06-05 18:06:22,277 INFO L810 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-05 18:06:22,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14107 states. [2021-06-05 18:06:22,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14107 to 14107. [2021-06-05 18:06:22,481 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-05 18:06:22,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14107 states to 14107 states and 38914 transitions. [2021-06-05 18:06:22,505 INFO L78 Accepts]: Start accepts. Automaton has 14107 states and 38914 transitions. Word has length 93 [2021-06-05 18:06:22,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:06:22,506 INFO L482 AbstractCegarLoop]: Abstraction has 14107 states and 38914 transitions. [2021-06-05 18:06:22,506 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:06:22,506 INFO L276 IsEmpty]: Start isEmpty. Operand 14107 states and 38914 transitions. [2021-06-05 18:06:22,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-06-05 18:06:22,517 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:06:22,517 INFO L554 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-05 18:06:22,517 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-05 18:06:22,517 INFO L430 AbstractCegarLoop]: === Iteration 3 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:06:22,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:06:22,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1365563195, now seen corresponding path program 1 times [2021-06-05 18:06:22,518 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:06:22,518 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780213047] [2021-06-05 18:06:22,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:06:22,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:06:22,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:06:22,546 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:06:22,546 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780213047] [2021-06-05 18:06:22,546 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780213047] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:06:22,547 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:06:22,547 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 18:06:22,547 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591230069] [2021-06-05 18:06:22,547 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 18:06:22,547 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:06:22,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 18:06:22,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 18:06:22,548 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-05 18:06:22,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:06:22,586 INFO L93 Difference]: Finished difference Result 6968 states and 17928 transitions. [2021-06-05 18:06:22,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 18:06:22,586 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-05 18:06:22,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:06:22,594 INFO L225 Difference]: With dead ends: 6968 [2021-06-05 18:06:22,594 INFO L226 Difference]: Without dead ends: 6968 [2021-06-05 18:06:22,596 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 18:06:22,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6968 states. [2021-06-05 18:06:22,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6968 to 5714. [2021-06-05 18:06:22,667 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-05 18:06:22,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5714 states to 5714 states and 14722 transitions. [2021-06-05 18:06:22,673 INFO L78 Accepts]: Start accepts. Automaton has 5714 states and 14722 transitions. Word has length 171 [2021-06-05 18:06:22,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:06:22,673 INFO L482 AbstractCegarLoop]: Abstraction has 5714 states and 14722 transitions. [2021-06-05 18:06:22,674 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-05 18:06:22,674 INFO L276 IsEmpty]: Start isEmpty. Operand 5714 states and 14722 transitions. [2021-06-05 18:06:22,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2021-06-05 18:06:22,679 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:06:22,679 INFO L554 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-05 18:06:22,679 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-05 18:06:22,679 INFO L430 AbstractCegarLoop]: === Iteration 4 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:06:22,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:06:22,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1471191579, now seen corresponding path program 1 times [2021-06-05 18:06:22,680 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:06:22,680 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615011922] [2021-06-05 18:06:22,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:06:22,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:06:23,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:06:23,349 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:06:23,349 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615011922] [2021-06-05 18:06:23,349 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615011922] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:06:23,349 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:06:23,349 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-06-05 18:06:23,349 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190750458] [2021-06-05 18:06:23,349 INFO L462 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-06-05 18:06:23,350 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:06:23,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-06-05 18:06:23,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=829, Unknown=0, NotChecked=0, Total=930 [2021-06-05 18:06:23,350 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-05 18:06:25,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:06:25,428 INFO L93 Difference]: Finished difference Result 10116 states and 26169 transitions. [2021-06-05 18:06:25,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-06-05 18:06:25,428 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-05 18:06:25,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:06:25,438 INFO L225 Difference]: With dead ends: 10116 [2021-06-05 18:06:25,439 INFO L226 Difference]: Without dead ends: 10116 [2021-06-05 18:06:25,440 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 685 ImplicationChecksByTransitivity, 1861.3ms TimeCoverageRelationStatistics Valid=552, Invalid=2528, Unknown=0, NotChecked=0, Total=3080 [2021-06-05 18:06:25,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10116 states. [2021-06-05 18:06:25,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10116 to 8359. [2021-06-05 18:06:25,530 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-05 18:06:25,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8359 states to 8359 states and 21669 transitions. [2021-06-05 18:06:25,540 INFO L78 Accepts]: Start accepts. Automaton has 8359 states and 21669 transitions. Word has length 172 [2021-06-05 18:06:25,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:06:25,541 INFO L482 AbstractCegarLoop]: Abstraction has 8359 states and 21669 transitions. [2021-06-05 18:06:25,541 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-05 18:06:25,541 INFO L276 IsEmpty]: Start isEmpty. Operand 8359 states and 21669 transitions. [2021-06-05 18:06:25,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2021-06-05 18:06:25,550 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:06:25,550 INFO L554 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-05 18:06:25,551 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-05 18:06:25,551 INFO L430 AbstractCegarLoop]: === Iteration 5 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:06:25,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:06:25,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1009136741, now seen corresponding path program 2 times [2021-06-05 18:06:25,551 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:06:25,551 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958041792] [2021-06-05 18:06:25,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:06:25,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:06:25,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:06:25,765 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:06:25,765 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958041792] [2021-06-05 18:06:25,765 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958041792] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:06:25,765 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:06:25,765 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-06-05 18:06:25,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217166071] [2021-06-05 18:06:25,765 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 18:06:25,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:06:25,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 18:06:25,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2021-06-05 18:06:25,766 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-05 18:06:26,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:06:26,389 INFO L93 Difference]: Finished difference Result 7534 states and 19551 transitions. [2021-06-05 18:06:26,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 18:06:26,389 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-05 18:06:26,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:06:26,397 INFO L225 Difference]: With dead ends: 7534 [2021-06-05 18:06:26,397 INFO L226 Difference]: Without dead ends: 7534 [2021-06-05 18:06:26,398 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 485.4ms TimeCoverageRelationStatistics Valid=207, Invalid=549, Unknown=0, NotChecked=0, Total=756 [2021-06-05 18:06:26,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7534 states. [2021-06-05 18:06:26,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7534 to 7513. [2021-06-05 18:06:26,474 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-05 18:06:26,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7513 states to 7513 states and 19498 transitions. [2021-06-05 18:06:26,484 INFO L78 Accepts]: Start accepts. Automaton has 7513 states and 19498 transitions. Word has length 172 [2021-06-05 18:06:26,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:06:26,484 INFO L482 AbstractCegarLoop]: Abstraction has 7513 states and 19498 transitions. [2021-06-05 18:06:26,484 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-05 18:06:26,484 INFO L276 IsEmpty]: Start isEmpty. Operand 7513 states and 19498 transitions. [2021-06-05 18:06:26,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-06-05 18:06:26,491 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:06:26,491 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:06:26,491 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-05 18:06:26,491 INFO L430 AbstractCegarLoop]: === Iteration 6 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:06:26,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:06:26,492 INFO L82 PathProgramCache]: Analyzing trace with hash 781502976, now seen corresponding path program 1 times [2021-06-05 18:06:26,492 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:06:26,492 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171853631] [2021-06-05 18:06:26,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:06:26,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:06:26,950 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2021-06-05 18:06:27,110 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2021-06-05 18:06:28,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:06:28,016 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:06:28,016 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171853631] [2021-06-05 18:06:28,016 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171853631] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:06:28,016 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:06:28,016 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-06-05 18:06:28,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765774518] [2021-06-05 18:06:28,017 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 18:06:28,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:06:28,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 18:06:28,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2021-06-05 18:06:28,017 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-05 18:06:28,871 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2021-06-05 18:06:29,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:06:29,983 INFO L93 Difference]: Finished difference Result 7672 states and 19802 transitions. [2021-06-05 18:06:29,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 18:06:29,984 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-05 18:06:29,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:06:29,991 INFO L225 Difference]: With dead ends: 7672 [2021-06-05 18:06:29,991 INFO L226 Difference]: Without dead ends: 7672 [2021-06-05 18:06:29,992 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 17 SyntacticMatches, 9 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 2149.8ms TimeCoverageRelationStatistics Valid=302, Invalid=958, Unknown=0, NotChecked=0, Total=1260 [2021-06-05 18:06:30,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7672 states. [2021-06-05 18:06:30,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7672 to 7462. [2021-06-05 18:06:30,061 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-05 18:06:30,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7462 states to 7462 states and 19272 transitions. [2021-06-05 18:06:30,070 INFO L78 Accepts]: Start accepts. Automaton has 7462 states and 19272 transitions. Word has length 176 [2021-06-05 18:06:30,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:06:30,071 INFO L482 AbstractCegarLoop]: Abstraction has 7462 states and 19272 transitions. [2021-06-05 18:06:30,071 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-05 18:06:30,071 INFO L276 IsEmpty]: Start isEmpty. Operand 7462 states and 19272 transitions. [2021-06-05 18:06:30,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-06-05 18:06:30,080 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:06:30,080 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:06:30,080 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-05 18:06:30,080 INFO L430 AbstractCegarLoop]: === Iteration 7 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:06:30,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:06:30,081 INFO L82 PathProgramCache]: Analyzing trace with hash -399593919, now seen corresponding path program 1 times [2021-06-05 18:06:30,081 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:06:30,081 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050480173] [2021-06-05 18:06:30,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:06:30,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:06:30,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:06:30,800 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:06:30,800 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050480173] [2021-06-05 18:06:30,800 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050480173] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:06:30,800 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:06:30,801 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-06-05 18:06:30,801 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416684988] [2021-06-05 18:06:30,801 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-06-05 18:06:30,801 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:06:30,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-06-05 18:06:30,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=754, Unknown=0, NotChecked=0, Total=870 [2021-06-05 18:06:30,802 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-05 18:06:33,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:06:33,307 INFO L93 Difference]: Finished difference Result 7450 states and 19113 transitions. [2021-06-05 18:06:33,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-06-05 18:06:33,308 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.866666666666666) internal successors, (176), 30 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 176 [2021-06-05 18:06:33,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:06:33,315 INFO L225 Difference]: With dead ends: 7450 [2021-06-05 18:06:33,315 INFO L226 Difference]: Without dead ends: 7450 [2021-06-05 18:06:33,316 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 2283.0ms TimeCoverageRelationStatistics Valid=742, Invalid=2918, Unknown=0, NotChecked=0, Total=3660 [2021-06-05 18:06:33,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7450 states. [2021-06-05 18:06:33,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7450 to 6542. [2021-06-05 18:06:33,383 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-05 18:06:33,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6542 states to 6542 states and 16821 transitions. [2021-06-05 18:06:33,392 INFO L78 Accepts]: Start accepts. Automaton has 6542 states and 16821 transitions. Word has length 176 [2021-06-05 18:06:33,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:06:33,392 INFO L482 AbstractCegarLoop]: Abstraction has 6542 states and 16821 transitions. [2021-06-05 18:06:33,393 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 5.866666666666666) internal successors, (176), 30 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:06:33,393 INFO L276 IsEmpty]: Start isEmpty. Operand 6542 states and 16821 transitions. [2021-06-05 18:06:33,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-06-05 18:06:33,398 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:06:33,398 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:06:33,398 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-05 18:06:33,398 INFO L430 AbstractCegarLoop]: === Iteration 8 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:06:33,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:06:33,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1262122175, now seen corresponding path program 2 times [2021-06-05 18:06:33,399 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:06:33,399 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185075661] [2021-06-05 18:06:33,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:06:33,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:06:34,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:06:34,629 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:06:34,629 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185075661] [2021-06-05 18:06:34,629 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185075661] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:06:34,629 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:06:34,630 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-06-05 18:06:34,630 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307160052] [2021-06-05 18:06:34,630 INFO L462 AbstractCegarLoop]: Interpolant automaton has 36 states [2021-06-05 18:06:34,630 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:06:34,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-06-05 18:06:34,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1108, Unknown=0, NotChecked=0, Total=1260 [2021-06-05 18:06:34,631 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-05 18:06:38,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:06:38,049 INFO L93 Difference]: Finished difference Result 10942 states and 28325 transitions. [2021-06-05 18:06:38,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-06-05 18:06:38,050 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-05 18:06:38,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:06:38,062 INFO L225 Difference]: With dead ends: 10942 [2021-06-05 18:06:38,062 INFO L226 Difference]: Without dead ends: 10942 [2021-06-05 18:06:38,063 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 6 SyntacticMatches, 6 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1332 ImplicationChecksByTransitivity, 3348.2ms TimeCoverageRelationStatistics Valid=1103, Invalid=4447, Unknown=0, NotChecked=0, Total=5550 [2021-06-05 18:06:38,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10942 states. [2021-06-05 18:06:38,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10942 to 9393. [2021-06-05 18:06:38,161 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-05 18:06:38,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9393 states to 9393 states and 24392 transitions. [2021-06-05 18:06:38,174 INFO L78 Accepts]: Start accepts. Automaton has 9393 states and 24392 transitions. Word has length 176 [2021-06-05 18:06:38,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:06:38,175 INFO L482 AbstractCegarLoop]: Abstraction has 9393 states and 24392 transitions. [2021-06-05 18:06:38,175 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-05 18:06:38,175 INFO L276 IsEmpty]: Start isEmpty. Operand 9393 states and 24392 transitions. [2021-06-05 18:06:38,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-06-05 18:06:38,182 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:06:38,183 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:06:38,183 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-05 18:06:38,183 INFO L430 AbstractCegarLoop]: === Iteration 9 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:06:38,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:06:38,183 INFO L82 PathProgramCache]: Analyzing trace with hash -788395354, now seen corresponding path program 1 times [2021-06-05 18:06:38,183 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:06:38,183 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453972430] [2021-06-05 18:06:38,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:06:38,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:06:38,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:06:38,811 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:06:38,812 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453972430] [2021-06-05 18:06:38,812 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453972430] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:06:38,812 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:06:38,812 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-06-05 18:06:38,812 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245809356] [2021-06-05 18:06:38,812 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 18:06:38,812 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:06:38,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 18:06:38,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2021-06-05 18:06:38,813 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-05 18:06:40,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:06:40,659 INFO L93 Difference]: Finished difference Result 8472 states and 21820 transitions. [2021-06-05 18:06:40,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-06-05 18:06:40,659 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 6.428571428571429) internal successors, (180), 28 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 180 [2021-06-05 18:06:40,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:06:40,669 INFO L225 Difference]: With dead ends: 8472 [2021-06-05 18:06:40,669 INFO L226 Difference]: Without dead ends: 8472 [2021-06-05 18:06:40,670 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 1655.7ms TimeCoverageRelationStatistics Valid=610, Invalid=2146, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 18:06:40,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8472 states. [2021-06-05 18:06:40,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8472 to 8178. [2021-06-05 18:06:40,745 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-05 18:06:40,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8178 states to 8178 states and 21078 transitions. [2021-06-05 18:06:40,755 INFO L78 Accepts]: Start accepts. Automaton has 8178 states and 21078 transitions. Word has length 180 [2021-06-05 18:06:40,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:06:40,755 INFO L482 AbstractCegarLoop]: Abstraction has 8178 states and 21078 transitions. [2021-06-05 18:06:40,756 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 6.428571428571429) internal successors, (180), 28 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:06:40,756 INFO L276 IsEmpty]: Start isEmpty. Operand 8178 states and 21078 transitions. [2021-06-05 18:06:40,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 18:06:40,761 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:06:40,761 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:06:40,761 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-05 18:06:40,762 INFO L430 AbstractCegarLoop]: === Iteration 10 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:06:40,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:06:40,762 INFO L82 PathProgramCache]: Analyzing trace with hash -858234869, now seen corresponding path program 1 times [2021-06-05 18:06:40,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:06:40,762 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420025581] [2021-06-05 18:06:40,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:06:40,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:06:41,303 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-05 18:06:41,463 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 18:06:45,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:06:45,621 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:06:45,621 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420025581] [2021-06-05 18:06:45,621 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420025581] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:06:45,621 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:06:45,621 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 18:06:45,621 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894860774] [2021-06-05 18:06:45,621 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 18:06:45,621 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:06:45,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 18:06:45,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2572, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 18:06:45,622 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-05 18:06:48,298 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 53 [2021-06-05 18:06:48,697 WARN L205 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 77 [2021-06-05 18:06:49,061 WARN L205 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 73 [2021-06-05 18:06:51,348 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 18:06:51,598 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-05 18:06:51,941 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-05 18:06:53,900 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 18:06:56,510 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 18:06:58,861 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 18:06:59,890 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 18:07:01,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:07:01,221 INFO L93 Difference]: Finished difference Result 12591 states and 32503 transitions. [2021-06-05 18:07:01,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-06-05 18:07:01,221 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-05 18:07:01,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:07:01,234 INFO L225 Difference]: With dead ends: 12591 [2021-06-05 18:07:01,235 INFO L226 Difference]: Without dead ends: 12171 [2021-06-05 18:07:01,238 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 23 SyntacticMatches, 7 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4492 ImplicationChecksByTransitivity, 12980.1ms TimeCoverageRelationStatistics Valid=1530, Invalid=14982, Unknown=0, NotChecked=0, Total=16512 [2021-06-05 18:07:01,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12171 states. [2021-06-05 18:07:01,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12171 to 9590. [2021-06-05 18:07:01,340 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-05 18:07:01,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9590 states to 9590 states and 24548 transitions. [2021-06-05 18:07:01,353 INFO L78 Accepts]: Start accepts. Automaton has 9590 states and 24548 transitions. Word has length 184 [2021-06-05 18:07:01,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:07:01,353 INFO L482 AbstractCegarLoop]: Abstraction has 9590 states and 24548 transitions. [2021-06-05 18:07:01,353 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:07:01,353 INFO L276 IsEmpty]: Start isEmpty. Operand 9590 states and 24548 transitions. [2021-06-05 18:07:01,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 18:07:01,360 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:07:01,361 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:07:01,361 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-06-05 18:07:01,361 INFO L430 AbstractCegarLoop]: === Iteration 11 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:07:01,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:07:01,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1302633973, now seen corresponding path program 2 times [2021-06-05 18:07:01,361 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:07:01,361 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386534553] [2021-06-05 18:07:01,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:07:01,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:07:01,985 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-05 18:07:02,185 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 18:07:03,531 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2021-06-05 18:07:04,862 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 18:07:05,126 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2021-06-05 18:07:07,721 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 58 [2021-06-05 18:07:09,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:07:09,019 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:07:09,019 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386534553] [2021-06-05 18:07:09,019 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386534553] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:07:09,019 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:07:09,019 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 18:07:09,019 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160439867] [2021-06-05 18:07:09,020 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 18:07:09,020 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:07:09,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 18:07:09,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=2574, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 18:07:09,021 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-05 18:07:11,755 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 53 [2021-06-05 18:07:12,217 WARN L205 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 77 [2021-06-05 18:07:12,718 WARN L205 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 73 [2021-06-05 18:07:13,715 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2021-06-05 18:07:15,728 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 18:07:16,034 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-05 18:07:16,451 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-05 18:07:19,098 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 18:07:22,391 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 18:07:25,481 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 18:07:28,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:07:28,520 INFO L93 Difference]: Finished difference Result 14115 states and 36317 transitions. [2021-06-05 18:07:28,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2021-06-05 18:07:28,520 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-05 18:07:28,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:07:28,536 INFO L225 Difference]: With dead ends: 14115 [2021-06-05 18:07:28,537 INFO L226 Difference]: Without dead ends: 13695 [2021-06-05 18:07:28,540 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4555 ImplicationChecksByTransitivity, 16672.0ms TimeCoverageRelationStatistics Valid=1548, Invalid=15222, Unknown=0, NotChecked=0, Total=16770 [2021-06-05 18:07:28,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13695 states. [2021-06-05 18:07:28,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13695 to 9590. [2021-06-05 18:07:28,650 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-05 18:07:28,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9590 states to 9590 states and 24548 transitions. [2021-06-05 18:07:28,663 INFO L78 Accepts]: Start accepts. Automaton has 9590 states and 24548 transitions. Word has length 184 [2021-06-05 18:07:28,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:07:28,663 INFO L482 AbstractCegarLoop]: Abstraction has 9590 states and 24548 transitions. [2021-06-05 18:07:28,664 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:07:28,664 INFO L276 IsEmpty]: Start isEmpty. Operand 9590 states and 24548 transitions. [2021-06-05 18:07:28,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 18:07:28,671 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:07:28,671 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:07:28,671 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-06-05 18:07:28,672 INFO L430 AbstractCegarLoop]: === Iteration 12 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:07:28,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:07:28,672 INFO L82 PathProgramCache]: Analyzing trace with hash 868546213, now seen corresponding path program 3 times [2021-06-05 18:07:28,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:07:28,672 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743263223] [2021-06-05 18:07:28,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:07:28,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:07:29,397 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-05 18:07:29,544 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 18:07:33,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:07:33,376 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:07:33,376 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743263223] [2021-06-05 18:07:33,376 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743263223] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:07:33,376 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:07:33,376 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 18:07:33,376 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661423699] [2021-06-05 18:07:33,377 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 18:07:33,377 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:07:33,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 18:07:33,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=2577, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 18:07:33,377 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-05 18:07:37,072 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 53 [2021-06-05 18:07:37,775 WARN L205 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 77 [2021-06-05 18:07:38,429 WARN L205 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 73 [2021-06-05 18:07:39,807 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 62 [2021-06-05 18:07:42,500 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 18:07:42,847 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-05 18:07:43,340 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-05 18:07:46,417 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 18:07:50,606 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 18:07:53,150 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 18:07:54,014 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 18:07:54,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:07:54,759 INFO L93 Difference]: Finished difference Result 14179 states and 36477 transitions. [2021-06-05 18:07:54,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2021-06-05 18:07:54,759 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-05 18:07:54,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:07:54,775 INFO L225 Difference]: With dead ends: 14179 [2021-06-05 18:07:54,775 INFO L226 Difference]: Without dead ends: 13759 [2021-06-05 18:07:54,777 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4722 ImplicationChecksByTransitivity, 15087.6ms TimeCoverageRelationStatistics Valid=1591, Invalid=15701, Unknown=0, NotChecked=0, Total=17292 [2021-06-05 18:07:54,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13759 states. [2021-06-05 18:07:54,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13759 to 9590. [2021-06-05 18:07:54,893 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-05 18:07:54,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9590 states to 9590 states and 24548 transitions. [2021-06-05 18:07:54,907 INFO L78 Accepts]: Start accepts. Automaton has 9590 states and 24548 transitions. Word has length 184 [2021-06-05 18:07:54,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:07:54,907 INFO L482 AbstractCegarLoop]: Abstraction has 9590 states and 24548 transitions. [2021-06-05 18:07:54,907 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:07:54,907 INFO L276 IsEmpty]: Start isEmpty. Operand 9590 states and 24548 transitions. [2021-06-05 18:07:54,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 18:07:54,915 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:07:54,915 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:07:54,915 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-06-05 18:07:54,915 INFO L430 AbstractCegarLoop]: === Iteration 13 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:07:54,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:07:54,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1647526667, now seen corresponding path program 4 times [2021-06-05 18:07:54,915 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:07:54,915 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875858519] [2021-06-05 18:07:54,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:07:54,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:07:55,439 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-05 18:07:55,613 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 18:07:55,866 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2021-06-05 18:07:56,051 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2021-06-05 18:07:57,245 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 18:08:00,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:08:00,685 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:08:00,685 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875858519] [2021-06-05 18:08:00,685 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875858519] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:08:00,685 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:08:00,685 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 18:08:00,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181738431] [2021-06-05 18:08:00,686 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 18:08:00,686 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:08:00,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 18:08:00,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2578, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 18:08:00,686 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-05 18:08:06,059 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 48 [2021-06-05 18:08:07,146 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 53 [2021-06-05 18:08:08,048 WARN L205 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 77 [2021-06-05 18:08:08,863 WARN L205 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 73 [2021-06-05 18:08:10,571 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 65 [2021-06-05 18:08:14,033 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 18:08:14,466 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-05 18:08:15,150 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-05 18:08:18,669 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 18:08:20,869 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 18:08:23,016 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 18:08:24,045 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 18:08:24,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:08:24,967 INFO L93 Difference]: Finished difference Result 14163 states and 36441 transitions. [2021-06-05 18:08:24,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2021-06-05 18:08:24,967 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-05 18:08:24,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:08:24,983 INFO L225 Difference]: With dead ends: 14163 [2021-06-05 18:08:24,983 INFO L226 Difference]: Without dead ends: 13743 [2021-06-05 18:08:24,984 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4796 ImplicationChecksByTransitivity, 18158.9ms TimeCoverageRelationStatistics Valid=1618, Invalid=15938, Unknown=0, NotChecked=0, Total=17556 [2021-06-05 18:08:25,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13743 states. [2021-06-05 18:08:25,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13743 to 9590. [2021-06-05 18:08:25,109 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-05 18:08:25,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9590 states to 9590 states and 24548 transitions. [2021-06-05 18:08:25,124 INFO L78 Accepts]: Start accepts. Automaton has 9590 states and 24548 transitions. Word has length 184 [2021-06-05 18:08:25,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:08:25,125 INFO L482 AbstractCegarLoop]: Abstraction has 9590 states and 24548 transitions. [2021-06-05 18:08:25,125 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:08:25,125 INFO L276 IsEmpty]: Start isEmpty. Operand 9590 states and 24548 transitions. [2021-06-05 18:08:25,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 18:08:25,133 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:08:25,133 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:08:25,133 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-06-05 18:08:25,134 INFO L430 AbstractCegarLoop]: === Iteration 14 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:08:25,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:08:25,134 INFO L82 PathProgramCache]: Analyzing trace with hash -276826587, now seen corresponding path program 5 times [2021-06-05 18:08:25,134 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:08:25,134 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842005740] [2021-06-05 18:08:25,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:08:25,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:08:25,671 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-05 18:08:25,910 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 18:08:26,329 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2021-06-05 18:08:26,572 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2021-06-05 18:08:28,139 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 18:08:32,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:08:32,374 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:08:32,375 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842005740] [2021-06-05 18:08:32,375 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842005740] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:08:32,375 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:08:32,375 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 18:08:32,375 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775051138] [2021-06-05 18:08:32,375 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 18:08:32,375 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:08:32,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 18:08:32,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=2580, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 18:08:32,376 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-05 18:08:37,223 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 49 [2021-06-05 18:08:38,018 WARN L205 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 71 [2021-06-05 18:08:38,826 WARN L205 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 65 [2021-06-05 18:08:40,429 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 48 [2021-06-05 18:08:40,981 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 51 [2021-06-05 18:08:41,703 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 53 [2021-06-05 18:08:42,818 WARN L205 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 77 [2021-06-05 18:08:43,097 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 18:08:43,442 WARN L205 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 73 [2021-06-05 18:08:43,845 WARN L205 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 75 [2021-06-05 18:08:46,015 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 18:08:46,271 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-05 18:08:46,590 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-05 18:08:48,429 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 18:08:50,879 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 18:08:53,170 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 18:08:54,183 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 18:08:55,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:08:55,162 INFO L93 Difference]: Finished difference Result 14267 states and 36697 transitions. [2021-06-05 18:08:55,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2021-06-05 18:08:55,162 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-05 18:08:55,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:08:55,179 INFO L225 Difference]: With dead ends: 14267 [2021-06-05 18:08:55,179 INFO L226 Difference]: Without dead ends: 13847 [2021-06-05 18:08:55,181 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5231 ImplicationChecksByTransitivity, 21353.3ms TimeCoverageRelationStatistics Valid=1734, Invalid=17172, Unknown=0, NotChecked=0, Total=18906 [2021-06-05 18:08:55,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13847 states. [2021-06-05 18:08:55,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13847 to 9590. [2021-06-05 18:08:55,307 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-05 18:08:55,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9590 states to 9590 states and 24548 transitions. [2021-06-05 18:08:55,321 INFO L78 Accepts]: Start accepts. Automaton has 9590 states and 24548 transitions. Word has length 184 [2021-06-05 18:08:55,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:08:55,322 INFO L482 AbstractCegarLoop]: Abstraction has 9590 states and 24548 transitions. [2021-06-05 18:08:55,322 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:08:55,322 INFO L276 IsEmpty]: Start isEmpty. Operand 9590 states and 24548 transitions. [2021-06-05 18:08:55,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 18:08:55,333 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:08:55,333 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:08:55,333 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-06-05 18:08:55,333 INFO L430 AbstractCegarLoop]: === Iteration 15 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:08:55,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:08:55,334 INFO L82 PathProgramCache]: Analyzing trace with hash -410727541, now seen corresponding path program 6 times [2021-06-05 18:08:55,334 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:08:55,334 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826951958] [2021-06-05 18:08:55,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:08:55,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:08:55,933 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-05 18:08:56,158 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 18:08:58,426 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 18:09:03,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:09:03,127 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:09:03,127 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826951958] [2021-06-05 18:09:03,127 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826951958] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:09:03,127 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:09:03,127 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 18:09:03,127 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854754200] [2021-06-05 18:09:03,128 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 18:09:03,128 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:09:03,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 18:09:03,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2583, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 18:09:03,129 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-05 18:09:06,314 WARN L205 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 18:09:06,788 WARN L205 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 69 [2021-06-05 18:09:08,144 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 51 [2021-06-05 18:09:08,507 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 53 [2021-06-05 18:09:09,175 WARN L205 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 77 [2021-06-05 18:09:09,760 WARN L205 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 73 [2021-06-05 18:09:12,579 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 18:09:12,891 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-05 18:09:13,345 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-05 18:09:15,888 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 18:09:19,125 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 18:09:19,629 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2021-06-05 18:09:22,057 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 18:09:23,360 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 18:09:24,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:09:24,939 INFO L93 Difference]: Finished difference Result 14179 states and 36499 transitions. [2021-06-05 18:09:24,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2021-06-05 18:09:24,940 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-05 18:09:24,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:09:24,956 INFO L225 Difference]: With dead ends: 14179 [2021-06-05 18:09:24,956 INFO L226 Difference]: Without dead ends: 13759 [2021-06-05 18:09:24,957 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4948 ImplicationChecksByTransitivity, 18646.7ms TimeCoverageRelationStatistics Valid=1656, Invalid=16434, Unknown=0, NotChecked=0, Total=18090 [2021-06-05 18:09:24,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13759 states. [2021-06-05 18:09:25,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13759 to 9668. [2021-06-05 18:09:25,074 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-05 18:09:25,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9668 states to 9668 states and 24758 transitions. [2021-06-05 18:09:25,088 INFO L78 Accepts]: Start accepts. Automaton has 9668 states and 24758 transitions. Word has length 184 [2021-06-05 18:09:25,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:09:25,089 INFO L482 AbstractCegarLoop]: Abstraction has 9668 states and 24758 transitions. [2021-06-05 18:09:25,089 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:09:25,089 INFO L276 IsEmpty]: Start isEmpty. Operand 9668 states and 24758 transitions. [2021-06-05 18:09:25,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 18:09:25,096 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:09:25,097 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:09:25,097 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-06-05 18:09:25,097 INFO L430 AbstractCegarLoop]: === Iteration 16 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:09:25,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:09:25,097 INFO L82 PathProgramCache]: Analyzing trace with hash 2715019, now seen corresponding path program 7 times [2021-06-05 18:09:25,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:09:25,097 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50855896] [2021-06-05 18:09:25,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:09:25,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:09:25,906 WARN L205 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-05 18:09:26,047 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 18:09:30,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:09:30,072 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:09:30,072 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50855896] [2021-06-05 18:09:30,072 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50855896] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:09:30,072 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:09:30,072 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 18:09:30,072 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365044870] [2021-06-05 18:09:30,072 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 18:09:30,072 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:09:30,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 18:09:30,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=2585, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 18:09:30,073 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-05 18:09:33,225 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 49 [2021-06-05 18:09:33,849 WARN L205 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 18:09:34,489 WARN L205 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 69 [2021-06-05 18:09:36,429 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 51 [2021-06-05 18:09:37,091 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 53 [2021-06-05 18:09:38,211 WARN L205 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 81 [2021-06-05 18:09:39,214 WARN L205 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 79 [2021-06-05 18:09:44,455 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 18:09:44,884 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-05 18:09:45,571 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-05 18:09:49,826 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 18:09:54,342 WARN L205 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2021-06-05 18:09:54,657 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 18:09:56,653 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 18:09:57,563 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 18:09:58,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:09:58,446 INFO L93 Difference]: Finished difference Result 14120 states and 36372 transitions. [2021-06-05 18:09:58,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2021-06-05 18:09:58,447 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-05 18:09:58,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:09:58,463 INFO L225 Difference]: With dead ends: 14120 [2021-06-05 18:09:58,463 INFO L226 Difference]: Without dead ends: 13700 [2021-06-05 18:09:58,464 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5183 ImplicationChecksByTransitivity, 18110.7ms TimeCoverageRelationStatistics Valid=1685, Invalid=17221, Unknown=0, NotChecked=0, Total=18906 [2021-06-05 18:09:58,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13700 states. [2021-06-05 18:09:58,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13700 to 9681. [2021-06-05 18:09:58,584 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-05 18:09:58,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9681 states to 9681 states and 24793 transitions. [2021-06-05 18:09:58,599 INFO L78 Accepts]: Start accepts. Automaton has 9681 states and 24793 transitions. Word has length 184 [2021-06-05 18:09:58,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:09:58,599 INFO L482 AbstractCegarLoop]: Abstraction has 9681 states and 24793 transitions. [2021-06-05 18:09:58,599 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:09:58,599 INFO L276 IsEmpty]: Start isEmpty. Operand 9681 states and 24793 transitions. [2021-06-05 18:09:58,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 18:09:58,608 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:09:58,609 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:09:58,609 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-06-05 18:09:58,609 INFO L430 AbstractCegarLoop]: === Iteration 17 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:09:58,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:09:58,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1807828059, now seen corresponding path program 8 times [2021-06-05 18:09:58,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:09:58,609 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187533423] [2021-06-05 18:09:58,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:09:58,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:09:59,181 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-05 18:09:59,373 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 18:10:00,916 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 18:10:04,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:10:04,617 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:10:04,617 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187533423] [2021-06-05 18:10:04,617 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187533423] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:10:04,617 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:10:04,617 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 18:10:04,617 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154280850] [2021-06-05 18:10:04,617 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 18:10:04,617 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:10:04,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 18:10:04,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=2585, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 18:10:04,619 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-05 18:10:08,898 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 49 [2021-06-05 18:10:09,616 WARN L205 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 18:10:10,364 WARN L205 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 69 [2021-06-05 18:10:11,895 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 48 [2021-06-05 18:10:12,511 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 51 [2021-06-05 18:10:13,084 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 53 [2021-06-05 18:10:14,305 WARN L205 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 81 [2021-06-05 18:10:15,411 WARN L205 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 79 [2021-06-05 18:10:19,958 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 18:10:20,202 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-05 18:10:20,511 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-05 18:10:22,303 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 18:10:24,651 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 18:10:26,773 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 18:10:27,720 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 18:10:28,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:10:28,600 INFO L93 Difference]: Finished difference Result 14133 states and 36407 transitions. [2021-06-05 18:10:28,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2021-06-05 18:10:28,601 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-05 18:10:28,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:10:28,616 INFO L225 Difference]: With dead ends: 14133 [2021-06-05 18:10:28,616 INFO L226 Difference]: Without dead ends: 13713 [2021-06-05 18:10:28,618 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5473 ImplicationChecksByTransitivity, 20455.8ms TimeCoverageRelationStatistics Valid=1722, Invalid=18018, Unknown=0, NotChecked=0, Total=19740 [2021-06-05 18:10:28,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13713 states. [2021-06-05 18:10:28,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13713 to 9694. [2021-06-05 18:10:28,740 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-05 18:10:28,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9694 states to 9694 states and 24828 transitions. [2021-06-05 18:10:28,754 INFO L78 Accepts]: Start accepts. Automaton has 9694 states and 24828 transitions. Word has length 184 [2021-06-05 18:10:28,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:10:28,755 INFO L482 AbstractCegarLoop]: Abstraction has 9694 states and 24828 transitions. [2021-06-05 18:10:28,755 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:10:28,755 INFO L276 IsEmpty]: Start isEmpty. Operand 9694 states and 24828 transitions. [2021-06-05 18:10:28,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 18:10:28,763 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:10:28,763 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:10:28,763 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-06-05 18:10:28,763 INFO L430 AbstractCegarLoop]: === Iteration 18 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:10:28,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:10:28,763 INFO L82 PathProgramCache]: Analyzing trace with hash -92526133, now seen corresponding path program 9 times [2021-06-05 18:10:28,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:10:28,764 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795119795] [2021-06-05 18:10:28,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:10:28,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:10:29,346 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-05 18:10:29,585 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 18:10:35,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:10:35,547 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:10:35,547 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795119795] [2021-06-05 18:10:35,547 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795119795] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:10:35,547 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:10:35,547 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 18:10:35,547 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899325668] [2021-06-05 18:10:35,547 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 18:10:35,548 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:10:35,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 18:10:35,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2572, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 18:10:35,548 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-05 18:10:40,001 WARN L205 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 18:10:40,322 WARN L205 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 69 [2021-06-05 18:10:41,561 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 51 [2021-06-05 18:10:41,874 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 53 [2021-06-05 18:10:42,511 WARN L205 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 81 [2021-06-05 18:10:43,149 WARN L205 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 79 [2021-06-05 18:10:46,427 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 18:10:46,690 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-05 18:10:47,037 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-05 18:10:49,147 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 18:10:51,504 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 18:10:53,771 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 18:10:54,789 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 18:10:55,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:10:55,710 INFO L93 Difference]: Finished difference Result 15477 states and 39922 transitions. [2021-06-05 18:10:55,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2021-06-05 18:10:55,710 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-05 18:10:55,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:10:55,727 INFO L225 Difference]: With dead ends: 15477 [2021-06-05 18:10:55,727 INFO L226 Difference]: Without dead ends: 15057 [2021-06-05 18:10:55,729 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5475 ImplicationChecksByTransitivity, 18489.4ms TimeCoverageRelationStatistics Valid=1810, Invalid=17930, Unknown=0, NotChecked=0, Total=19740 [2021-06-05 18:10:55,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15057 states. [2021-06-05 18:10:55,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15057 to 9798. [2021-06-05 18:10:55,845 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-05 18:10:55,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9798 states to 9798 states and 25108 transitions. [2021-06-05 18:10:55,858 INFO L78 Accepts]: Start accepts. Automaton has 9798 states and 25108 transitions. Word has length 184 [2021-06-05 18:10:55,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:10:55,858 INFO L482 AbstractCegarLoop]: Abstraction has 9798 states and 25108 transitions. [2021-06-05 18:10:55,859 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:10:55,859 INFO L276 IsEmpty]: Start isEmpty. Operand 9798 states and 25108 transitions. [2021-06-05 18:10:55,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 18:10:55,866 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:10:55,866 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:10:55,866 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-06-05 18:10:55,866 INFO L430 AbstractCegarLoop]: === Iteration 19 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:10:55,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:10:55,867 INFO L82 PathProgramCache]: Analyzing trace with hash 787291659, now seen corresponding path program 10 times [2021-06-05 18:10:55,867 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:10:55,867 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740905014] [2021-06-05 18:10:55,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:10:55,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:10:56,449 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-05 18:10:56,617 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 18:10:57,802 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2021-06-05 18:10:58,906 WARN L205 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 18:11:01,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:11:01,331 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:11:01,331 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740905014] [2021-06-05 18:11:01,331 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740905014] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:11:01,331 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:11:01,332 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 18:11:01,332 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787750751] [2021-06-05 18:11:01,332 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 18:11:01,332 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:11:01,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 18:11:01,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2555, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 18:11:01,333 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-05 18:11:04,270 WARN L205 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 18:11:04,723 WARN L205 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 69 [2021-06-05 18:11:06,338 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 51 [2021-06-05 18:11:06,795 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 53 [2021-06-05 18:11:07,539 WARN L205 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 77 [2021-06-05 18:11:08,268 WARN L205 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 73 [2021-06-05 18:11:12,966 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 18:11:13,386 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-05 18:11:13,960 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-05 18:11:17,778 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 18:11:22,198 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 18:11:25,027 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 18:11:26,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:11:26,562 INFO L93 Difference]: Finished difference Result 15333 states and 39480 transitions. [2021-06-05 18:11:26,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2021-06-05 18:11:26,563 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-05 18:11:26,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:11:26,577 INFO L225 Difference]: With dead ends: 15333 [2021-06-05 18:11:26,577 INFO L226 Difference]: Without dead ends: 14913 [2021-06-05 18:11:26,578 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5547 ImplicationChecksByTransitivity, 17483.6ms TimeCoverageRelationStatistics Valid=1927, Invalid=17813, Unknown=0, NotChecked=0, Total=19740 [2021-06-05 18:11:26,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14913 states. [2021-06-05 18:11:26,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14913 to 9811. [2021-06-05 18:11:26,689 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-05 18:11:26,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9811 states to 9811 states and 25143 transitions. [2021-06-05 18:11:26,703 INFO L78 Accepts]: Start accepts. Automaton has 9811 states and 25143 transitions. Word has length 184 [2021-06-05 18:11:26,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:11:26,703 INFO L482 AbstractCegarLoop]: Abstraction has 9811 states and 25143 transitions. [2021-06-05 18:11:26,703 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:11:26,703 INFO L276 IsEmpty]: Start isEmpty. Operand 9811 states and 25143 transitions. [2021-06-05 18:11:26,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 18:11:26,711 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:11:26,711 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:11:26,711 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-06-05 18:11:26,711 INFO L430 AbstractCegarLoop]: === Iteration 20 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:11:26,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:11:26,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1611136987, now seen corresponding path program 11 times [2021-06-05 18:11:26,712 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:11:26,712 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169404359] [2021-06-05 18:11:26,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:11:26,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:11:27,299 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 18:11:31,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:11:31,427 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:11:31,427 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169404359] [2021-06-05 18:11:31,427 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169404359] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:11:31,428 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:11:31,428 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 18:11:31,428 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591651085] [2021-06-05 18:11:31,428 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 18:11:31,428 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:11:31,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 18:11:31,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=2559, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 18:11:31,429 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-05 18:11:34,242 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 49 [2021-06-05 18:11:34,848 WARN L205 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 18:11:35,472 WARN L205 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 69 [2021-06-05 18:11:40,013 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 18:11:40,414 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-05 18:11:40,924 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-05 18:11:44,536 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 18:11:47,524 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 18:11:49,532 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 18:11:50,400 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 18:11:51,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:11:51,338 INFO L93 Difference]: Finished difference Result 15037 states and 38694 transitions. [2021-06-05 18:11:51,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2021-06-05 18:11:51,339 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-05 18:11:51,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:11:51,354 INFO L225 Difference]: With dead ends: 15037 [2021-06-05 18:11:51,354 INFO L226 Difference]: Without dead ends: 14617 [2021-06-05 18:11:51,356 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4665 ImplicationChecksByTransitivity, 14414.9ms TimeCoverageRelationStatistics Valid=1610, Invalid=15420, Unknown=0, NotChecked=0, Total=17030 [2021-06-05 18:11:51,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14617 states. [2021-06-05 18:11:51,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14617 to 9850. [2021-06-05 18:11:51,484 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-05 18:11:51,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9850 states to 9850 states and 25248 transitions. [2021-06-05 18:11:51,499 INFO L78 Accepts]: Start accepts. Automaton has 9850 states and 25248 transitions. Word has length 184 [2021-06-05 18:11:51,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:11:51,500 INFO L482 AbstractCegarLoop]: Abstraction has 9850 states and 25248 transitions. [2021-06-05 18:11:51,500 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:11:51,500 INFO L276 IsEmpty]: Start isEmpty. Operand 9850 states and 25248 transitions. [2021-06-05 18:11:51,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 18:11:51,508 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:11:51,508 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:11:51,508 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-06-05 18:11:51,508 INFO L430 AbstractCegarLoop]: === Iteration 21 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:11:51,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:11:51,509 INFO L82 PathProgramCache]: Analyzing trace with hash 481639115, now seen corresponding path program 12 times [2021-06-05 18:11:51,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:11:51,509 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964413183] [2021-06-05 18:11:51,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:11:51,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:11:52,044 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-05 18:11:52,270 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 18:11:52,628 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2021-06-05 18:11:54,082 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 18:11:57,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:11:57,714 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:11:57,714 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964413183] [2021-06-05 18:11:57,715 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964413183] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:11:57,715 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:11:57,715 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 18:11:57,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578980320] [2021-06-05 18:11:57,715 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 18:11:57,715 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:11:57,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 18:11:57,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=2559, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 18:11:57,716 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-05 18:12:01,346 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 49 [2021-06-05 18:12:02,050 WARN L205 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 18:12:02,695 WARN L205 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 69 [2021-06-05 18:12:07,153 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 18:12:07,575 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-05 18:12:08,179 WARN L205 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-05 18:12:08,369 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 75 [2021-06-05 18:12:10,098 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 18:12:12,305 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 18:12:14,309 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 18:12:15,185 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 18:12:16,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:12:16,089 INFO L93 Difference]: Finished difference Result 14565 states and 37492 transitions. [2021-06-05 18:12:16,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2021-06-05 18:12:16,090 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-05 18:12:16,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:12:16,106 INFO L225 Difference]: With dead ends: 14565 [2021-06-05 18:12:16,107 INFO L226 Difference]: Without dead ends: 14145 [2021-06-05 18:12:16,108 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4570 ImplicationChecksByTransitivity, 16288.5ms TimeCoverageRelationStatistics Valid=1590, Invalid=15180, Unknown=0, NotChecked=0, Total=16770 [2021-06-05 18:12:16,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14145 states. [2021-06-05 18:12:16,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14145 to 9863. [2021-06-05 18:12:16,217 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-05 18:12:16,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9863 states to 9863 states and 25283 transitions. [2021-06-05 18:12:16,229 INFO L78 Accepts]: Start accepts. Automaton has 9863 states and 25283 transitions. Word has length 184 [2021-06-05 18:12:16,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:12:16,230 INFO L482 AbstractCegarLoop]: Abstraction has 9863 states and 25283 transitions. [2021-06-05 18:12:16,230 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:12:16,230 INFO L276 IsEmpty]: Start isEmpty. Operand 9863 states and 25283 transitions. [2021-06-05 18:12:16,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 18:12:16,236 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:12:16,237 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:12:16,237 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-06-05 18:12:16,237 INFO L430 AbstractCegarLoop]: === Iteration 22 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:12:16,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:12:16,237 INFO L82 PathProgramCache]: Analyzing trace with hash 317652773, now seen corresponding path program 13 times [2021-06-05 18:12:16,237 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:12:16,237 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234131624] [2021-06-05 18:12:16,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:12:16,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:12:16,770 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-05 18:12:16,924 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 18:12:18,590 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 18:12:22,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:12:22,383 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:12:22,383 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234131624] [2021-06-05 18:12:22,383 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234131624] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:12:22,383 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:12:22,383 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 18:12:22,384 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466448021] [2021-06-05 18:12:22,384 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 18:12:22,384 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:12:22,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 18:12:22,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=2559, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 18:12:22,386 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-05 18:12:26,167 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 49 [2021-06-05 18:12:26,897 WARN L205 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 18:12:27,557 WARN L205 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 69 [2021-06-05 18:12:30,348 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-06-05 18:12:30,891 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 18:12:31,139 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-05 18:12:31,404 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-05 18:12:32,951 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 18:12:35,091 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 18:12:37,073 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 18:12:37,960 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 18:12:38,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:12:38,783 INFO L93 Difference]: Finished difference Result 14085 states and 36272 transitions. [2021-06-05 18:12:38,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2021-06-05 18:12:38,783 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-05 18:12:38,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:12:38,800 INFO L225 Difference]: With dead ends: 14085 [2021-06-05 18:12:38,800 INFO L226 Difference]: Without dead ends: 13665 [2021-06-05 18:12:38,801 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4405 ImplicationChecksByTransitivity, 15926.6ms TimeCoverageRelationStatistics Valid=1538, Invalid=14718, Unknown=0, NotChecked=0, Total=16256 [2021-06-05 18:12:38,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13665 states. [2021-06-05 18:12:38,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13665 to 9876. [2021-06-05 18:12:38,924 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-05 18:12:38,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9876 states to 9876 states and 25318 transitions. [2021-06-05 18:12:38,939 INFO L78 Accepts]: Start accepts. Automaton has 9876 states and 25318 transitions. Word has length 184 [2021-06-05 18:12:38,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:12:38,939 INFO L482 AbstractCegarLoop]: Abstraction has 9876 states and 25318 transitions. [2021-06-05 18:12:38,939 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:12:38,939 INFO L276 IsEmpty]: Start isEmpty. Operand 9876 states and 25318 transitions. [2021-06-05 18:12:38,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 18:12:38,947 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:12:38,948 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:12:38,948 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-06-05 18:12:38,948 INFO L430 AbstractCegarLoop]: === Iteration 23 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:12:38,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:12:38,948 INFO L82 PathProgramCache]: Analyzing trace with hash 421691335, now seen corresponding path program 14 times [2021-06-05 18:12:38,948 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:12:38,948 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954492026] [2021-06-05 18:12:38,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:12:38,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:12:39,457 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-05 18:12:39,605 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 18:12:41,483 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 18:12:45,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:12:45,395 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:12:45,395 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954492026] [2021-06-05 18:12:45,395 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954492026] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:12:45,395 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:12:45,395 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 18:12:45,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838781431] [2021-06-05 18:12:45,396 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 18:12:45,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:12:45,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 18:12:45,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=2554, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 18:12:45,397 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-05 18:12:49,771 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 49 [2021-06-05 18:12:50,305 WARN L205 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 18:12:50,584 WARN L205 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 69 [2021-06-05 18:12:52,687 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-06-05 18:12:52,961 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-06-05 18:12:53,249 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 68 [2021-06-05 18:12:54,196 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-05 18:12:56,121 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 18:12:58,488 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 18:13:00,715 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 18:13:01,677 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 18:13:02,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:13:02,752 INFO L93 Difference]: Finished difference Result 15042 states and 38753 transitions. [2021-06-05 18:13:02,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2021-06-05 18:13:02,753 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-05 18:13:02,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:13:02,774 INFO L225 Difference]: With dead ends: 15042 [2021-06-05 18:13:02,774 INFO L226 Difference]: Without dead ends: 14622 [2021-06-05 18:13:02,776 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4649 ImplicationChecksByTransitivity, 16258.2ms TimeCoverageRelationStatistics Valid=1609, Invalid=15421, Unknown=0, NotChecked=0, Total=17030 [2021-06-05 18:13:02,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14622 states. [2021-06-05 18:13:02,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14622 to 10006. [2021-06-05 18:13:02,905 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-05 18:13:02,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10006 states to 10006 states and 25681 transitions. [2021-06-05 18:13:02,919 INFO L78 Accepts]: Start accepts. Automaton has 10006 states and 25681 transitions. Word has length 184 [2021-06-05 18:13:02,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:13:02,920 INFO L482 AbstractCegarLoop]: Abstraction has 10006 states and 25681 transitions. [2021-06-05 18:13:02,920 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:13:02,920 INFO L276 IsEmpty]: Start isEmpty. Operand 10006 states and 25681 transitions. [2021-06-05 18:13:02,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 18:13:02,928 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:13:02,928 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:13:02,928 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-06-05 18:13:02,928 INFO L430 AbstractCegarLoop]: === Iteration 24 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:13:02,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:13:02,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1697699831, now seen corresponding path program 15 times [2021-06-05 18:13:02,929 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:13:02,929 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436579367] [2021-06-05 18:13:02,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:13:02,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:13:03,411 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-05 18:13:03,592 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 18:13:05,681 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 18:13:10,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:13:10,121 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:13:10,121 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436579367] [2021-06-05 18:13:10,121 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436579367] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:13:10,121 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:13:10,121 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 18:13:10,121 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873667709] [2021-06-05 18:13:10,122 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 18:13:10,122 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:13:10,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 18:13:10,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2555, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 18:13:10,123 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-05 18:13:12,062 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 49 [2021-06-05 18:13:12,429 WARN L205 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 18:13:12,806 WARN L205 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 69 [2021-06-05 18:13:15,128 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-06-05 18:13:15,407 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-06-05 18:13:15,736 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 68 [2021-06-05 18:13:16,914 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-05 18:13:19,730 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 18:13:22,957 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 18:13:26,015 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 18:13:27,386 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 18:13:28,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:13:28,941 INFO L93 Difference]: Finished difference Result 16996 states and 43767 transitions. [2021-06-05 18:13:28,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2021-06-05 18:13:28,942 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-05 18:13:28,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:13:28,962 INFO L225 Difference]: With dead ends: 16996 [2021-06-05 18:13:28,962 INFO L226 Difference]: Without dead ends: 16576 [2021-06-05 18:13:28,964 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4826 ImplicationChecksByTransitivity, 16340.3ms TimeCoverageRelationStatistics Valid=1646, Invalid=15910, Unknown=0, NotChecked=0, Total=17556 [2021-06-05 18:13:28,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16576 states. [2021-06-05 18:13:29,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16576 to 10110. [2021-06-05 18:13:29,111 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-05 18:13:29,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10110 states to 10110 states and 25974 transitions. [2021-06-05 18:13:29,127 INFO L78 Accepts]: Start accepts. Automaton has 10110 states and 25974 transitions. Word has length 184 [2021-06-05 18:13:29,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:13:29,127 INFO L482 AbstractCegarLoop]: Abstraction has 10110 states and 25974 transitions. [2021-06-05 18:13:29,127 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:13:29,127 INFO L276 IsEmpty]: Start isEmpty. Operand 10110 states and 25974 transitions. [2021-06-05 18:13:29,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 18:13:29,135 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:13:29,135 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:13:29,135 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-06-05 18:13:29,135 INFO L430 AbstractCegarLoop]: === Iteration 25 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:13:29,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:13:29,136 INFO L82 PathProgramCache]: Analyzing trace with hash 769432839, now seen corresponding path program 16 times [2021-06-05 18:13:29,136 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:13:29,136 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380498239] [2021-06-05 18:13:29,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:13:29,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:13:29,718 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-05 18:13:29,999 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 18:13:32,412 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2021-06-05 18:13:35,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:13:35,185 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:13:35,185 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380498239] [2021-06-05 18:13:35,186 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380498239] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:13:35,186 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:13:35,186 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 18:13:35,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544894478] [2021-06-05 18:13:35,186 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 18:13:35,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:13:35,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 18:13:35,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=2558, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 18:13:35,187 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-05 18:13:37,586 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 49 [2021-06-05 18:13:38,109 WARN L205 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 18:13:38,525 WARN L205 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 69 [2021-06-05 18:13:41,255 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-06-05 18:13:41,573 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-06-05 18:13:41,923 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 68 [2021-06-05 18:13:43,254 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-05 18:13:47,095 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 18:13:50,927 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 18:13:54,340 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 18:13:55,891 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 18:13:56,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:13:56,863 INFO L93 Difference]: Finished difference Result 16908 states and 43553 transitions. [2021-06-05 18:13:56,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2021-06-05 18:13:56,863 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-05 18:13:56,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:13:56,882 INFO L225 Difference]: With dead ends: 16908 [2021-06-05 18:13:56,882 INFO L226 Difference]: Without dead ends: 16488 [2021-06-05 18:13:56,883 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4908 ImplicationChecksByTransitivity, 16607.5ms TimeCoverageRelationStatistics Valid=1660, Invalid=16162, Unknown=0, NotChecked=0, Total=17822 [2021-06-05 18:13:56,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16488 states. [2021-06-05 18:13:57,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16488 to 10149. [2021-06-05 18:13:57,021 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-05 18:13:57,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10149 states to 10149 states and 26079 transitions. [2021-06-05 18:13:57,036 INFO L78 Accepts]: Start accepts. Automaton has 10149 states and 26079 transitions. Word has length 184 [2021-06-05 18:13:57,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:13:57,036 INFO L482 AbstractCegarLoop]: Abstraction has 10149 states and 26079 transitions. [2021-06-05 18:13:57,036 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:13:57,036 INFO L276 IsEmpty]: Start isEmpty. Operand 10149 states and 26079 transitions. [2021-06-05 18:13:57,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 18:13:57,044 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:13:57,044 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:13:57,044 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-06-05 18:13:57,045 INFO L430 AbstractCegarLoop]: === Iteration 26 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:13:57,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:13:57,045 INFO L82 PathProgramCache]: Analyzing trace with hash 495114213, now seen corresponding path program 17 times [2021-06-05 18:13:57,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:13:57,045 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061578155] [2021-06-05 18:13:57,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:13:57,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:13:57,504 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-05 18:13:57,667 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 18:13:59,023 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 18:14:01,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:14:01,711 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:14:01,711 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061578155] [2021-06-05 18:14:01,711 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061578155] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:14:01,711 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:14:01,711 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 18:14:01,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139622810] [2021-06-05 18:14:01,712 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 18:14:01,712 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:14:01,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 18:14:01,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=2560, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 18:14:01,713 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-05 18:14:04,696 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 49 [2021-06-05 18:14:05,317 WARN L205 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 18:14:05,843 WARN L205 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 69 [2021-06-05 18:14:09,104 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-06-05 18:14:09,442 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-06-05 18:14:09,890 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 68 [2021-06-05 18:14:11,542 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-05 18:14:16,724 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 18:14:20,438 WARN L205 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2021-06-05 18:14:20,944 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 18:14:23,014 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 18:14:23,968 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 18:14:24,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:14:24,823 INFO L93 Difference]: Finished difference Result 16868 states and 43463 transitions. [2021-06-05 18:14:24,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2021-06-05 18:14:24,823 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-05 18:14:24,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:14:24,845 INFO L225 Difference]: With dead ends: 16868 [2021-06-05 18:14:24,845 INFO L226 Difference]: Without dead ends: 16448 [2021-06-05 18:14:24,846 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4995 ImplicationChecksByTransitivity, 15413.5ms TimeCoverageRelationStatistics Valid=1677, Invalid=16413, Unknown=0, NotChecked=0, Total=18090 [2021-06-05 18:14:24,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16448 states. [2021-06-05 18:14:24,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16448 to 10175. [2021-06-05 18:14:24,982 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-05 18:14:24,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10175 states to 10175 states and 26149 transitions. [2021-06-05 18:14:24,998 INFO L78 Accepts]: Start accepts. Automaton has 10175 states and 26149 transitions. Word has length 184 [2021-06-05 18:14:24,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:14:24,998 INFO L482 AbstractCegarLoop]: Abstraction has 10175 states and 26149 transitions. [2021-06-05 18:14:24,998 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:14:24,999 INFO L276 IsEmpty]: Start isEmpty. Operand 10175 states and 26149 transitions. [2021-06-05 18:14:25,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 18:14:25,008 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:14:25,008 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:14:25,008 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-06-05 18:14:25,008 INFO L430 AbstractCegarLoop]: === Iteration 27 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:14:25,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:14:25,008 INFO L82 PathProgramCache]: Analyzing trace with hash 956827493, now seen corresponding path program 18 times [2021-06-05 18:14:25,008 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:14:25,009 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627862744] [2021-06-05 18:14:25,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:14:25,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:14:25,525 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-05 18:14:25,702 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 18:14:27,320 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 18:14:30,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:14:30,727 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:14:30,727 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627862744] [2021-06-05 18:14:30,728 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627862744] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:14:30,728 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:14:30,728 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 18:14:30,728 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464887458] [2021-06-05 18:14:30,728 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 18:14:30,728 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:14:30,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 18:14:30,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=2568, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 18:14:30,729 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-05 18:14:34,417 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 49 [2021-06-05 18:14:35,119 WARN L205 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 73 [2021-06-05 18:14:35,776 WARN L205 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 68 [2021-06-05 18:14:39,831 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 77 [2021-06-05 18:14:43,848 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2021-06-05 18:14:48,083 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2021-06-05 18:14:48,507 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2021-06-05 18:14:49,548 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2021-06-05 18:14:52,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:14:52,662 INFO L93 Difference]: Finished difference Result 16890 states and 43523 transitions. [2021-06-05 18:14:52,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2021-06-05 18:14:52,663 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-05 18:14:52,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:14:52,680 INFO L225 Difference]: With dead ends: 16890 [2021-06-05 18:14:52,680 INFO L226 Difference]: Without dead ends: 16470 [2021-06-05 18:14:52,681 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 19 SyntacticMatches, 5 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5185 ImplicationChecksByTransitivity, 16743.1ms TimeCoverageRelationStatistics Valid=1709, Invalid=17197, Unknown=0, NotChecked=0, Total=18906 [2021-06-05 18:14:52,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16470 states. [2021-06-05 18:14:52,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16470 to 10188. [2021-06-05 18:14:52,809 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-05 18:14:52,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10188 states to 10188 states and 26184 transitions. [2021-06-05 18:14:52,824 INFO L78 Accepts]: Start accepts. Automaton has 10188 states and 26184 transitions. Word has length 184 [2021-06-05 18:14:52,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:14:52,824 INFO L482 AbstractCegarLoop]: Abstraction has 10188 states and 26184 transitions. [2021-06-05 18:14:52,824 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:14:52,824 INFO L276 IsEmpty]: Start isEmpty. Operand 10188 states and 26184 transitions. [2021-06-05 18:14:52,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 18:14:52,832 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:14:52,832 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:14:52,833 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-06-05 18:14:52,833 INFO L430 AbstractCegarLoop]: === Iteration 28 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:14:52,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:14:52,833 INFO L82 PathProgramCache]: Analyzing trace with hash 913127371, now seen corresponding path program 19 times [2021-06-05 18:14:52,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:14:52,833 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286514346] [2021-06-05 18:14:52,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:14:52,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:14:53,371 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-05 18:14:53,622 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 18:14:55,575 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 18:14:59,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:14:59,881 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:14:59,881 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286514346] [2021-06-05 18:14:59,881 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286514346] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:14:59,881 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:14:59,881 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 18:14:59,882 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051005649] [2021-06-05 18:14:59,882 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 18:14:59,882 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:14:59,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 18:14:59,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2566, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 18:14:59,883 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-05 18:15:04,451 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 49 [2021-06-05 18:15:05,282 WARN L205 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 18:15:06,036 WARN L205 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 69 [2021-06-05 18:15:08,305 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-06-05 18:15:08,552 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-06-05 18:15:08,843 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 68 [2021-06-05 18:15:09,691 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-05 18:15:11,339 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 79 [2021-06-05 18:15:12,861 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 18:15:14,759 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2021-06-05 18:15:15,083 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 18:15:15,482 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2021-06-05 18:15:17,254 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 18:15:18,252 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 18:15:19,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:15:19,018 INFO L93 Difference]: Finished difference Result 18020 states and 46463 transitions. [2021-06-05 18:15:19,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2021-06-05 18:15:19,019 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-05 18:15:19,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:15:19,040 INFO L225 Difference]: With dead ends: 18020 [2021-06-05 18:15:19,040 INFO L226 Difference]: Without dead ends: 17600 [2021-06-05 18:15:19,042 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5259 ImplicationChecksByTransitivity, 18894.8ms TimeCoverageRelationStatistics Valid=1737, Invalid=17169, Unknown=0, NotChecked=0, Total=18906 [2021-06-05 18:15:19,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17600 states. [2021-06-05 18:15:19,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17600 to 10500. [2021-06-05 18:15:19,193 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-05 18:15:19,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10500 states to 10500 states and 27024 transitions. [2021-06-05 18:15:19,209 INFO L78 Accepts]: Start accepts. Automaton has 10500 states and 27024 transitions. Word has length 184 [2021-06-05 18:15:19,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:15:19,209 INFO L482 AbstractCegarLoop]: Abstraction has 10500 states and 27024 transitions. [2021-06-05 18:15:19,210 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:15:19,210 INFO L276 IsEmpty]: Start isEmpty. Operand 10500 states and 27024 transitions. [2021-06-05 18:15:19,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 18:15:19,218 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:15:19,218 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:15:19,219 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-06-05 18:15:19,219 INFO L430 AbstractCegarLoop]: === Iteration 29 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:15:19,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:15:19,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1490581689, now seen corresponding path program 20 times [2021-06-05 18:15:19,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:15:19,219 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515383409] [2021-06-05 18:15:19,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:15:19,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:15:19,708 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-05 18:15:19,849 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 18:15:21,680 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 18:15:25,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:15:25,817 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:15:25,817 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515383409] [2021-06-05 18:15:25,817 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515383409] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:15:25,818 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:15:25,818 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 18:15:25,818 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178877532] [2021-06-05 18:15:25,818 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 18:15:25,818 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:15:25,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 18:15:25,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2555, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 18:15:25,819 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-05 18:15:27,904 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 49 [2021-06-05 18:15:28,298 WARN L205 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 18:15:28,681 WARN L205 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 69 [2021-06-05 18:15:31,346 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-06-05 18:15:31,667 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-06-05 18:15:32,754 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-05 18:15:33,107 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-05 18:15:34,744 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 71 [2021-06-05 18:15:36,224 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 18:15:40,094 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 18:15:43,404 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 18:15:44,730 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 18:15:46,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:15:46,779 INFO L93 Difference]: Finished difference Result 15114 states and 39033 transitions. [2021-06-05 18:15:46,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2021-06-05 18:15:46,780 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-05 18:15:46,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:15:46,798 INFO L225 Difference]: With dead ends: 15114 [2021-06-05 18:15:46,799 INFO L226 Difference]: Without dead ends: 14694 [2021-06-05 18:15:46,800 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4738 ImplicationChecksByTransitivity, 16165.9ms TimeCoverageRelationStatistics Valid=1625, Invalid=15667, Unknown=0, NotChecked=0, Total=17292 [2021-06-05 18:15:46,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14694 states. [2021-06-05 18:15:46,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14694 to 10500. [2021-06-05 18:15:46,926 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-05 18:15:46,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10500 states to 10500 states and 27024 transitions. [2021-06-05 18:15:46,942 INFO L78 Accepts]: Start accepts. Automaton has 10500 states and 27024 transitions. Word has length 184 [2021-06-05 18:15:46,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:15:46,942 INFO L482 AbstractCegarLoop]: Abstraction has 10500 states and 27024 transitions. [2021-06-05 18:15:46,942 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:15:46,942 INFO L276 IsEmpty]: Start isEmpty. Operand 10500 states and 27024 transitions. [2021-06-05 18:15:46,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 18:15:46,951 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:15:46,951 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:15:46,951 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-06-05 18:15:46,951 INFO L430 AbstractCegarLoop]: === Iteration 30 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:15:46,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:15:46,952 INFO L82 PathProgramCache]: Analyzing trace with hash 473197579, now seen corresponding path program 21 times [2021-06-05 18:15:46,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:15:46,952 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937120748] [2021-06-05 18:15:46,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:15:46,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2021-06-05 18:18:54,293 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:18:54,297 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:18:54,298 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:18:54,299 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:18:54,299 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:18:54,300 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:18:54,300 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:18:54,301 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:18:54,302 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:18:54,303 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:18:54,303 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:18:54,304 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:18:54,305 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:18:54,306 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:18:54,306 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:18:54,307 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:18:54,308 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:18:54,309 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:18:54,309 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:18:54,310 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:18:54,310 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:18:54,310 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:18:54,311 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:18:54,311 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:18:54,311 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:18:54,312 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:18:54,312 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:18:54,312 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:18:54,313 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:18:54,313 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:18:54,313 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:18:54,323 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:18:54,323 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:18:54,324 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:18:54,324 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:18:54,324 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:18:54,324 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:18:54,325 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:18:54,325 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:18:54,325 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:18:54,325 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:18:54,325 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:18:54,325 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:18:54,326 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:18:54,326 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:18:54,328 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-06-05 18:18:54,328 WARN L547 AbstractCegarLoop]: Verification canceled [2021-06-05 18:18:54,328 INFO L301 ceAbstractionStarter]: Result for error location t2Thread1of1ForFork1 was TIMEOUT (3/5) [2021-06-05 18:18:54,329 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 18:18:54,330 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 18:18:54,330 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 18:18:54,330 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 18:18:54,330 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 18:18:54,330 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 18:18:54,330 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 18:18:54,330 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 18:18:54,330 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == t1======== [2021-06-05 18:18:54,337 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 247 places, 257 transitions, 536 flow [2021-06-05 18:18:54,337 WARN L547 AbstractCegarLoop]: Verification canceled [2021-06-05 18:18:54,338 INFO L301 ceAbstractionStarter]: Result for error location t1 was TIMEOUT (4/5) [2021-06-05 18:18:54,338 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 18:18:54,339 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 18:18:54,339 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 18:18:54,339 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 18:18:54,339 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 18:18:54,339 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 18:18:54,339 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 18:18:54,339 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 18:18:54,339 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == t2======== [2021-06-05 18:18:54,341 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 247 places, 257 transitions, 536 flow [2021-06-05 18:18:54,341 WARN L547 AbstractCegarLoop]: Verification canceled [2021-06-05 18:18:54,341 INFO L301 ceAbstractionStarter]: Result for error location t2 was TIMEOUT (5/5) [2021-06-05 18:18:54,341 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-05 18:18:54,343 WARN L196 ceAbstractionStarter]: Timeout [2021-06-05 18:18:54,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 06:18:54 BasicIcfg [2021-06-05 18:18:54,344 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 18:18:54,344 INFO L168 Benchmark]: Toolchain (without parser) took 780201.34 ms. Allocated memory was 354.4 MB in the beginning and 5.6 GB in the end (delta: 5.3 GB). Free memory was 315.5 MB in the beginning and 2.5 GB in the end (delta: -2.2 GB). Peak memory consumption was 3.1 GB. Max. memory is 16.0 GB. [2021-06-05 18:18:54,344 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 354.4 MB. Free memory was 334.2 MB in the beginning and 334.2 MB in the end (delta: 70.4 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 18:18:54,344 INFO L168 Benchmark]: CACSL2BoogieTranslator took 542.13 ms. Allocated memory is still 354.4 MB. Free memory was 315.3 MB in the beginning and 288.6 MB in the end (delta: 26.7 MB). Peak memory consumption was 28.3 MB. Max. memory is 16.0 GB. [2021-06-05 18:18:54,345 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.39 ms. Allocated memory is still 354.4 MB. Free memory was 288.6 MB in the beginning and 285.4 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-06-05 18:18:54,345 INFO L168 Benchmark]: Boogie Preprocessor took 56.42 ms. Allocated memory is still 354.4 MB. Free memory was 285.4 MB in the beginning and 283.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 18:18:54,345 INFO L168 Benchmark]: RCFGBuilder took 753.79 ms. Allocated memory is still 354.4 MB. Free memory was 283.3 MB in the beginning and 235.0 MB in the end (delta: 48.2 MB). Peak memory consumption was 48.2 MB. Max. memory is 16.0 GB. [2021-06-05 18:18:54,345 INFO L168 Benchmark]: TraceAbstraction took 778760.37 ms. Allocated memory was 354.4 MB in the beginning and 5.6 GB in the end (delta: 5.3 GB). Free memory was 235.0 MB in the beginning and 2.5 GB in the end (delta: -2.3 GB). Peak memory consumption was 3.0 GB. Max. memory is 16.0 GB. [2021-06-05 18:18:54,345 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 354.4 MB. Free memory was 334.2 MB in the beginning and 334.2 MB in the end (delta: 70.4 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 542.13 ms. Allocated memory is still 354.4 MB. Free memory was 315.3 MB in the beginning and 288.6 MB in the end (delta: 26.7 MB). Peak memory consumption was 28.3 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 72.39 ms. Allocated memory is still 354.4 MB. Free memory was 288.6 MB in the beginning and 285.4 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 56.42 ms. Allocated memory is still 354.4 MB. Free memory was 285.4 MB in the beginning and 283.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 753.79 ms. Allocated memory is still 354.4 MB. Free memory was 283.3 MB in the beginning and 235.0 MB in the end (delta: 48.2 MB). Peak memory consumption was 48.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 778760.37 ms. Allocated memory was 354.4 MB in the beginning and 5.6 GB in the end (delta: 5.3 GB). Free memory was 235.0 MB in the beginning and 2.5 GB in the end (delta: -2.3 GB). Peak memory consumption was 3.0 GB. Max. memory is 16.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: 23797.4ms, OverallIterations: 11, TraceHistogramMax: 1, EmptinessCheckTime: 223.0ms, AutomataDifference: 13916.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 977.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 3197 SDtfs, 11254 SDslu, 25980 SDs, 0 SdLazy, 9472 SolverSat, 549 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4256.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 331 GetRequests, 35 SyntacticMatches, 7 SemanticMatches, 289 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2424 ImplicationChecksByTransitivity, 10341.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=23654occurred in iteration=0, InterpolantAutomatonStates: 169, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 3334.8ms AutomataMinimizationTime, 11 MinimizatonAttempts, 9458 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 50.2ms SsaConstructionTime, 313.2ms SatisfiabilityAnalysisTime, 4670.0ms InterpolantComputationTime, 1166 NumberOfCodeBlocks, 1166 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1155 ConstructedInterpolants, 0 QuantifiedInterpolants, 11104 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: 919.0ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 30.9ms, AutomataDifference: 152.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 719.2ms, 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.5ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.1ms SsaConstructionTime, 2.7ms SatisfiabilityAnalysisTime, 6.3ms 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: 753860.8ms, OverallIterations: 30, TraceHistogramMax: 1, EmptinessCheckTime: 260.7ms, AutomataDifference: 434269.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 638.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 12521 SDtfs, 69359 SDslu, 295289 SDs, 0 SdLazy, 145510 SolverSat, 3554 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 177866.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3607 GetRequests, 479 SyntacticMatches, 162 SemanticMatches, 2966 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102480 ImplicationChecksByTransitivity, 352508.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=23654occurred in iteration=0, InterpolantAutomatonStates: 1873, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 4027.3ms AutomataMinimizationTime, 29 MinimizatonAttempts, 101856 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 75.7ms SsaConstructionTime, 640.5ms SatisfiabilityAnalysisTime, 126289.2ms InterpolantComputationTime, 5088 NumberOfCodeBlocks, 5088 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 5059 ConstructedInterpolants, 0 QuantifiedInterpolants, 379143 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: 8.0ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7.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.4ms, 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