/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_longer.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2abb09bbbae98a04ae2fcc735832bfdba44f6fbc-2abb09b [2021-06-05 17:57:08,768 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 17:57:08,770 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 17:57:08,800 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 17:57:08,800 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 17:57:08,803 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 17:57:08,806 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 17:57:08,812 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 17:57:08,814 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 17:57:08,820 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 17:57:08,821 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 17:57:08,822 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 17:57:08,823 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 17:57:08,825 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 17:57:08,827 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 17:57:08,828 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 17:57:08,831 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 17:57:08,832 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 17:57:08,835 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 17:57:08,839 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 17:57:08,840 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 17:57:08,842 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 17:57:08,843 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 17:57:08,845 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 17:57:08,848 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 17:57:08,849 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 17:57:08,849 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 17:57:08,850 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 17:57:08,851 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 17:57:08,851 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 17:57:08,852 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 17:57:08,853 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 17:57:08,854 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 17:57:08,854 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 17:57:08,855 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 17:57:08,856 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 17:57:08,856 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 17:57:08,856 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 17:57:08,856 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 17:57:08,857 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 17:57:08,858 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 17:57:08,860 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 17:57:08,900 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 17:57:08,900 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 17:57:08,900 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 17:57:08,900 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 17:57:08,903 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 17:57:08,903 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 17:57:08,903 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 17:57:08,903 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 17:57:08,904 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 17:57:08,904 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 17:57:08,904 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 17:57:08,905 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 17:57:08,905 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 17:57:08,905 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 17:57:08,905 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 17:57:08,905 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 17:57:08,905 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 17:57:08,905 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 17:57:08,906 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 17:57:08,906 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 17:57:08,906 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 17:57:08,906 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 17:57:08,906 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 17:57:08,906 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 17:57:08,906 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 17:57:08,906 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 17:57:08,907 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 17:57:08,907 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 17:57:08,907 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 17:57:08,907 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 17:57:08,907 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 17:57:08,907 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 17:57:09,184 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 17:57:09,206 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 17:57:09,209 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 17:57:09,210 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-05 17:57:09,212 INFO L275 PluginConnector]: CDTParser initialized [2021-06-05 17:57:09,213 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_longer.i [2021-06-05 17:57:09,269 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fe3d4576/712be3c910c6479789bacd375a5afa8e/FLAG456d0303c [2021-06-05 17:57:09,813 INFO L306 CDTParser]: Found 1 translation units. [2021-06-05 17:57:09,814 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i [2021-06-05 17:57:09,831 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fe3d4576/712be3c910c6479789bacd375a5afa8e/FLAG456d0303c [2021-06-05 17:57:10,095 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fe3d4576/712be3c910c6479789bacd375a5afa8e [2021-06-05 17:57:10,101 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 17:57:10,104 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-05 17:57:10,106 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-05 17:57:10,106 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-05 17:57:10,110 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-05 17:57:10,111 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 05:57:10" (1/1) ... [2021-06-05 17:57:10,113 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23904349 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 05:57:10, skipping insertion in model container [2021-06-05 17:57:10,113 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 05:57:10" (1/1) ... [2021-06-05 17:57:10,119 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-05 17:57:10,188 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-05 17:57:10,530 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43296,43309] [2021-06-05 17:57:10,535 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43503,43516] [2021-06-05 17:57:10,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_longer.i[43783,43796] [2021-06-05 17:57:10,541 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 17:57:10,550 INFO L203 MainTranslator]: Completed pre-run [2021-06-05 17:57:10,587 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43296,43309] [2021-06-05 17:57:10,589 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43503,43516] [2021-06-05 17:57:10,591 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43783,43796] [2021-06-05 17:57:10,593 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 17:57:10,698 INFO L208 MainTranslator]: Completed translation [2021-06-05 17:57:10,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 05:57:10 WrapperNode [2021-06-05 17:57:10,699 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-05 17:57:10,700 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 17:57:10,700 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 17:57:10,700 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 17:57:10,706 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 05:57:10" (1/1) ... [2021-06-05 17:57:10,723 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 05:57:10" (1/1) ... [2021-06-05 17:57:10,761 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 17:57:10,762 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 17:57:10,762 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 17:57:10,762 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 17:57:10,771 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 05:57:10" (1/1) ... [2021-06-05 17:57:10,771 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 05:57:10" (1/1) ... [2021-06-05 17:57:10,792 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 05:57:10" (1/1) ... [2021-06-05 17:57:10,793 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 05:57:10" (1/1) ... [2021-06-05 17:57:10,812 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 05:57:10" (1/1) ... [2021-06-05 17:57:10,819 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 05:57:10" (1/1) ... [2021-06-05 17:57:10,822 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 05:57:10" (1/1) ... [2021-06-05 17:57:10,824 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 17:57:10,825 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 17:57:10,825 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 17:57:10,825 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 17:57:10,826 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 05:57:10" (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 17:57:10,894 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2021-06-05 17:57:10,894 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2021-06-05 17:57:10,894 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2021-06-05 17:57:10,895 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2021-06-05 17:57:10,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-05 17:57:10,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-05 17:57:10,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-06-05 17:57:10,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-05 17:57:10,895 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-06-05 17:57:10,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-05 17:57:10,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 17:57:10,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 17:57:10,897 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 17:57:11,537 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 17:57:11,537 INFO L299 CfgBuilder]: Removed 18 assume(true) statements. [2021-06-05 17:57:11,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 05:57:11 BoogieIcfgContainer [2021-06-05 17:57:11,539 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 17:57:11,541 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 17:57:11,541 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 17:57:11,543 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 17:57:11,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.06 05:57:10" (1/3) ... [2021-06-05 17:57:11,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50344b99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 05:57:11, skipping insertion in model container [2021-06-05 17:57:11,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 05:57:10" (2/3) ... [2021-06-05 17:57:11,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50344b99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 05:57:11, skipping insertion in model container [2021-06-05 17:57:11,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 05:57:11" (3/3) ... [2021-06-05 17:57:11,546 INFO L111 eAbstractionObserver]: Analyzing ICFG queue_longer.i [2021-06-05 17:57:11,551 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 17:57:11,552 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 17:57:11,552 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2021-06-05 17:57:11,553 INFO L471 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 17:57:11,609 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,610 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,610 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,610 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,610 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,610 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,610 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,611 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,611 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,611 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,611 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,611 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,611 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,612 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,612 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,612 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,612 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,612 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,612 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,613 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,613 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,613 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,613 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,613 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,613 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,613 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,613 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,614 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,614 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,614 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,614 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,614 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,614 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,615 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,615 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,615 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,615 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,615 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,615 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,615 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,615 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,616 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,616 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,616 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,616 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,616 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,616 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,616 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,616 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,616 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,617 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,617 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,617 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,617 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,617 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,617 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,617 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,618 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,618 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,618 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,618 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,618 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,618 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,618 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,618 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,619 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,619 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,619 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,619 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,619 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,619 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,620 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,620 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,620 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,620 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,620 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,620 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,620 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,621 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,621 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,621 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,621 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,621 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,621 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,621 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,621 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,622 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,622 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,622 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,622 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,622 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,622 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,622 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,623 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,623 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,623 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,623 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,623 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,623 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,623 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,624 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,624 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,624 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,624 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,624 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,624 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,624 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,625 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,625 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,625 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,625 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,625 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,625 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,625 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,626 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,626 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,626 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,626 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,626 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,626 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,626 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,627 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,627 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,627 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,627 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,627 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,627 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,627 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,628 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,628 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,628 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,628 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,628 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,628 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,628 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,629 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,629 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,629 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,629 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,629 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,629 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,629 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,630 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,630 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,630 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,630 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,630 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,630 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,630 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,631 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,631 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,631 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,631 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,631 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,631 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,632 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,632 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,632 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,632 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,632 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,633 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,633 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,633 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,633 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,633 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,633 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,633 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,633 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,634 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,634 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,634 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,634 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,634 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,635 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,635 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,635 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,635 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,635 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,635 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,635 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,636 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,636 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,636 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,636 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,636 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,636 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,637 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,637 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,637 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,637 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,637 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,637 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,638 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,638 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,638 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,638 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,638 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,638 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,638 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,639 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,639 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,639 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,639 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,639 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,639 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,639 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,640 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,640 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,640 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,640 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,640 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,640 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,641 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,641 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,641 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,641 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,641 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,641 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,641 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,642 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,642 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,642 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,642 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,642 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,642 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,643 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,643 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,643 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,643 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,643 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,643 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,643 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,644 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,644 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,644 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,644 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,644 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,644 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,645 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,645 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,645 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,645 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,645 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,645 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,646 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,646 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,646 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,646 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,646 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,646 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,646 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,647 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,647 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,647 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,647 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,647 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,647 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,647 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,648 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,648 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,648 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,648 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,648 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,648 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,648 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,649 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,649 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,649 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,649 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,649 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,649 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,649 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,650 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,650 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,650 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,650 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,650 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,650 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,650 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,650 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,651 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,651 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,651 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,651 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,651 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,651 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,651 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,651 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,652 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,652 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,652 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,652 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,653 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,653 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,653 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,653 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,653 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,653 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,653 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,654 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,654 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,654 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,654 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,654 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,654 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,654 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,655 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,655 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,655 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,655 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,655 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,655 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,656 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,656 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,656 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,656 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,656 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,656 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,657 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,657 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,657 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,657 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,657 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,657 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,658 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,658 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,658 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,658 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,658 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,658 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,658 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,659 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,659 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,659 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,659 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,659 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,659 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,660 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,660 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,660 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,660 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,660 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,660 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,661 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,661 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,661 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,661 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,661 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,662 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,662 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,662 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,662 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,662 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,662 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,663 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,663 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,663 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,663 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,663 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,663 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,663 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,664 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,664 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,664 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,664 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,664 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,665 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,665 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,665 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,665 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,665 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,665 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,665 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,666 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,666 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,666 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,666 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,666 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,666 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,666 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,667 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,667 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,667 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,667 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,667 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,667 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,667 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,667 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,709 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,709 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,709 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,709 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,710 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,710 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,710 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,710 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,710 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,710 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,710 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,710 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,711 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,711 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,711 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,711 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,711 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,711 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,711 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,711 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,712 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,712 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,712 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,712 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,712 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,712 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,712 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,713 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,713 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,713 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,713 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,713 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,713 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,713 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,713 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,714 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,714 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,714 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,714 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,714 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,714 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,714 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,714 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,714 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,714 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,715 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,715 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,715 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,715 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,715 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,715 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,715 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,715 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,715 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,715 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,716 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,716 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,716 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,716 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,716 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,716 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,716 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,716 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,716 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,716 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,717 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,717 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,717 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,717 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,717 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,717 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,717 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,717 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,717 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,718 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,718 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,718 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,718 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,718 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,718 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,718 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,718 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,718 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,719 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,719 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,719 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,719 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,719 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,719 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,719 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,719 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,720 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,720 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,720 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,720 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,720 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,720 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,720 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,720 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,720 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,721 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,721 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,721 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,721 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,721 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,721 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,721 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,721 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,721 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,722 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,722 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,722 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,722 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,722 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,722 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,722 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,722 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,722 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,723 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,723 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,723 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,723 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,723 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,723 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,723 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,723 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,724 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,724 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,724 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,724 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,724 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,724 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,724 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,737 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,737 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,737 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,737 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,737 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,737 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,738 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,738 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,738 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,738 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,738 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,738 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,738 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,738 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,738 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,739 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,739 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,739 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,739 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,739 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,739 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,739 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,739 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,740 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,740 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,740 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,740 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,740 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,740 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,740 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,741 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,741 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,741 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,741 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,741 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,741 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,741 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,741 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,741 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,742 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,742 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,742 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,742 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,742 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,742 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,742 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,742 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,744 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,745 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,745 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,745 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,745 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,745 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,745 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,745 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,746 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,746 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,746 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,746 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,746 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,746 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,746 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,746 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,747 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,747 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,747 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,747 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,747 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,747 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,747 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,747 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,747 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,748 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,748 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,748 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,748 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,748 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,748 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,748 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,748 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,749 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,749 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,777 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,778 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,778 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,778 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,778 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,778 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,778 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,778 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,778 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,778 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,779 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,779 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,779 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,779 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,779 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,779 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,779 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,779 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,779 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,779 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,780 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,780 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:57:11,786 INFO L149 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2021-06-05 17:57:11,804 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 17:57:11,820 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 17:57:11,820 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 17:57:11,820 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 17:57:11,821 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 17:57:11,821 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 17:57:11,821 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 17:57:11,821 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 17:57:11,821 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == t1Thread1of1ForFork0======== [2021-06-05 17:57:11,840 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 247 places, 257 transitions, 536 flow [2021-06-05 17:57:12,886 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 17:57:12,979 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 17:57:13,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-06-05 17:57:13,036 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:57:13,037 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 17:57:13,037 INFO L430 AbstractCegarLoop]: === Iteration 1 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:57:13,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:57:13,047 INFO L82 PathProgramCache]: Analyzing trace with hash -383819529, now seen corresponding path program 1 times [2021-06-05 17:57:13,054 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:57:13,056 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587688621] [2021-06-05 17:57:13,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:57:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:57:13,578 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 17:57:13,579 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:57:13,579 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587688621] [2021-06-05 17:57:13,579 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587688621] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:57:13,580 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:57:13,580 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-05 17:57:13,580 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695099967] [2021-06-05 17:57:13,584 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 17:57:13,584 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:57:13,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 17:57:13,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-06-05 17:57:13,629 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 17:57:14,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:57:14,295 INFO L93 Difference]: Finished difference Result 23003 states and 64256 transitions. [2021-06-05 17:57:14,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 17:57:14,297 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 17:57:14,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:57:14,373 INFO L225 Difference]: With dead ends: 23003 [2021-06-05 17:57:14,373 INFO L226 Difference]: Without dead ends: 12639 [2021-06-05 17:57:14,374 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 341.9ms TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420 [2021-06-05 17:57:14,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12639 states. [2021-06-05 17:57:14,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12639 to 12639. [2021-06-05 17:57:14,957 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 17:57:15,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12639 states to 12639 states and 35171 transitions. [2021-06-05 17:57:15,015 INFO L78 Accepts]: Start accepts. Automaton has 12639 states and 35171 transitions. Word has length 83 [2021-06-05 17:57:15,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:57:15,016 INFO L482 AbstractCegarLoop]: Abstraction has 12639 states and 35171 transitions. [2021-06-05 17:57:15,016 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 17:57:15,017 INFO L276 IsEmpty]: Start isEmpty. Operand 12639 states and 35171 transitions. [2021-06-05 17:57:15,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-06-05 17:57:15,023 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:57:15,024 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 17:57:15,024 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 17:57:15,024 INFO L430 AbstractCegarLoop]: === Iteration 2 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:57:15,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:57:15,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1409373696, now seen corresponding path program 1 times [2021-06-05 17:57:15,025 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:57:15,025 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402211815] [2021-06-05 17:57:15,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:57:15,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:57:15,094 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 17:57:15,094 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:57:15,094 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402211815] [2021-06-05 17:57:15,095 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402211815] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:57:15,095 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:57:15,095 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 17:57:15,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170172825] [2021-06-05 17:57:15,096 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 17:57:15,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:57:15,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 17:57:15,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 17:57:15,097 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 17:57:15,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:57:15,198 INFO L93 Difference]: Finished difference Result 12422 states and 34356 transitions. [2021-06-05 17:57:15,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 17:57:15,199 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 17:57:15,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:57:15,344 INFO L225 Difference]: With dead ends: 12422 [2021-06-05 17:57:15,344 INFO L226 Difference]: Without dead ends: 12422 [2021-06-05 17:57:15,345 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 17:57:15,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12422 states. [2021-06-05 17:57:15,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12422 to 12422. [2021-06-05 17:57:15,788 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 17:57:15,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12422 states to 12422 states and 34356 transitions. [2021-06-05 17:57:15,848 INFO L78 Accepts]: Start accepts. Automaton has 12422 states and 34356 transitions. Word has length 84 [2021-06-05 17:57:15,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:57:15,851 INFO L482 AbstractCegarLoop]: Abstraction has 12422 states and 34356 transitions. [2021-06-05 17:57:15,851 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 17:57:15,852 INFO L276 IsEmpty]: Start isEmpty. Operand 12422 states and 34356 transitions. [2021-06-05 17:57:15,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-06-05 17:57:15,867 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:57:15,867 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 17:57:15,868 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 17:57:15,868 INFO L430 AbstractCegarLoop]: === Iteration 3 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:57:15,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:57:15,876 INFO L82 PathProgramCache]: Analyzing trace with hash -477175304, now seen corresponding path program 1 times [2021-06-05 17:57:15,876 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:57:15,877 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443322815] [2021-06-05 17:57:15,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:57:15,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:57:16,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 17:57:16,002 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:57:16,003 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443322815] [2021-06-05 17:57:16,003 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443322815] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:57:16,003 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:57:16,003 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 17:57:16,003 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872038450] [2021-06-05 17:57:16,004 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 17:57:16,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:57:16,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 17:57:16,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 17:57:16,005 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 17:57:16,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:57:16,094 INFO L93 Difference]: Finished difference Result 13073 states and 35933 transitions. [2021-06-05 17:57:16,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 17:57:16,094 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 17:57:16,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:57:16,126 INFO L225 Difference]: With dead ends: 13073 [2021-06-05 17:57:16,126 INFO L226 Difference]: Without dead ends: 11771 [2021-06-05 17:57:16,127 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 17:57:16,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11771 states. [2021-06-05 17:57:16,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11771 to 11771. [2021-06-05 17:57:16,480 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 17:57:16,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11771 states to 11771 states and 32345 transitions. [2021-06-05 17:57:16,544 INFO L78 Accepts]: Start accepts. Automaton has 11771 states and 32345 transitions. Word has length 99 [2021-06-05 17:57:16,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:57:16,545 INFO L482 AbstractCegarLoop]: Abstraction has 11771 states and 32345 transitions. [2021-06-05 17:57:16,545 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 17:57:16,545 INFO L276 IsEmpty]: Start isEmpty. Operand 11771 states and 32345 transitions. [2021-06-05 17:57:16,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-06-05 17:57:16,562 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:57:16,562 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 17:57:16,563 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 17:57:16,563 INFO L430 AbstractCegarLoop]: === Iteration 4 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:57:16,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:57:16,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1731505684, now seen corresponding path program 1 times [2021-06-05 17:57:16,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:57:16,566 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649861724] [2021-06-05 17:57:16,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:57:16,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:57:17,034 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 17:57:17,035 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:57:17,035 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649861724] [2021-06-05 17:57:17,035 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649861724] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:57:17,035 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:57:17,035 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-06-05 17:57:17,035 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477358366] [2021-06-05 17:57:17,036 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 17:57:17,036 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:57:17,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 17:57:17,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2021-06-05 17:57:17,038 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 17:57:18,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:57:18,041 INFO L93 Difference]: Finished difference Result 12185 states and 33496 transitions. [2021-06-05 17:57:18,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 17:57:18,041 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 17:57:18,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:57:18,072 INFO L225 Difference]: With dead ends: 12185 [2021-06-05 17:57:18,073 INFO L226 Difference]: Without dead ends: 12185 [2021-06-05 17:57:18,073 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 631.5ms TimeCoverageRelationStatistics Valid=223, Invalid=533, Unknown=0, NotChecked=0, Total=756 [2021-06-05 17:57:18,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12185 states. [2021-06-05 17:57:18,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12185 to 11973. [2021-06-05 17:57:18,409 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 17:57:18,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11973 states to 11973 states and 32908 transitions. [2021-06-05 17:57:18,436 INFO L78 Accepts]: Start accepts. Automaton has 11973 states and 32908 transitions. Word has length 100 [2021-06-05 17:57:18,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:57:18,438 INFO L482 AbstractCegarLoop]: Abstraction has 11973 states and 32908 transitions. [2021-06-05 17:57:18,438 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 17:57:18,438 INFO L276 IsEmpty]: Start isEmpty. Operand 11973 states and 32908 transitions. [2021-06-05 17:57:18,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-06-05 17:57:18,456 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:57:18,457 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 17:57:18,457 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-05 17:57:18,457 INFO L430 AbstractCegarLoop]: === Iteration 5 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:57:18,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:57:18,458 INFO L82 PathProgramCache]: Analyzing trace with hash 588694202, now seen corresponding path program 1 times [2021-06-05 17:57:18,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:57:18,458 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042220426] [2021-06-05 17:57:18,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:57:18,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:57:19,252 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 17:57:19,253 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:57:19,253 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042220426] [2021-06-05 17:57:19,253 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042220426] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:57:19,253 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:57:19,253 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-06-05 17:57:19,253 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372397621] [2021-06-05 17:57:19,254 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-06-05 17:57:19,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:57:19,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-06-05 17:57:19,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=628, Unknown=0, NotChecked=0, Total=702 [2021-06-05 17:57:19,255 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 17:57:20,842 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 56 [2021-06-05 17:57:21,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:57:21,733 INFO L93 Difference]: Finished difference Result 12135 states and 33184 transitions. [2021-06-05 17:57:21,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-06-05 17:57:21,733 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 17:57:21,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:57:21,764 INFO L225 Difference]: With dead ends: 12135 [2021-06-05 17:57:21,764 INFO L226 Difference]: Without dead ends: 11918 [2021-06-05 17:57:21,765 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 1971.8ms TimeCoverageRelationStatistics Valid=466, Invalid=1984, Unknown=0, NotChecked=0, Total=2450 [2021-06-05 17:57:21,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11918 states. [2021-06-05 17:57:21,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11918 to 11918. [2021-06-05 17:57:22,013 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 17:57:22,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11918 states to 11918 states and 32798 transitions. [2021-06-05 17:57:22,193 INFO L78 Accepts]: Start accepts. Automaton has 11918 states and 32798 transitions. Word has length 104 [2021-06-05 17:57:22,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:57:22,193 INFO L482 AbstractCegarLoop]: Abstraction has 11918 states and 32798 transitions. [2021-06-05 17:57:22,193 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 17:57:22,193 INFO L276 IsEmpty]: Start isEmpty. Operand 11918 states and 32798 transitions. [2021-06-05 17:57:22,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 17:57:22,207 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:57:22,207 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 17:57:22,207 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-05 17:57:22,207 INFO L430 AbstractCegarLoop]: === Iteration 6 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:57:22,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:57:22,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1887066075, now seen corresponding path program 1 times [2021-06-05 17:57:22,208 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:57:22,208 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830616514] [2021-06-05 17:57:22,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:57:22,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:57:22,666 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 17:57:22,667 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:57:22,667 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830616514] [2021-06-05 17:57:22,667 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830616514] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:57:22,667 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:57:22,667 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-06-05 17:57:22,667 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31528824] [2021-06-05 17:57:22,668 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 17:57:22,668 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:57:22,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 17:57:22,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2021-06-05 17:57:22,669 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 17:57:23,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:57:23,858 INFO L93 Difference]: Finished difference Result 16890 states and 46551 transitions. [2021-06-05 17:57:23,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 17:57:23,858 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 17:57:23,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:57:23,886 INFO L225 Difference]: With dead ends: 16890 [2021-06-05 17:57:23,886 INFO L226 Difference]: Without dead ends: 16890 [2021-06-05 17:57:23,887 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 778.5ms TimeCoverageRelationStatistics Valid=313, Invalid=947, Unknown=0, NotChecked=0, Total=1260 [2021-06-05 17:57:23,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16890 states. [2021-06-05 17:57:24,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16890 to 14265. [2021-06-05 17:57:24,180 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 17:57:24,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14265 states to 14265 states and 39281 transitions. [2021-06-05 17:57:24,212 INFO L78 Accepts]: Start accepts. Automaton has 14265 states and 39281 transitions. Word has length 105 [2021-06-05 17:57:24,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:57:24,212 INFO L482 AbstractCegarLoop]: Abstraction has 14265 states and 39281 transitions. [2021-06-05 17:57:24,213 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 17:57:24,213 INFO L276 IsEmpty]: Start isEmpty. Operand 14265 states and 39281 transitions. [2021-06-05 17:57:24,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 17:57:24,229 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:57:24,229 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 17:57:24,229 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-05 17:57:24,229 INFO L430 AbstractCegarLoop]: === Iteration 7 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:57:24,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:57:24,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1261951723, now seen corresponding path program 2 times [2021-06-05 17:57:24,230 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:57:24,231 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702652934] [2021-06-05 17:57:24,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:57:24,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:57:25,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 17:57:25,071 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:57:25,072 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702652934] [2021-06-05 17:57:25,072 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702652934] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:57:25,072 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:57:25,072 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-06-05 17:57:25,072 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786825632] [2021-06-05 17:57:25,072 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 17:57:25,073 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:57:25,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 17:57:25,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2021-06-05 17:57:25,073 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 17:57:27,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:57:27,689 INFO L93 Difference]: Finished difference Result 20474 states and 56144 transitions. [2021-06-05 17:57:27,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-06-05 17:57:27,690 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 17:57:27,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:57:27,716 INFO L225 Difference]: With dead ends: 20474 [2021-06-05 17:57:27,716 INFO L226 Difference]: Without dead ends: 19953 [2021-06-05 17:57:27,717 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 2131.0ms TimeCoverageRelationStatistics Valid=519, Invalid=2031, Unknown=0, NotChecked=0, Total=2550 [2021-06-05 17:57:27,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19953 states. [2021-06-05 17:57:28,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19953 to 16773. [2021-06-05 17:57:28,135 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 17:57:28,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16773 states to 16773 states and 46324 transitions. [2021-06-05 17:57:28,174 INFO L78 Accepts]: Start accepts. Automaton has 16773 states and 46324 transitions. Word has length 105 [2021-06-05 17:57:28,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:57:28,174 INFO L482 AbstractCegarLoop]: Abstraction has 16773 states and 46324 transitions. [2021-06-05 17:57:28,174 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 17:57:28,174 INFO L276 IsEmpty]: Start isEmpty. Operand 16773 states and 46324 transitions. [2021-06-05 17:57:28,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-06-05 17:57:28,193 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:57:28,193 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 17:57:28,193 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-05 17:57:28,193 INFO L430 AbstractCegarLoop]: === Iteration 8 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:57:28,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:57:28,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1732922443, now seen corresponding path program 1 times [2021-06-05 17:57:28,194 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:57:28,194 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690812160] [2021-06-05 17:57:28,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:57:28,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:57:29,058 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 17:57:29,058 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:57:29,058 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690812160] [2021-06-05 17:57:29,058 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690812160] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:57:29,058 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:57:29,058 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-06-05 17:57:29,059 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799371586] [2021-06-05 17:57:29,059 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-06-05 17:57:29,059 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:57:29,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-06-05 17:57:29,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=785, Unknown=0, NotChecked=0, Total=870 [2021-06-05 17:57:29,060 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 17:57:32,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:57:32,166 INFO L93 Difference]: Finished difference Result 20614 states and 56541 transitions. [2021-06-05 17:57:32,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-05 17:57:32,166 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 17:57:32,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:57:32,191 INFO L225 Difference]: With dead ends: 20614 [2021-06-05 17:57:32,192 INFO L226 Difference]: Without dead ends: 19688 [2021-06-05 17:57:32,193 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 2178.3ms TimeCoverageRelationStatistics Valid=542, Invalid=2320, Unknown=0, NotChecked=0, Total=2862 [2021-06-05 17:57:32,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19688 states. [2021-06-05 17:57:32,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19688 to 16940. [2021-06-05 17:57:32,589 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 17:57:32,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16940 states to 16940 states and 46810 transitions. [2021-06-05 17:57:32,629 INFO L78 Accepts]: Start accepts. Automaton has 16940 states and 46810 transitions. Word has length 109 [2021-06-05 17:57:32,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:57:32,629 INFO L482 AbstractCegarLoop]: Abstraction has 16940 states and 46810 transitions. [2021-06-05 17:57:32,629 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 17:57:32,629 INFO L276 IsEmpty]: Start isEmpty. Operand 16940 states and 46810 transitions. [2021-06-05 17:57:32,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-06-05 17:57:32,646 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:57:32,646 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 17:57:32,646 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-05 17:57:32,646 INFO L430 AbstractCegarLoop]: === Iteration 9 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:57:32,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:57:32,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1462976531, now seen corresponding path program 2 times [2021-06-05 17:57:32,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:57:32,647 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723803727] [2021-06-05 17:57:32,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:57:32,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:57:33,504 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 17:57:33,505 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:57:33,505 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723803727] [2021-06-05 17:57:33,505 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723803727] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:57:33,505 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:57:33,505 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-06-05 17:57:33,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248579650] [2021-06-05 17:57:33,506 INFO L462 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-06-05 17:57:33,506 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:57:33,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-06-05 17:57:33,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=733, Unknown=0, NotChecked=0, Total=812 [2021-06-05 17:57:33,507 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 17:57:34,852 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 55 [2021-06-05 17:57:36,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:57:36,614 INFO L93 Difference]: Finished difference Result 17603 states and 48359 transitions. [2021-06-05 17:57:36,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-06-05 17:57:36,614 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 17:57:36,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:57:36,636 INFO L225 Difference]: With dead ends: 17603 [2021-06-05 17:57:36,637 INFO L226 Difference]: Without dead ends: 17217 [2021-06-05 17:57:36,638 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 2471.2ms TimeCoverageRelationStatistics Valid=581, Invalid=2389, Unknown=0, NotChecked=0, Total=2970 [2021-06-05 17:57:36,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17217 states. [2021-06-05 17:57:36,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17217 to 16732. [2021-06-05 17:57:37,018 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 17:57:37,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16732 states to 16732 states and 46263 transitions. [2021-06-05 17:57:37,051 INFO L78 Accepts]: Start accepts. Automaton has 16732 states and 46263 transitions. Word has length 109 [2021-06-05 17:57:37,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:57:37,051 INFO L482 AbstractCegarLoop]: Abstraction has 16732 states and 46263 transitions. [2021-06-05 17:57:37,051 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 17:57:37,051 INFO L276 IsEmpty]: Start isEmpty. Operand 16732 states and 46263 transitions. [2021-06-05 17:57:37,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-06-05 17:57:37,070 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:57:37,071 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 17:57:37,071 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-05 17:57:37,071 INFO L430 AbstractCegarLoop]: === Iteration 10 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:57:37,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:57:37,072 INFO L82 PathProgramCache]: Analyzing trace with hash -91066704, now seen corresponding path program 1 times [2021-06-05 17:57:37,072 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:57:37,072 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277903029] [2021-06-05 17:57:37,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:57:37,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:57:37,108 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 17:57:37,108 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:57:37,108 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277903029] [2021-06-05 17:57:37,108 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277903029] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:57:37,109 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:57:37,109 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 17:57:37,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435779281] [2021-06-05 17:57:37,109 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 17:57:37,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:57:37,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 17:57:37,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 17:57:37,110 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 17:57:37,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:57:37,136 INFO L93 Difference]: Finished difference Result 4749 states and 12040 transitions. [2021-06-05 17:57:37,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 17:57:37,137 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 17:57:37,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:57:37,141 INFO L225 Difference]: With dead ends: 4749 [2021-06-05 17:57:37,141 INFO L226 Difference]: Without dead ends: 2943 [2021-06-05 17:57:37,142 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 17:57:37,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2943 states. [2021-06-05 17:57:37,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2943 to 2735. [2021-06-05 17:57:37,181 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 17:57:37,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2735 states to 2735 states and 6939 transitions. [2021-06-05 17:57:37,187 INFO L78 Accepts]: Start accepts. Automaton has 2735 states and 6939 transitions. Word has length 126 [2021-06-05 17:57:37,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:57:37,188 INFO L482 AbstractCegarLoop]: Abstraction has 2735 states and 6939 transitions. [2021-06-05 17:57:37,188 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 17:57:37,188 INFO L276 IsEmpty]: Start isEmpty. Operand 2735 states and 6939 transitions. [2021-06-05 17:57:37,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-06-05 17:57:37,192 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:57:37,192 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 17:57:37,192 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-05 17:57:37,192 INFO L430 AbstractCegarLoop]: === Iteration 11 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:57:37,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:57:37,192 INFO L82 PathProgramCache]: Analyzing trace with hash 116634820, now seen corresponding path program 1 times [2021-06-05 17:57:37,193 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:57:37,193 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468823976] [2021-06-05 17:57:37,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:57:37,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:57:37,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 17:57:37,235 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:57:37,235 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468823976] [2021-06-05 17:57:37,235 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468823976] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:57:37,235 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:57:37,235 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 17:57:37,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247520800] [2021-06-05 17:57:37,235 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 17:57:37,235 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:57:37,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 17:57:37,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 17:57:37,236 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 17:57:37,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:57:37,239 INFO L93 Difference]: Finished difference Result 253 states and 535 transitions. [2021-06-05 17:57:37,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 17:57:37,240 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 17:57:37,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:57:37,240 INFO L225 Difference]: With dead ends: 253 [2021-06-05 17:57:37,240 INFO L226 Difference]: Without dead ends: 0 [2021-06-05 17:57:37,240 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 17:57:37,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-05 17:57:37,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-05 17:57:37,241 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 17:57:37,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-05 17:57:37,241 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 142 [2021-06-05 17:57:37,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:57:37,241 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-05 17:57:37,241 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 17:57:37,241 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-05 17:57:37,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-05 17:57:37,241 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-05 17:57:37,242 INFO L301 ceAbstractionStarter]: Result for error location t1Thread1of1ForFork0 was SAFE (1/5) [2021-06-05 17:57:37,244 INFO L255 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-06-05 17:57:37,244 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 17:57:37,244 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 17:57:37,244 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 17:57:37,244 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 17:57:37,244 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 17:57:37,245 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 17:57:37,245 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 17:57:37,245 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-06-05 17:57:37,248 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 247 places, 257 transitions, 536 flow [2021-06-05 17:57:38,097 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 17:57:38,125 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 17:57:38,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-06-05 17:57:38,126 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:57:38,126 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 17:57:38,126 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:57:38,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:57:38,126 INFO L82 PathProgramCache]: Analyzing trace with hash 617310073, now seen corresponding path program 1 times [2021-06-05 17:57:38,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:57:38,126 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941361827] [2021-06-05 17:57:38,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:57:38,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:57:38,141 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 17:57:38,141 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:57:38,141 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941361827] [2021-06-05 17:57:38,142 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941361827] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:57:38,142 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:57:38,142 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 17:57:38,142 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704734487] [2021-06-05 17:57:38,142 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-05 17:57:38,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:57:38,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-05 17:57:38,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 17:57:38,176 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 17:57:38,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:57:38,263 INFO L93 Difference]: Finished difference Result 23006 states and 64260 transitions. [2021-06-05 17:57:38,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-05 17:57:38,263 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 17:57:38,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:57:38,263 INFO L225 Difference]: With dead ends: 23006 [2021-06-05 17:57:38,263 INFO L226 Difference]: Without dead ends: 0 [2021-06-05 17:57:38,263 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 17:57:38,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-05 17:57:38,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-05 17:57:38,264 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 17:57:38,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-05 17:57:38,264 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2021-06-05 17:57:38,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:57:38,264 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-05 17:57:38,264 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 17:57:38,264 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-05 17:57:38,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-05 17:57:38,264 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-05 17:57:38,265 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE (2/5) [2021-06-05 17:57:38,265 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 17:57:38,266 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 17:57:38,266 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 17:57:38,266 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 17:57:38,266 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 17:57:38,266 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 17:57:38,266 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 17:57:38,266 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 17:57:38,266 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == t2Thread1of1ForFork1======== [2021-06-05 17:57:38,268 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 247 places, 257 transitions, 536 flow [2021-06-05 17:57:38,969 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 17:57:38,999 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 17:57:39,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-06-05 17:57:39,007 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:57:39,007 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 17:57:39,007 INFO L430 AbstractCegarLoop]: === Iteration 1 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:57:39,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:57:39,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1979063990, now seen corresponding path program 1 times [2021-06-05 17:57:39,008 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:57:39,008 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752040209] [2021-06-05 17:57:39,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:57:39,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:57:39,116 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 17:57:39,116 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:57:39,116 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752040209] [2021-06-05 17:57:39,116 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752040209] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:57:39,117 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:57:39,117 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-05 17:57:39,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745414613] [2021-06-05 17:57:39,117 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 17:57:39,117 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:57:39,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 17:57:39,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-06-05 17:57:39,152 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 17:57:39,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:57:39,657 INFO L93 Difference]: Finished difference Result 23003 states and 64256 transitions. [2021-06-05 17:57:39,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 17:57:39,658 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 17:57:39,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:57:39,693 INFO L225 Difference]: With dead ends: 23003 [2021-06-05 17:57:39,693 INFO L226 Difference]: Without dead ends: 21410 [2021-06-05 17:57:39,694 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 264.1ms TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420 [2021-06-05 17:57:39,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21410 states. [2021-06-05 17:57:40,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21410 to 21410. [2021-06-05 17:57:40,174 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 17:57:40,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21410 states to 21410 states and 60058 transitions. [2021-06-05 17:57:40,216 INFO L78 Accepts]: Start accepts. Automaton has 21410 states and 60058 transitions. Word has length 92 [2021-06-05 17:57:40,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:57:40,216 INFO L482 AbstractCegarLoop]: Abstraction has 21410 states and 60058 transitions. [2021-06-05 17:57:40,216 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 17:57:40,216 INFO L276 IsEmpty]: Start isEmpty. Operand 21410 states and 60058 transitions. [2021-06-05 17:57:40,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-06-05 17:57:40,221 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:57:40,221 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 17:57:40,221 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-05 17:57:40,221 INFO L430 AbstractCegarLoop]: === Iteration 2 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:57:40,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:57:40,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1743993907, now seen corresponding path program 1 times [2021-06-05 17:57:40,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:57:40,222 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992729328] [2021-06-05 17:57:40,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:57:40,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:57:40,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 17:57:40,252 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:57:40,252 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992729328] [2021-06-05 17:57:40,252 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992729328] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:57:40,252 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:57:40,252 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 17:57:40,252 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608145251] [2021-06-05 17:57:40,252 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 17:57:40,253 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:57:40,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 17:57:40,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 17:57:40,253 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 17:57:40,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:57:40,311 INFO L93 Difference]: Finished difference Result 14550 states and 40132 transitions. [2021-06-05 17:57:40,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 17:57:40,312 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 17:57:40,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:57:40,333 INFO L225 Difference]: With dead ends: 14550 [2021-06-05 17:57:40,333 INFO L226 Difference]: Without dead ends: 14107 [2021-06-05 17:57:40,334 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 17:57:40,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14107 states. [2021-06-05 17:57:40,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14107 to 14107. [2021-06-05 17:57:40,586 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 17:57:40,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14107 states to 14107 states and 38914 transitions. [2021-06-05 17:57:40,618 INFO L78 Accepts]: Start accepts. Automaton has 14107 states and 38914 transitions. Word has length 93 [2021-06-05 17:57:40,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:57:40,619 INFO L482 AbstractCegarLoop]: Abstraction has 14107 states and 38914 transitions. [2021-06-05 17:57:40,619 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 17:57:40,619 INFO L276 IsEmpty]: Start isEmpty. Operand 14107 states and 38914 transitions. [2021-06-05 17:57:40,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-06-05 17:57:40,631 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:57:40,632 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 17:57:40,632 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-05 17:57:40,632 INFO L430 AbstractCegarLoop]: === Iteration 3 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:57:40,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:57:40,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1365563195, now seen corresponding path program 1 times [2021-06-05 17:57:40,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:57:40,633 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125946910] [2021-06-05 17:57:40,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:57:40,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:57:40,664 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 17:57:40,665 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:57:40,665 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125946910] [2021-06-05 17:57:40,665 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125946910] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:57:40,665 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:57:40,665 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 17:57:40,665 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799412707] [2021-06-05 17:57:40,665 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 17:57:40,665 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:57:40,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 17:57:40,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 17:57:40,666 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 17:57:40,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:57:40,706 INFO L93 Difference]: Finished difference Result 6968 states and 17928 transitions. [2021-06-05 17:57:40,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 17:57:40,707 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 17:57:40,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:57:40,716 INFO L225 Difference]: With dead ends: 6968 [2021-06-05 17:57:40,717 INFO L226 Difference]: Without dead ends: 6968 [2021-06-05 17:57:40,718 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 17:57:40,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6968 states. [2021-06-05 17:57:40,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6968 to 5714. [2021-06-05 17:57:40,809 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 17:57:40,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5714 states to 5714 states and 14722 transitions. [2021-06-05 17:57:40,822 INFO L78 Accepts]: Start accepts. Automaton has 5714 states and 14722 transitions. Word has length 171 [2021-06-05 17:57:40,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:57:40,822 INFO L482 AbstractCegarLoop]: Abstraction has 5714 states and 14722 transitions. [2021-06-05 17:57:40,822 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 17:57:40,822 INFO L276 IsEmpty]: Start isEmpty. Operand 5714 states and 14722 transitions. [2021-06-05 17:57:40,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2021-06-05 17:57:40,830 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:57:40,830 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 17:57:40,830 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-05 17:57:40,830 INFO L430 AbstractCegarLoop]: === Iteration 4 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:57:40,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:57:40,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1471191579, now seen corresponding path program 1 times [2021-06-05 17:57:40,831 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:57:40,831 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098225549] [2021-06-05 17:57:40,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:57:40,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:57:41,623 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 17:57:41,623 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:57:41,623 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098225549] [2021-06-05 17:57:41,625 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098225549] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:57:41,625 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:57:41,625 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-06-05 17:57:41,626 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129168391] [2021-06-05 17:57:41,626 INFO L462 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-06-05 17:57:41,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:57:41,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-06-05 17:57:41,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=829, Unknown=0, NotChecked=0, Total=930 [2021-06-05 17:57:41,627 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 17:57:43,683 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2021-06-05 17:57:43,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:57:43,992 INFO L93 Difference]: Finished difference Result 10116 states and 26169 transitions. [2021-06-05 17:57:43,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-06-05 17:57:43,992 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 17:57:43,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:57:44,004 INFO L225 Difference]: With dead ends: 10116 [2021-06-05 17:57:44,004 INFO L226 Difference]: Without dead ends: 10116 [2021-06-05 17:57:44,005 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 2155.2ms TimeCoverageRelationStatistics Valid=564, Invalid=2516, Unknown=0, NotChecked=0, Total=3080 [2021-06-05 17:57:44,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10116 states. [2021-06-05 17:57:44,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10116 to 8359. [2021-06-05 17:57:44,119 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 17:57:44,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8359 states to 8359 states and 21669 transitions. [2021-06-05 17:57:44,132 INFO L78 Accepts]: Start accepts. Automaton has 8359 states and 21669 transitions. Word has length 172 [2021-06-05 17:57:44,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:57:44,132 INFO L482 AbstractCegarLoop]: Abstraction has 8359 states and 21669 transitions. [2021-06-05 17:57:44,132 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 17:57:44,132 INFO L276 IsEmpty]: Start isEmpty. Operand 8359 states and 21669 transitions. [2021-06-05 17:57:44,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2021-06-05 17:57:44,142 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:57:44,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:57:44,143 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-05 17:57:44,143 INFO L430 AbstractCegarLoop]: === Iteration 5 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:57:44,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:57:44,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1009136741, now seen corresponding path program 2 times [2021-06-05 17:57:44,144 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:57:44,144 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690712207] [2021-06-05 17:57:44,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:57:44,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:57:44,365 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 17:57:44,365 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:57:44,365 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690712207] [2021-06-05 17:57:44,365 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690712207] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:57:44,365 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:57:44,365 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-06-05 17:57:44,365 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459039249] [2021-06-05 17:57:44,366 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 17:57:44,366 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:57:44,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 17:57:44,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2021-06-05 17:57:44,367 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 17:57:45,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:57:45,026 INFO L93 Difference]: Finished difference Result 7534 states and 19551 transitions. [2021-06-05 17:57:45,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 17:57:45,026 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 17:57:45,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:57:45,035 INFO L225 Difference]: With dead ends: 7534 [2021-06-05 17:57:45,035 INFO L226 Difference]: Without dead ends: 7534 [2021-06-05 17:57:45,035 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 526.1ms TimeCoverageRelationStatistics Valid=223, Invalid=533, Unknown=0, NotChecked=0, Total=756 [2021-06-05 17:57:45,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7534 states. [2021-06-05 17:57:45,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7534 to 7513. [2021-06-05 17:57:45,125 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 17:57:45,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7513 states to 7513 states and 19498 transitions. [2021-06-05 17:57:45,137 INFO L78 Accepts]: Start accepts. Automaton has 7513 states and 19498 transitions. Word has length 172 [2021-06-05 17:57:45,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:57:45,137 INFO L482 AbstractCegarLoop]: Abstraction has 7513 states and 19498 transitions. [2021-06-05 17:57:45,137 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 17:57:45,137 INFO L276 IsEmpty]: Start isEmpty. Operand 7513 states and 19498 transitions. [2021-06-05 17:57:45,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-06-05 17:57:45,145 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:57:45,145 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 17:57:45,146 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-05 17:57:45,146 INFO L430 AbstractCegarLoop]: === Iteration 6 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:57:45,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:57:45,146 INFO L82 PathProgramCache]: Analyzing trace with hash 781502976, now seen corresponding path program 1 times [2021-06-05 17:57:45,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:57:45,146 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146159999] [2021-06-05 17:57:45,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:57:45,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:57:45,639 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2021-06-05 17:57:45,834 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2021-06-05 17:57:46,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 17:57:46,679 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:57:46,679 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146159999] [2021-06-05 17:57:46,679 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146159999] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:57:46,679 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:57:46,679 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-06-05 17:57:46,679 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189328518] [2021-06-05 17:57:46,680 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 17:57:46,680 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:57:46,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 17:57:46,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2021-06-05 17:57:46,681 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 17:57:47,384 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 63 [2021-06-05 17:57:47,606 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 71 [2021-06-05 17:57:47,829 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 73 [2021-06-05 17:57:48,038 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2021-06-05 17:57:48,199 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2021-06-05 17:57:48,662 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2021-06-05 17:57:49,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:57:49,577 INFO L93 Difference]: Finished difference Result 7672 states and 19802 transitions. [2021-06-05 17:57:49,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 17:57:49,578 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 17:57:49,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:57:49,586 INFO L225 Difference]: With dead ends: 7672 [2021-06-05 17:57:49,586 INFO L226 Difference]: Without dead ends: 7672 [2021-06-05 17:57:49,587 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 18 SyntacticMatches, 8 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 2721.6ms TimeCoverageRelationStatistics Valid=316, Invalid=944, Unknown=0, NotChecked=0, Total=1260 [2021-06-05 17:57:49,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7672 states. [2021-06-05 17:57:49,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7672 to 7462. [2021-06-05 17:57:49,669 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 17:57:49,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7462 states to 7462 states and 19272 transitions. [2021-06-05 17:57:49,681 INFO L78 Accepts]: Start accepts. Automaton has 7462 states and 19272 transitions. Word has length 176 [2021-06-05 17:57:49,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:57:49,681 INFO L482 AbstractCegarLoop]: Abstraction has 7462 states and 19272 transitions. [2021-06-05 17:57:49,681 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 17:57:49,681 INFO L276 IsEmpty]: Start isEmpty. Operand 7462 states and 19272 transitions. [2021-06-05 17:57:49,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-06-05 17:57:49,691 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:57:49,692 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 17:57:49,692 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-05 17:57:49,692 INFO L430 AbstractCegarLoop]: === Iteration 7 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:57:49,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:57:49,692 INFO L82 PathProgramCache]: Analyzing trace with hash -399593919, now seen corresponding path program 1 times [2021-06-05 17:57:49,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:57:49,692 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856578214] [2021-06-05 17:57:49,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:57:49,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:57:50,358 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 17:57:50,358 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:57:50,358 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856578214] [2021-06-05 17:57:50,358 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856578214] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:57:50,359 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:57:50,359 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-06-05 17:57:50,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343391076] [2021-06-05 17:57:50,359 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-06-05 17:57:50,359 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:57:50,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-06-05 17:57:50,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=754, Unknown=0, NotChecked=0, Total=870 [2021-06-05 17:57:50,360 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 17:57:53,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:57:53,156 INFO L93 Difference]: Finished difference Result 7450 states and 19113 transitions. [2021-06-05 17:57:53,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-06-05 17:57:53,163 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 17:57:53,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:57:53,172 INFO L225 Difference]: With dead ends: 7450 [2021-06-05 17:57:53,172 INFO L226 Difference]: Without dead ends: 7450 [2021-06-05 17:57:53,173 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 2420.2ms TimeCoverageRelationStatistics Valid=766, Invalid=2894, Unknown=0, NotChecked=0, Total=3660 [2021-06-05 17:57:53,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7450 states. [2021-06-05 17:57:53,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7450 to 6542. [2021-06-05 17:57:53,252 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 17:57:53,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6542 states to 6542 states and 16821 transitions. [2021-06-05 17:57:53,262 INFO L78 Accepts]: Start accepts. Automaton has 6542 states and 16821 transitions. Word has length 176 [2021-06-05 17:57:53,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:57:53,262 INFO L482 AbstractCegarLoop]: Abstraction has 6542 states and 16821 transitions. [2021-06-05 17:57:53,262 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 17:57:53,262 INFO L276 IsEmpty]: Start isEmpty. Operand 6542 states and 16821 transitions. [2021-06-05 17:57:53,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-06-05 17:57:53,268 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:57:53,268 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 17:57:53,268 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-05 17:57:53,268 INFO L430 AbstractCegarLoop]: === Iteration 8 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:57:53,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:57:53,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1262122175, now seen corresponding path program 2 times [2021-06-05 17:57:53,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:57:53,269 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61106704] [2021-06-05 17:57:53,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:57:53,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:57:54,385 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 17:57:54,386 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:57:54,386 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61106704] [2021-06-05 17:57:54,386 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61106704] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:57:54,386 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:57:54,386 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-06-05 17:57:54,386 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181645854] [2021-06-05 17:57:54,386 INFO L462 AbstractCegarLoop]: Interpolant automaton has 36 states [2021-06-05 17:57:54,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:57:54,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-06-05 17:57:54,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1108, Unknown=0, NotChecked=0, Total=1260 [2021-06-05 17:57:54,387 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 17:57:56,157 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 56 [2021-06-05 17:57:58,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:57:58,237 INFO L93 Difference]: Finished difference Result 10942 states and 28325 transitions. [2021-06-05 17:57:58,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-06-05 17:57:58,237 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 17:57:58,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:57:58,249 INFO L225 Difference]: With dead ends: 10942 [2021-06-05 17:57:58,250 INFO L226 Difference]: Without dead ends: 10942 [2021-06-05 17:57:58,251 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 6 SyntacticMatches, 6 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1310 ImplicationChecksByTransitivity, 3783.9ms TimeCoverageRelationStatistics Valid=1133, Invalid=4417, Unknown=0, NotChecked=0, Total=5550 [2021-06-05 17:57:58,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10942 states. [2021-06-05 17:57:58,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10942 to 9393. [2021-06-05 17:57:58,363 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 17:57:58,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9393 states to 9393 states and 24392 transitions. [2021-06-05 17:57:58,378 INFO L78 Accepts]: Start accepts. Automaton has 9393 states and 24392 transitions. Word has length 176 [2021-06-05 17:57:58,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:57:58,379 INFO L482 AbstractCegarLoop]: Abstraction has 9393 states and 24392 transitions. [2021-06-05 17:57:58,379 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 17:57:58,379 INFO L276 IsEmpty]: Start isEmpty. Operand 9393 states and 24392 transitions. [2021-06-05 17:57:58,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-06-05 17:57:58,388 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:57:58,388 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 17:57:58,388 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-05 17:57:58,389 INFO L430 AbstractCegarLoop]: === Iteration 9 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:57:58,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:57:58,389 INFO L82 PathProgramCache]: Analyzing trace with hash -788395354, now seen corresponding path program 1 times [2021-06-05 17:57:58,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:57:58,389 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552103012] [2021-06-05 17:57:58,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:57:58,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:57:59,046 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 17:57:59,046 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:57:59,046 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552103012] [2021-06-05 17:57:59,046 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552103012] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:57:59,046 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:57:59,046 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-06-05 17:57:59,047 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799753509] [2021-06-05 17:57:59,048 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 17:57:59,048 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:57:59,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 17:57:59,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2021-06-05 17:57:59,049 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 17:58:01,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:58:01,100 INFO L93 Difference]: Finished difference Result 8472 states and 21820 transitions. [2021-06-05 17:58:01,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-06-05 17:58:01,101 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 17:58:01,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:58:01,110 INFO L225 Difference]: With dead ends: 8472 [2021-06-05 17:58:01,110 INFO L226 Difference]: Without dead ends: 8472 [2021-06-05 17:58:01,111 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 1844.3ms TimeCoverageRelationStatistics Valid=634, Invalid=2122, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 17:58:01,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8472 states. [2021-06-05 17:58:01,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8472 to 8178. [2021-06-05 17:58:01,202 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 17:58:01,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8178 states to 8178 states and 21078 transitions. [2021-06-05 17:58:01,214 INFO L78 Accepts]: Start accepts. Automaton has 8178 states and 21078 transitions. Word has length 180 [2021-06-05 17:58:01,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:58:01,214 INFO L482 AbstractCegarLoop]: Abstraction has 8178 states and 21078 transitions. [2021-06-05 17:58:01,215 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 17:58:01,215 INFO L276 IsEmpty]: Start isEmpty. Operand 8178 states and 21078 transitions. [2021-06-05 17:58:01,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 17:58:01,221 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:58:01,221 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 17:58:01,222 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-05 17:58:01,222 INFO L430 AbstractCegarLoop]: === Iteration 10 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:58:01,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:58:01,222 INFO L82 PathProgramCache]: Analyzing trace with hash -858234869, now seen corresponding path program 1 times [2021-06-05 17:58:01,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:58:01,222 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376046597] [2021-06-05 17:58:01,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:58:01,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:58:01,917 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-06-05 17:58:02,069 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-05 17:58:02,255 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-05 17:58:03,522 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2021-06-05 17:58:06,643 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 17:58:06,644 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:58:06,644 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376046597] [2021-06-05 17:58:06,644 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376046597] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:58:06,644 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:58:06,644 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 17:58:06,644 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853328456] [2021-06-05 17:58:06,644 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 17:58:06,644 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:58:06,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 17:58:06,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2572, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 17:58:06,646 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 17:58:08,852 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 51 [2021-06-05 17:58:09,899 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 52 [2021-06-05 17:58:10,231 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 56 [2021-06-05 17:58:10,561 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 59 [2021-06-05 17:58:10,904 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 61 [2021-06-05 17:58:11,462 WARN L205 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 86 [2021-06-05 17:58:12,107 WARN L205 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 84 [2021-06-05 17:58:13,099 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 59 [2021-06-05 17:58:14,894 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 17:58:15,179 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2021-06-05 17:58:15,555 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-05 17:58:17,847 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2021-06-05 17:58:20,803 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 17:58:23,288 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 17:58:24,376 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 17:58:25,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:58:25,776 INFO L93 Difference]: Finished difference Result 12591 states and 32503 transitions. [2021-06-05 17:58:25,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-06-05 17:58:25,776 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 17:58:25,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:58:25,790 INFO L225 Difference]: With dead ends: 12591 [2021-06-05 17:58:25,790 INFO L226 Difference]: Without dead ends: 12171 [2021-06-05 17:58:25,794 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 25 SyntacticMatches, 5 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4460 ImplicationChecksByTransitivity, 15718.2ms TimeCoverageRelationStatistics Valid=1552, Invalid=14960, Unknown=0, NotChecked=0, Total=16512 [2021-06-05 17:58:25,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12171 states. [2021-06-05 17:58:25,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12171 to 9590. [2021-06-05 17:58:25,915 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 17:58:25,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9590 states to 9590 states and 24548 transitions. [2021-06-05 17:58:25,930 INFO L78 Accepts]: Start accepts. Automaton has 9590 states and 24548 transitions. Word has length 184 [2021-06-05 17:58:25,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:58:25,930 INFO L482 AbstractCegarLoop]: Abstraction has 9590 states and 24548 transitions. [2021-06-05 17:58:25,930 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 17:58:25,930 INFO L276 IsEmpty]: Start isEmpty. Operand 9590 states and 24548 transitions. [2021-06-05 17:58:25,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 17:58:25,938 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:58:25,938 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 17:58:25,938 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-06-05 17:58:25,938 INFO L430 AbstractCegarLoop]: === Iteration 11 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:58:25,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:58:25,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1302633973, now seen corresponding path program 2 times [2021-06-05 17:58:25,939 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:58:25,939 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543335291] [2021-06-05 17:58:25,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:58:25,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:58:26,864 WARN L205 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-06-05 17:58:27,017 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-05 17:58:27,194 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-05 17:58:28,213 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 17:58:28,391 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2021-06-05 17:58:31,237 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 17:58:31,237 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:58:31,237 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543335291] [2021-06-05 17:58:31,238 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543335291] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:58:31,238 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:58:31,238 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 17:58:31,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151378744] [2021-06-05 17:58:31,238 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 17:58:31,238 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:58:31,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 17:58:31,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=2574, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 17:58:31,240 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 17:58:33,186 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 51 [2021-06-05 17:58:33,802 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 48 [2021-06-05 17:58:35,112 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 52 [2021-06-05 17:58:35,801 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 56 [2021-06-05 17:58:36,488 WARN L205 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 59 [2021-06-05 17:58:37,234 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 61 [2021-06-05 17:58:38,203 WARN L205 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 86 [2021-06-05 17:58:39,202 WARN L205 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 84 [2021-06-05 17:58:41,065 WARN L205 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 69 [2021-06-05 17:58:43,779 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 17:58:44,162 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2021-06-05 17:58:44,673 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-05 17:58:48,008 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2021-06-05 17:58:51,030 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 17:58:53,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 17:58:53,944 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 17:58:54,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:58:54,764 INFO L93 Difference]: Finished difference Result 14115 states and 36317 transitions. [2021-06-05 17:58:54,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2021-06-05 17:58:54,765 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 17:58:54,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:58:54,781 INFO L225 Difference]: With dead ends: 14115 [2021-06-05 17:58:54,781 INFO L226 Difference]: Without dead ends: 13695 [2021-06-05 17:58:54,783 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4524 ImplicationChecksByTransitivity, 18231.1ms TimeCoverageRelationStatistics Valid=1578, Invalid=15192, Unknown=0, NotChecked=0, Total=16770 [2021-06-05 17:58:54,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13695 states. [2021-06-05 17:58:54,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13695 to 9590. [2021-06-05 17:58:54,909 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 17:58:54,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9590 states to 9590 states and 24548 transitions. [2021-06-05 17:58:54,924 INFO L78 Accepts]: Start accepts. Automaton has 9590 states and 24548 transitions. Word has length 184 [2021-06-05 17:58:54,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:58:54,924 INFO L482 AbstractCegarLoop]: Abstraction has 9590 states and 24548 transitions. [2021-06-05 17:58:54,924 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 17:58:54,924 INFO L276 IsEmpty]: Start isEmpty. Operand 9590 states and 24548 transitions. [2021-06-05 17:58:54,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 17:58:54,932 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:58:54,932 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 17:58:54,933 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-06-05 17:58:54,933 INFO L430 AbstractCegarLoop]: === Iteration 12 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:58:54,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:58:54,933 INFO L82 PathProgramCache]: Analyzing trace with hash 868546213, now seen corresponding path program 3 times [2021-06-05 17:58:54,933 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:58:54,933 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685943099] [2021-06-05 17:58:54,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:58:54,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:58:55,594 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-06-05 17:58:55,764 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-05 17:58:55,960 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-05 17:58:57,255 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 17:59:00,630 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 17:59:00,630 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:59:00,630 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685943099] [2021-06-05 17:59:00,630 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685943099] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:59:00,630 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:59:00,630 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 17:59:00,630 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862762150] [2021-06-05 17:59:00,631 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 17:59:00,631 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:59:00,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 17:59:00,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=2577, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 17:59:00,632 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 17:59:03,149 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 51 [2021-06-05 17:59:03,861 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 48 [2021-06-05 17:59:04,964 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 52 [2021-06-05 17:59:05,972 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 52 [2021-06-05 17:59:06,869 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 56 [2021-06-05 17:59:07,320 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 59 [2021-06-05 17:59:07,699 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 61 [2021-06-05 17:59:08,277 WARN L205 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 86 [2021-06-05 17:59:08,895 WARN L205 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 84 [2021-06-05 17:59:10,158 WARN L205 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 74 [2021-06-05 17:59:12,080 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 17:59:12,364 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2021-06-05 17:59:12,725 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-05 17:59:14,972 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2021-06-05 17:59:17,457 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 17:59:19,757 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 17:59:21,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:59:21,798 INFO L93 Difference]: Finished difference Result 14179 states and 36477 transitions. [2021-06-05 17:59:21,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2021-06-05 17:59:21,799 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 17:59:21,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:59:21,814 INFO L225 Difference]: With dead ends: 14179 [2021-06-05 17:59:21,814 INFO L226 Difference]: Without dead ends: 13759 [2021-06-05 17:59:21,816 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4688 ImplicationChecksByTransitivity, 18052.9ms TimeCoverageRelationStatistics Valid=1625, Invalid=15667, Unknown=0, NotChecked=0, Total=17292 [2021-06-05 17:59:21,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13759 states. [2021-06-05 17:59:21,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13759 to 9590. [2021-06-05 17:59:21,923 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 17:59:21,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9590 states to 9590 states and 24548 transitions. [2021-06-05 17:59:21,935 INFO L78 Accepts]: Start accepts. Automaton has 9590 states and 24548 transitions. Word has length 184 [2021-06-05 17:59:21,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:59:21,936 INFO L482 AbstractCegarLoop]: Abstraction has 9590 states and 24548 transitions. [2021-06-05 17:59:21,936 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 17:59:21,936 INFO L276 IsEmpty]: Start isEmpty. Operand 9590 states and 24548 transitions. [2021-06-05 17:59:21,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 17:59:21,943 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:59:21,943 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 17:59:21,943 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-06-05 17:59:21,943 INFO L430 AbstractCegarLoop]: === Iteration 13 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:59:21,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:59:21,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1647526667, now seen corresponding path program 4 times [2021-06-05 17:59:21,943 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:59:21,943 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52723114] [2021-06-05 17:59:21,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:59:21,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:59:22,545 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-05 17:59:22,791 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-06-05 17:59:22,999 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-05 17:59:23,211 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-05 17:59:26,746 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 17:59:26,746 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:59:26,746 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52723114] [2021-06-05 17:59:26,746 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52723114] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:59:26,746 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:59:26,746 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 17:59:26,746 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072594023] [2021-06-05 17:59:26,747 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 17:59:26,747 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:59:26,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 17:59:26,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2578, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 17:59:26,749 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 17:59:28,654 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 48 [2021-06-05 17:59:29,311 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 52 [2021-06-05 17:59:29,732 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 55 [2021-06-05 17:59:30,369 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 52 [2021-06-05 17:59:31,019 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 56 [2021-06-05 17:59:31,630 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 59 [2021-06-05 17:59:32,309 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 61 [2021-06-05 17:59:33,207 WARN L205 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 86 [2021-06-05 17:59:34,150 WARN L205 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 84 [2021-06-05 17:59:35,862 WARN L205 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 77 [2021-06-05 17:59:38,204 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 17:59:38,534 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2021-06-05 17:59:38,959 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-05 17:59:41,690 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2021-06-05 17:59:44,239 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 17:59:46,165 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 17:59:47,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:59:47,769 INFO L93 Difference]: Finished difference Result 14163 states and 36441 transitions. [2021-06-05 17:59:47,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2021-06-05 17:59:47,770 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 17:59:47,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:59:47,784 INFO L225 Difference]: With dead ends: 14163 [2021-06-05 17:59:47,784 INFO L226 Difference]: Without dead ends: 13743 [2021-06-05 17:59:47,786 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4759 ImplicationChecksByTransitivity, 17164.7ms TimeCoverageRelationStatistics Valid=1656, Invalid=15900, Unknown=0, NotChecked=0, Total=17556 [2021-06-05 17:59:47,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13743 states. [2021-06-05 17:59:47,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13743 to 9590. [2021-06-05 17:59:47,891 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 17:59:47,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9590 states to 9590 states and 24548 transitions. [2021-06-05 17:59:47,903 INFO L78 Accepts]: Start accepts. Automaton has 9590 states and 24548 transitions. Word has length 184 [2021-06-05 17:59:47,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:59:47,904 INFO L482 AbstractCegarLoop]: Abstraction has 9590 states and 24548 transitions. [2021-06-05 17:59:47,904 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:59:47,904 INFO L276 IsEmpty]: Start isEmpty. Operand 9590 states and 24548 transitions. [2021-06-05 17:59:47,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 17:59:47,911 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:59:47,911 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 17:59:47,911 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-06-05 17:59:47,911 INFO L430 AbstractCegarLoop]: === Iteration 14 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:59:47,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:59:47,912 INFO L82 PathProgramCache]: Analyzing trace with hash -276826587, now seen corresponding path program 5 times [2021-06-05 17:59:47,912 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:59:47,912 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181696210] [2021-06-05 17:59:47,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:59:47,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:59:48,589 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-06-05 17:59:48,755 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-05 17:59:48,941 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-05 17:59:49,987 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 17:59:52,912 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 17:59:52,913 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:59:52,913 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181696210] [2021-06-05 17:59:52,913 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181696210] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:59:52,913 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:59:52,913 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 17:59:52,913 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16631816] [2021-06-05 17:59:52,914 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 17:59:52,914 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:59:52,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 17:59:52,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=2580, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 17:59:52,914 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 17:59:54,651 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 51 [2021-06-05 17:59:55,172 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 48 [2021-06-05 17:59:55,977 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 52 [2021-06-05 17:59:56,533 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 55 [2021-06-05 17:59:57,106 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 57 [2021-06-05 17:59:58,066 WARN L205 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 79 [2021-06-05 17:59:58,475 WARN L205 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 77 [2021-06-05 17:59:58,814 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 52 [2021-06-05 17:59:59,497 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 56 [2021-06-05 17:59:59,888 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 59 [2021-06-05 18:00:00,290 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 61 [2021-06-05 18:00:00,843 WARN L205 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 86 [2021-06-05 18:00:01,319 WARN L205 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 83 [2021-06-05 18:00:02,006 WARN L205 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 84 [2021-06-05 18:00:02,724 WARN L205 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 81 [2021-06-05 18:00:05,107 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 18:00:05,363 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2021-06-05 18:00:05,651 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-05 18:00:07,531 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2021-06-05 18:00:09,822 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:00:12,014 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:00:13,062 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:00:14,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:00:14,002 INFO L93 Difference]: Finished difference Result 14267 states and 36697 transitions. [2021-06-05 18:00:14,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2021-06-05 18:00:14,002 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:00:14,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:00:14,019 INFO L225 Difference]: With dead ends: 14267 [2021-06-05 18:00:14,019 INFO L226 Difference]: Without dead ends: 13847 [2021-06-05 18:00:14,021 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5188 ImplicationChecksByTransitivity, 19059.2ms TimeCoverageRelationStatistics Valid=1782, Invalid=17124, Unknown=0, NotChecked=0, Total=18906 [2021-06-05 18:00:14,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13847 states. [2021-06-05 18:00:14,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13847 to 9590. [2021-06-05 18:00:14,143 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:00:14,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9590 states to 9590 states and 24548 transitions. [2021-06-05 18:00:14,158 INFO L78 Accepts]: Start accepts. Automaton has 9590 states and 24548 transitions. Word has length 184 [2021-06-05 18:00:14,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:00:14,158 INFO L482 AbstractCegarLoop]: Abstraction has 9590 states and 24548 transitions. [2021-06-05 18:00:14,158 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:00:14,158 INFO L276 IsEmpty]: Start isEmpty. Operand 9590 states and 24548 transitions. [2021-06-05 18:00:14,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 18:00:14,166 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:00:14,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:14,166 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-06-05 18:00:14,166 INFO L430 AbstractCegarLoop]: === Iteration 15 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:00:14,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:00:14,166 INFO L82 PathProgramCache]: Analyzing trace with hash -410727541, now seen corresponding path program 6 times [2021-06-05 18:00:14,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:00:14,166 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338565388] [2021-06-05 18:00:14,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:00:14,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:00:14,927 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-06-05 18:00:15,076 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-05 18:00:15,251 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-05 18:00:16,187 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 18:00:18,722 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:00:18,722 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:00:18,722 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338565388] [2021-06-05 18:00:18,722 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338565388] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:00:18,722 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:00:18,722 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 18:00:18,722 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107900050] [2021-06-05 18:00:18,723 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 18:00:18,723 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:00:18,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 18:00:18,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2583, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 18:00:18,724 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:00:20,929 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 48 [2021-06-05 18:00:21,672 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 52 [2021-06-05 18:00:22,186 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 55 [2021-06-05 18:00:22,749 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 57 [2021-06-05 18:00:23,603 WARN L205 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 82 [2021-06-05 18:00:24,495 WARN L205 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 80 [2021-06-05 18:00:25,218 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 52 [2021-06-05 18:00:26,575 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 56 [2021-06-05 18:00:27,461 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 59 [2021-06-05 18:00:28,403 WARN L205 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 61 [2021-06-05 18:00:29,483 WARN L205 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 86 [2021-06-05 18:00:30,636 WARN L205 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 84 [2021-06-05 18:00:34,096 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 68 [2021-06-05 18:00:34,492 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 18:00:34,942 WARN L205 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2021-06-05 18:00:35,485 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-05 18:00:37,676 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2021-06-05 18:00:39,847 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:00:41,942 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:00:42,878 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:00:43,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:00:43,724 INFO L93 Difference]: Finished difference Result 14179 states and 36499 transitions. [2021-06-05 18:00:43,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2021-06-05 18:00:43,724 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:00:43,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:00:43,739 INFO L225 Difference]: With dead ends: 14179 [2021-06-05 18:00:43,739 INFO L226 Difference]: Without dead ends: 13759 [2021-06-05 18:00:43,740 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4907 ImplicationChecksByTransitivity, 20060.6ms TimeCoverageRelationStatistics Valid=1700, Invalid=16390, Unknown=0, NotChecked=0, Total=18090 [2021-06-05 18:00:43,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13759 states. [2021-06-05 18:00:43,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13759 to 9668. [2021-06-05 18:00:43,861 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:00:43,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9668 states to 9668 states and 24758 transitions. [2021-06-05 18:00:43,875 INFO L78 Accepts]: Start accepts. Automaton has 9668 states and 24758 transitions. Word has length 184 [2021-06-05 18:00:43,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:00:43,875 INFO L482 AbstractCegarLoop]: Abstraction has 9668 states and 24758 transitions. [2021-06-05 18:00:43,875 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:00:43,875 INFO L276 IsEmpty]: Start isEmpty. Operand 9668 states and 24758 transitions. [2021-06-05 18:00:43,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 18:00:43,884 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:00:43,885 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:00:43,885 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-06-05 18:00:43,885 INFO L430 AbstractCegarLoop]: === Iteration 16 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:00:43,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:00:43,885 INFO L82 PathProgramCache]: Analyzing trace with hash 2715019, now seen corresponding path program 7 times [2021-06-05 18:00:43,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:00:43,885 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086836266] [2021-06-05 18:00:43,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:00:43,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:00:44,617 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-06-05 18:00:44,840 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-05 18:00:45,090 WARN L205 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-05 18:00:46,275 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 18:00:49,430 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:00:49,430 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:00:49,430 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086836266] [2021-06-05 18:00:49,430 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086836266] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:00:49,430 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:00:49,430 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 18:00:49,430 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093165950] [2021-06-05 18:00:49,431 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 18:00:49,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:00:49,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 18:00:49,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=2585, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 18:00:49,431 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:00:50,981 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 40 [2021-06-05 18:00:51,720 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 48 [2021-06-05 18:00:52,248 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 52 [2021-06-05 18:00:52,565 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 55 [2021-06-05 18:00:52,903 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 57 [2021-06-05 18:00:53,447 WARN L205 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 82 [2021-06-05 18:00:54,028 WARN L205 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 80 [2021-06-05 18:00:54,512 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 52 [2021-06-05 18:00:55,612 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 56 [2021-06-05 18:00:56,271 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 59 [2021-06-05 18:00:56,970 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 61 [2021-06-05 18:00:57,944 WARN L205 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 86 [2021-06-05 18:00:59,009 WARN L205 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 84 [2021-06-05 18:01:02,565 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 18:01:02,866 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2021-06-05 18:01:03,264 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-05 18:01:05,965 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2021-06-05 18:01:09,228 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:01:09,706 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:01:10,622 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-06-05 18:01:11,626 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:01:13,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:01:13,253 INFO L93 Difference]: Finished difference Result 14120 states and 36372 transitions. [2021-06-05 18:01:13,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2021-06-05 18:01:13,254 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:01:13,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:01:13,267 INFO L225 Difference]: With dead ends: 14120 [2021-06-05 18:01:13,267 INFO L226 Difference]: Without dead ends: 13700 [2021-06-05 18:01:13,268 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5142 ImplicationChecksByTransitivity, 18572.6ms TimeCoverageRelationStatistics Valid=1729, Invalid=17177, Unknown=0, NotChecked=0, Total=18906 [2021-06-05 18:01:13,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13700 states. [2021-06-05 18:01:13,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13700 to 9681. [2021-06-05 18:01:13,370 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:01:13,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9681 states to 9681 states and 24793 transitions. [2021-06-05 18:01:13,383 INFO L78 Accepts]: Start accepts. Automaton has 9681 states and 24793 transitions. Word has length 184 [2021-06-05 18:01:13,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:01:13,384 INFO L482 AbstractCegarLoop]: Abstraction has 9681 states and 24793 transitions. [2021-06-05 18:01:13,384 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:01:13,384 INFO L276 IsEmpty]: Start isEmpty. Operand 9681 states and 24793 transitions. [2021-06-05 18:01:13,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 18:01:13,391 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:01:13,391 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:01:13,391 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-06-05 18:01:13,391 INFO L430 AbstractCegarLoop]: === Iteration 17 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:01:13,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:01:13,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1807828059, now seen corresponding path program 8 times [2021-06-05 18:01:13,392 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:01:13,392 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651098876] [2021-06-05 18:01:13,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:01:13,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:01:14,048 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-06-05 18:01:14,199 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-05 18:01:14,374 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-05 18:01:18,110 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:01:18,111 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:01:18,111 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651098876] [2021-06-05 18:01:18,111 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651098876] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:01:18,111 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:01:18,111 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 18:01:18,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610664645] [2021-06-05 18:01:18,111 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 18:01:18,111 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:01:18,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 18:01:18,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=2585, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 18:01:18,112 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:01:19,759 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 51 [2021-06-05 18:01:20,223 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 48 [2021-06-05 18:01:21,034 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 52 [2021-06-05 18:01:21,622 WARN L205 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 55 [2021-06-05 18:01:22,181 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 57 [2021-06-05 18:01:23,037 WARN L205 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 82 [2021-06-05 18:01:23,929 WARN L205 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 80 [2021-06-05 18:01:24,664 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 52 [2021-06-05 18:01:26,063 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 56 [2021-06-05 18:01:27,016 WARN L205 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 59 [2021-06-05 18:01:27,999 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 61 [2021-06-05 18:01:28,815 WARN L205 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 86 [2021-06-05 18:01:29,477 WARN L205 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 84 [2021-06-05 18:01:32,359 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 18:01:32,611 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2021-06-05 18:01:32,881 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-05 18:01:34,726 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2021-06-05 18:01:36,911 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:01:39,025 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:01:40,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:01:40,874 INFO L93 Difference]: Finished difference Result 14133 states and 36407 transitions. [2021-06-05 18:01:40,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2021-06-05 18:01:40,875 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:01:40,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:01:40,890 INFO L225 Difference]: With dead ends: 14133 [2021-06-05 18:01:40,890 INFO L226 Difference]: Without dead ends: 13713 [2021-06-05 18:01:40,892 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5432 ImplicationChecksByTransitivity, 19758.6ms TimeCoverageRelationStatistics Valid=1766, Invalid=17974, Unknown=0, NotChecked=0, Total=19740 [2021-06-05 18:01:40,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13713 states. [2021-06-05 18:01:40,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13713 to 9694. [2021-06-05 18:01:40,999 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:01:41,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9694 states to 9694 states and 24828 transitions. [2021-06-05 18:01:41,011 INFO L78 Accepts]: Start accepts. Automaton has 9694 states and 24828 transitions. Word has length 184 [2021-06-05 18:01:41,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:01:41,012 INFO L482 AbstractCegarLoop]: Abstraction has 9694 states and 24828 transitions. [2021-06-05 18:01:41,012 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:01:41,012 INFO L276 IsEmpty]: Start isEmpty. Operand 9694 states and 24828 transitions. [2021-06-05 18:01:41,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 18:01:41,018 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:01:41,019 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:01:41,019 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-06-05 18:01:41,019 INFO L430 AbstractCegarLoop]: === Iteration 18 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:01:41,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:01:41,019 INFO L82 PathProgramCache]: Analyzing trace with hash -92526133, now seen corresponding path program 9 times [2021-06-05 18:01:41,019 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:01:41,019 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611883425] [2021-06-05 18:01:41,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:01:41,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:01:41,746 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-06-05 18:01:41,910 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-05 18:01:42,103 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-05 18:01:43,417 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:01:43,643 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2021-06-05 18:01:45,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:01:45,926 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:01:45,926 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611883425] [2021-06-05 18:01:45,926 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611883425] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:01:45,926 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:01:45,926 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 18:01:45,927 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434793124] [2021-06-05 18:01:45,927 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 18:01:45,927 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:01:45,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 18:01:45,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2572, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 18:01:45,928 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:01:47,775 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 48 [2021-06-05 18:01:48,343 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 52 [2021-06-05 18:01:48,724 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 55 [2021-06-05 18:01:49,136 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 57 [2021-06-05 18:01:49,815 WARN L205 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 82 [2021-06-05 18:01:50,546 WARN L205 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 80 [2021-06-05 18:01:51,158 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 52 [2021-06-05 18:01:52,263 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 56 [2021-06-05 18:01:53,080 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 59 [2021-06-05 18:01:53,950 WARN L205 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 61 [2021-06-05 18:01:55,095 WARN L205 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 86 [2021-06-05 18:01:56,309 WARN L205 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 84 [2021-06-05 18:01:59,687 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 18:01:59,970 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2021-06-05 18:02:00,282 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-05 18:02:02,201 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 71 [2021-06-05 18:02:02,445 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2021-06-05 18:02:04,403 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:02:06,275 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:02:07,128 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:02:07,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:02:07,771 INFO L93 Difference]: Finished difference Result 15477 states and 39922 transitions. [2021-06-05 18:02:07,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2021-06-05 18:02:07,772 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:02:07,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:02:07,787 INFO L225 Difference]: With dead ends: 15477 [2021-06-05 18:02:07,787 INFO L226 Difference]: Without dead ends: 15057 [2021-06-05 18:02:07,788 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5434 ImplicationChecksByTransitivity, 19349.3ms TimeCoverageRelationStatistics Valid=1854, Invalid=17886, Unknown=0, NotChecked=0, Total=19740 [2021-06-05 18:02:07,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15057 states. [2021-06-05 18:02:07,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15057 to 9798. [2021-06-05 18:02:07,901 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:02:07,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9798 states to 9798 states and 25108 transitions. [2021-06-05 18:02:07,914 INFO L78 Accepts]: Start accepts. Automaton has 9798 states and 25108 transitions. Word has length 184 [2021-06-05 18:02:07,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:02:07,914 INFO L482 AbstractCegarLoop]: Abstraction has 9798 states and 25108 transitions. [2021-06-05 18:02:07,914 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:02:07,914 INFO L276 IsEmpty]: Start isEmpty. Operand 9798 states and 25108 transitions. [2021-06-05 18:02:07,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 18:02:07,921 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:02:07,922 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:02:07,922 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-06-05 18:02:07,922 INFO L430 AbstractCegarLoop]: === Iteration 19 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:02:07,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:02:07,922 INFO L82 PathProgramCache]: Analyzing trace with hash 787291659, now seen corresponding path program 10 times [2021-06-05 18:02:07,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:02:07,922 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498690966] [2021-06-05 18:02:07,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:02:07,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:02:08,572 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-06-05 18:02:08,725 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-05 18:02:08,907 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-05 18:02:12,879 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:02:12,879 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:02:12,879 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498690966] [2021-06-05 18:02:12,879 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498690966] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:02:12,879 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:02:12,879 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 18:02:12,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500840313] [2021-06-05 18:02:12,880 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 18:02:12,880 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:02:12,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 18:02:12,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2555, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 18:02:12,880 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:02:14,682 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 51 [2021-06-05 18:02:15,134 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 48 [2021-06-05 18:02:15,798 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 52 [2021-06-05 18:02:16,333 WARN L205 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 55 [2021-06-05 18:02:16,638 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 57 [2021-06-05 18:02:17,110 WARN L205 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 82 [2021-06-05 18:02:17,585 WARN L205 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 80 [2021-06-05 18:02:17,916 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 52 [2021-06-05 18:02:18,791 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 56 [2021-06-05 18:02:19,208 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 59 [2021-06-05 18:02:19,659 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 61 [2021-06-05 18:02:20,311 WARN L205 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 86 [2021-06-05 18:02:21,037 WARN L205 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 84 [2021-06-05 18:02:24,352 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 18:02:24,640 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2021-06-05 18:02:24,967 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-05 18:02:27,394 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2021-06-05 18:02:30,227 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:02:32,630 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:02:33,660 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:02:34,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:02:34,442 INFO L93 Difference]: Finished difference Result 15333 states and 39480 transitions. [2021-06-05 18:02:34,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2021-06-05 18:02:34,443 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:02:34,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:02:34,456 INFO L225 Difference]: With dead ends: 15333 [2021-06-05 18:02:34,456 INFO L226 Difference]: Without dead ends: 14913 [2021-06-05 18:02:34,457 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5506 ImplicationChecksByTransitivity, 17389.0ms TimeCoverageRelationStatistics Valid=1971, Invalid=17769, Unknown=0, NotChecked=0, Total=19740 [2021-06-05 18:02:34,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14913 states. [2021-06-05 18:02:34,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14913 to 9811. [2021-06-05 18:02:34,561 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:02:34,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9811 states to 9811 states and 25143 transitions. [2021-06-05 18:02:34,574 INFO L78 Accepts]: Start accepts. Automaton has 9811 states and 25143 transitions. Word has length 184 [2021-06-05 18:02:34,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:02:34,574 INFO L482 AbstractCegarLoop]: Abstraction has 9811 states and 25143 transitions. [2021-06-05 18:02:34,574 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:02:34,574 INFO L276 IsEmpty]: Start isEmpty. Operand 9811 states and 25143 transitions. [2021-06-05 18:02:34,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 18:02:34,581 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:02:34,582 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:02:34,582 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-06-05 18:02:34,582 INFO L430 AbstractCegarLoop]: === Iteration 20 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:02:34,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:02:34,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1611136987, now seen corresponding path program 11 times [2021-06-05 18:02:34,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:02:34,582 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720676206] [2021-06-05 18:02:34,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:02:34,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:02:35,209 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-06-05 18:02:35,418 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-05 18:02:35,595 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-05 18:02:39,100 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:02:39,100 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:02:39,101 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720676206] [2021-06-05 18:02:39,101 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720676206] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:02:39,101 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:02:39,101 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 18:02:39,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74586344] [2021-06-05 18:02:39,101 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 18:02:39,101 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:02:39,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 18:02:39,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=2559, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 18:02:39,102 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:02:41,106 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 48 [2021-06-05 18:02:41,534 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 52 [2021-06-05 18:02:41,945 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 55 [2021-06-05 18:02:42,412 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 57 [2021-06-05 18:02:43,147 WARN L205 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 82 [2021-06-05 18:02:43,931 WARN L205 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 80 [2021-06-05 18:02:47,514 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 18:02:47,826 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2021-06-05 18:02:48,161 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-05 18:02:50,687 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2021-06-05 18:02:52,909 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:02:54,878 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:02:56,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:02:56,599 INFO L93 Difference]: Finished difference Result 15037 states and 38694 transitions. [2021-06-05 18:02:56,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2021-06-05 18:02:56,599 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:02:56,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:02:56,618 INFO L225 Difference]: With dead ends: 15037 [2021-06-05 18:02:56,618 INFO L226 Difference]: Without dead ends: 14617 [2021-06-05 18:02:56,619 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4641 ImplicationChecksByTransitivity, 14491.0ms TimeCoverageRelationStatistics Valid=1630, Invalid=15400, Unknown=0, NotChecked=0, Total=17030 [2021-06-05 18:02:56,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14617 states. [2021-06-05 18:02:56,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14617 to 9850. [2021-06-05 18:02:56,732 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:02:56,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9850 states to 9850 states and 25248 transitions. [2021-06-05 18:02:56,744 INFO L78 Accepts]: Start accepts. Automaton has 9850 states and 25248 transitions. Word has length 184 [2021-06-05 18:02:56,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:02:56,745 INFO L482 AbstractCegarLoop]: Abstraction has 9850 states and 25248 transitions. [2021-06-05 18:02:56,745 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:02:56,745 INFO L276 IsEmpty]: Start isEmpty. Operand 9850 states and 25248 transitions. [2021-06-05 18:02:56,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 18:02:56,752 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:02:56,752 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:02:56,752 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-06-05 18:02:56,753 INFO L430 AbstractCegarLoop]: === Iteration 21 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:02:56,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:02:56,753 INFO L82 PathProgramCache]: Analyzing trace with hash 481639115, now seen corresponding path program 12 times [2021-06-05 18:02:56,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:02:56,753 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626624792] [2021-06-05 18:02:56,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:02:56,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:02:57,429 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-06-05 18:02:57,629 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-05 18:02:57,815 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-05 18:02:58,954 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 18:03:01,950 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:03:01,950 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:03:01,950 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626624792] [2021-06-05 18:03:01,950 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626624792] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:03:01,950 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:03:01,950 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 18:03:01,951 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612580146] [2021-06-05 18:03:01,951 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 18:03:01,951 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:03:01,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 18:03:01,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=2559, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 18:03:01,952 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:03:03,844 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 51 [2021-06-05 18:03:04,383 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 48 [2021-06-05 18:03:04,904 WARN L205 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 52 [2021-06-05 18:03:05,178 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 55 [2021-06-05 18:03:05,477 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 57 [2021-06-05 18:03:05,954 WARN L205 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 82 [2021-06-05 18:03:06,415 WARN L205 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 80 [2021-06-05 18:03:09,414 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 18:03:09,667 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2021-06-05 18:03:09,942 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-05 18:03:10,143 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 75 [2021-06-05 18:03:11,928 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2021-06-05 18:03:14,208 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:03:16,226 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:03:18,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:03:18,017 INFO L93 Difference]: Finished difference Result 14573 states and 37510 transitions. [2021-06-05 18:03:18,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2021-06-05 18:03:18,017 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:03:18,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:03:18,032 INFO L225 Difference]: With dead ends: 14573 [2021-06-05 18:03:18,032 INFO L226 Difference]: Without dead ends: 14153 [2021-06-05 18:03:18,034 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4546 ImplicationChecksByTransitivity, 14478.2ms TimeCoverageRelationStatistics Valid=1610, Invalid=15160, Unknown=0, NotChecked=0, Total=16770 [2021-06-05 18:03:18,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14153 states. [2021-06-05 18:03:18,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14153 to 9863. [2021-06-05 18:03:18,142 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:03:18,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9863 states to 9863 states and 25283 transitions. [2021-06-05 18:03:18,155 INFO L78 Accepts]: Start accepts. Automaton has 9863 states and 25283 transitions. Word has length 184 [2021-06-05 18:03:18,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:03:18,155 INFO L482 AbstractCegarLoop]: Abstraction has 9863 states and 25283 transitions. [2021-06-05 18:03:18,155 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:03:18,155 INFO L276 IsEmpty]: Start isEmpty. Operand 9863 states and 25283 transitions. [2021-06-05 18:03:18,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 18:03:18,162 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:03:18,162 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:03:18,162 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-06-05 18:03:18,162 INFO L430 AbstractCegarLoop]: === Iteration 22 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:03:18,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:03:18,163 INFO L82 PathProgramCache]: Analyzing trace with hash 317652773, now seen corresponding path program 13 times [2021-06-05 18:03:18,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:03:18,163 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707714575] [2021-06-05 18:03:18,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:03:18,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:03:18,865 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-06-05 18:03:19,034 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-05 18:03:19,312 WARN L205 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-05 18:03:22,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:03:22,629 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:03:22,629 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707714575] [2021-06-05 18:03:22,629 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707714575] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:03:22,630 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:03:22,630 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 18:03:22,630 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663253754] [2021-06-05 18:03:22,630 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 18:03:22,630 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:03:22,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 18:03:22,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=2559, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 18:03:22,631 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:03:24,485 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 48 [2021-06-05 18:03:24,840 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 52 [2021-06-05 18:03:25,188 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 55 [2021-06-05 18:03:25,588 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 57 [2021-06-05 18:03:26,262 WARN L205 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 82 [2021-06-05 18:03:26,960 WARN L205 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 80 [2021-06-05 18:03:29,510 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-06-05 18:03:30,297 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 18:03:30,583 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2021-06-05 18:03:30,837 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-05 18:03:32,803 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2021-06-05 18:03:35,551 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:03:35,963 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2021-06-05 18:03:37,533 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:03:39,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:03:39,041 INFO L93 Difference]: Finished difference Result 14101 states and 36308 transitions. [2021-06-05 18:03:39,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2021-06-05 18:03:39,041 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:03:39,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:03:39,053 INFO L225 Difference]: With dead ends: 14101 [2021-06-05 18:03:39,053 INFO L226 Difference]: Without dead ends: 13681 [2021-06-05 18:03:39,054 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4381 ImplicationChecksByTransitivity, 13890.3ms TimeCoverageRelationStatistics Valid=1558, Invalid=14698, Unknown=0, NotChecked=0, Total=16256 [2021-06-05 18:03:39,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13681 states. [2021-06-05 18:03:39,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13681 to 9876. [2021-06-05 18:03:39,153 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:03:39,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9876 states to 9876 states and 25318 transitions. [2021-06-05 18:03:39,166 INFO L78 Accepts]: Start accepts. Automaton has 9876 states and 25318 transitions. Word has length 184 [2021-06-05 18:03:39,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:03:39,166 INFO L482 AbstractCegarLoop]: Abstraction has 9876 states and 25318 transitions. [2021-06-05 18:03:39,167 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:03:39,167 INFO L276 IsEmpty]: Start isEmpty. Operand 9876 states and 25318 transitions. [2021-06-05 18:03:39,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 18:03:39,174 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:03:39,174 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:03:39,174 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-06-05 18:03:39,174 INFO L430 AbstractCegarLoop]: === Iteration 23 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:03:39,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:03:39,175 INFO L82 PathProgramCache]: Analyzing trace with hash 421691335, now seen corresponding path program 14 times [2021-06-05 18:03:39,175 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:03:39,175 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414138276] [2021-06-05 18:03:39,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:03:39,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:03:39,787 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-06-05 18:03:39,937 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-05 18:03:40,114 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-05 18:03:43,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:03:43,650 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:03:43,650 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414138276] [2021-06-05 18:03:43,650 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414138276] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:03:43,650 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:03:43,650 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 18:03:43,650 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013043395] [2021-06-05 18:03:43,650 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 18:03:43,650 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:03:43,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 18:03:43,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=2554, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 18:03:43,651 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:03:45,560 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 48 [2021-06-05 18:03:45,938 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 52 [2021-06-05 18:03:46,327 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 55 [2021-06-05 18:03:46,779 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 57 [2021-06-05 18:03:47,526 WARN L205 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 82 [2021-06-05 18:03:48,294 WARN L205 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 80 [2021-06-05 18:03:50,921 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-06-05 18:03:51,280 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-06-05 18:03:52,367 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-05 18:03:54,039 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2021-06-05 18:03:55,940 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:03:57,744 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:03:59,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:03:59,204 INFO L93 Difference]: Finished difference Result 15042 states and 38753 transitions. [2021-06-05 18:03:59,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2021-06-05 18:03:59,205 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:03:59,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:03:59,224 INFO L225 Difference]: With dead ends: 15042 [2021-06-05 18:03:59,225 INFO L226 Difference]: Without dead ends: 14622 [2021-06-05 18:03:59,226 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4625 ImplicationChecksByTransitivity, 14272.0ms TimeCoverageRelationStatistics Valid=1629, Invalid=15401, Unknown=0, NotChecked=0, Total=17030 [2021-06-05 18:03:59,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14622 states. [2021-06-05 18:03:59,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14622 to 10006. [2021-06-05 18:03:59,344 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:03:59,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10006 states to 10006 states and 25681 transitions. [2021-06-05 18:03:59,357 INFO L78 Accepts]: Start accepts. Automaton has 10006 states and 25681 transitions. Word has length 184 [2021-06-05 18:03:59,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:03:59,357 INFO L482 AbstractCegarLoop]: Abstraction has 10006 states and 25681 transitions. [2021-06-05 18:03:59,357 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:03:59,357 INFO L276 IsEmpty]: Start isEmpty. Operand 10006 states and 25681 transitions. [2021-06-05 18:03:59,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 18:03:59,365 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:03:59,365 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:03:59,365 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-06-05 18:03:59,365 INFO L430 AbstractCegarLoop]: === Iteration 24 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:03:59,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:03:59,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1697699831, now seen corresponding path program 15 times [2021-06-05 18:03:59,366 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:03:59,366 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065134158] [2021-06-05 18:03:59,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:03:59,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:03:59,984 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-06-05 18:04:00,137 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-05 18:04:00,322 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-05 18:04:04,190 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:04:04,190 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:04:04,191 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065134158] [2021-06-05 18:04:04,191 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065134158] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:04:04,191 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:04:04,191 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 18:04:04,191 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613252370] [2021-06-05 18:04:04,191 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 18:04:04,191 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:04:04,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 18:04:04,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2555, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 18:04:04,192 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:04:06,106 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 48 [2021-06-05 18:04:06,430 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 52 [2021-06-05 18:04:06,772 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 55 [2021-06-05 18:04:07,175 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 57 [2021-06-05 18:04:07,783 WARN L205 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 82 [2021-06-05 18:04:08,315 WARN L205 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 80 [2021-06-05 18:04:10,575 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-06-05 18:04:10,851 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-06-05 18:04:12,062 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-05 18:04:14,368 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2021-06-05 18:04:16,618 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:04:18,899 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:04:19,923 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:04:20,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:04:20,759 INFO L93 Difference]: Finished difference Result 16996 states and 43767 transitions. [2021-06-05 18:04:20,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2021-06-05 18:04:20,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:04:20,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:04:20,776 INFO L225 Difference]: With dead ends: 16996 [2021-06-05 18:04:20,776 INFO L226 Difference]: Without dead ends: 16576 [2021-06-05 18:04:20,778 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4802 ImplicationChecksByTransitivity, 14329.0ms TimeCoverageRelationStatistics Valid=1666, Invalid=15890, Unknown=0, NotChecked=0, Total=17556 [2021-06-05 18:04:20,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16576 states. [2021-06-05 18:04:20,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16576 to 10110. [2021-06-05 18:04:20,969 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:04:20,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10110 states to 10110 states and 25974 transitions. [2021-06-05 18:04:20,982 INFO L78 Accepts]: Start accepts. Automaton has 10110 states and 25974 transitions. Word has length 184 [2021-06-05 18:04:20,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:04:20,982 INFO L482 AbstractCegarLoop]: Abstraction has 10110 states and 25974 transitions. [2021-06-05 18:04:20,982 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:04:20,982 INFO L276 IsEmpty]: Start isEmpty. Operand 10110 states and 25974 transitions. [2021-06-05 18:04:20,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 18:04:20,989 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:04:20,989 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:04:20,989 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-06-05 18:04:20,990 INFO L430 AbstractCegarLoop]: === Iteration 25 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:04:20,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:04:20,993 INFO L82 PathProgramCache]: Analyzing trace with hash 769432839, now seen corresponding path program 16 times [2021-06-05 18:04:20,994 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:04:20,994 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329927697] [2021-06-05 18:04:20,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:04:21,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:04:21,615 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-06-05 18:04:21,811 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-05 18:04:21,982 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-05 18:04:25,324 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:04:25,324 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:04:25,324 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329927697] [2021-06-05 18:04:25,325 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329927697] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:04:25,325 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:04:25,325 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 18:04:25,325 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608689391] [2021-06-05 18:04:25,325 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 18:04:25,325 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:04:25,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 18:04:25,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=2558, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 18:04:25,326 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:04:27,174 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 48 [2021-06-05 18:04:27,630 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 52 [2021-06-05 18:04:27,992 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 55 [2021-06-05 18:04:28,397 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 57 [2021-06-05 18:04:29,082 WARN L205 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 82 [2021-06-05 18:04:29,781 WARN L205 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 80 [2021-06-05 18:04:32,337 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-06-05 18:04:32,626 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-06-05 18:04:34,082 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-05 18:04:37,039 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2021-06-05 18:04:37,473 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2021-06-05 18:04:39,078 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:04:40,952 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:04:41,946 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 18:04:42,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:04:42,707 INFO L93 Difference]: Finished difference Result 16908 states and 43553 transitions. [2021-06-05 18:04:42,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2021-06-05 18:04:42,708 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:04:42,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:04:42,726 INFO L225 Difference]: With dead ends: 16908 [2021-06-05 18:04:42,727 INFO L226 Difference]: Without dead ends: 16488 [2021-06-05 18:04:42,730 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4884 ImplicationChecksByTransitivity, 14806.2ms TimeCoverageRelationStatistics Valid=1680, Invalid=16142, Unknown=0, NotChecked=0, Total=17822 [2021-06-05 18:04:42,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16488 states. [2021-06-05 18:04:42,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16488 to 10149. [2021-06-05 18:04:42,895 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:04:42,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10149 states to 10149 states and 26079 transitions. [2021-06-05 18:04:42,914 INFO L78 Accepts]: Start accepts. Automaton has 10149 states and 26079 transitions. Word has length 184 [2021-06-05 18:04:42,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:04:42,915 INFO L482 AbstractCegarLoop]: Abstraction has 10149 states and 26079 transitions. [2021-06-05 18:04:42,915 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:04:42,915 INFO L276 IsEmpty]: Start isEmpty. Operand 10149 states and 26079 transitions. [2021-06-05 18:04:42,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 18:04:42,924 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:04:42,925 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:04:42,925 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-06-05 18:04:42,925 INFO L430 AbstractCegarLoop]: === Iteration 26 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:04:42,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:04:42,925 INFO L82 PathProgramCache]: Analyzing trace with hash 495114213, now seen corresponding path program 17 times [2021-06-05 18:04:42,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:04:42,925 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434338810] [2021-06-05 18:04:42,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:04:43,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:04:43,775 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-05 18:04:44,049 WARN L205 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-06-05 18:04:44,384 WARN L205 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-05 18:04:44,744 WARN L205 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-05 18:04:44,897 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2021-06-05 18:04:45,695 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-05 18:04:46,129 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 18:04:49,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:04:49,259 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:04:49,259 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434338810] [2021-06-05 18:04:49,259 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434338810] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:04:49,259 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:04:49,259 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 18:04:49,259 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646114061] [2021-06-05 18:04:49,260 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 18:04:49,260 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:04:49,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 18:04:49,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=2560, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 18:04:49,261 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:04:51,330 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 48 [2021-06-05 18:04:51,723 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 52 [2021-06-05 18:04:52,152 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 55 [2021-06-05 18:04:52,620 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 57 [2021-06-05 18:04:53,371 WARN L205 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 82 [2021-06-05 18:04:54,223 WARN L205 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 80 [2021-06-05 18:04:56,617 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-06-05 18:04:56,887 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-06-05 18:04:58,190 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-05 18:05:01,134 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2021-06-05 18:05:03,416 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:05:05,617 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:05:06,628 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:05:07,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:05:07,477 INFO L93 Difference]: Finished difference Result 16868 states and 43463 transitions. [2021-06-05 18:05:07,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2021-06-05 18:05:07,478 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:05:07,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:05:07,496 INFO L225 Difference]: With dead ends: 16868 [2021-06-05 18:05:07,496 INFO L226 Difference]: Without dead ends: 16448 [2021-06-05 18:05:07,498 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4971 ImplicationChecksByTransitivity, 16544.6ms TimeCoverageRelationStatistics Valid=1697, Invalid=16393, Unknown=0, NotChecked=0, Total=18090 [2021-06-05 18:05:07,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16448 states. [2021-06-05 18:05:07,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16448 to 10175. [2021-06-05 18:05:07,625 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:05:07,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10175 states to 10175 states and 26149 transitions. [2021-06-05 18:05:07,638 INFO L78 Accepts]: Start accepts. Automaton has 10175 states and 26149 transitions. Word has length 184 [2021-06-05 18:05:07,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:05:07,639 INFO L482 AbstractCegarLoop]: Abstraction has 10175 states and 26149 transitions. [2021-06-05 18:05:07,639 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:05:07,639 INFO L276 IsEmpty]: Start isEmpty. Operand 10175 states and 26149 transitions. [2021-06-05 18:05:07,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 18:05:07,647 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:05:07,648 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:05:07,648 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-06-05 18:05:07,648 INFO L430 AbstractCegarLoop]: === Iteration 27 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:05:07,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:05:07,648 INFO L82 PathProgramCache]: Analyzing trace with hash 956827493, now seen corresponding path program 18 times [2021-06-05 18:05:07,648 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:05:07,648 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145287411] [2021-06-05 18:05:07,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:05:07,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:05:08,373 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-06-05 18:05:08,598 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-05 18:05:08,793 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-05 18:05:09,839 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 18:05:12,153 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:12,153 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:05:12,153 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145287411] [2021-06-05 18:05:12,153 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145287411] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:05:12,153 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:05:12,153 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 18:05:12,153 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47468917] [2021-06-05 18:05:12,154 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 18:05:12,154 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:05:12,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 18:05:12,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=2568, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 18:05:12,154 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:05:14,057 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 48 [2021-06-05 18:05:14,412 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 52 [2021-06-05 18:05:14,863 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 55 [2021-06-05 18:05:15,373 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 57 [2021-06-05 18:05:16,069 WARN L205 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 81 [2021-06-05 18:05:16,791 WARN L205 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 79 [2021-06-05 18:05:19,573 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2021-06-05 18:05:25,296 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 81 [2021-06-05 18:05:27,552 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2021-06-05 18:05:28,360 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2021-06-05 18:05:28,735 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2021-06-05 18:05:29,673 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2021-06-05 18:05:32,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:05:32,142 INFO L93 Difference]: Finished difference Result 16890 states and 43523 transitions. [2021-06-05 18:05:32,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2021-06-05 18:05:32,142 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:05:32,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:05:32,160 INFO L225 Difference]: With dead ends: 16890 [2021-06-05 18:05:32,160 INFO L226 Difference]: Without dead ends: 16470 [2021-06-05 18:05:32,161 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 19 SyntacticMatches, 5 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5171 ImplicationChecksByTransitivity, 15171.6ms TimeCoverageRelationStatistics Valid=1729, Invalid=17177, Unknown=0, NotChecked=0, Total=18906 [2021-06-05 18:05:32,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16470 states. [2021-06-05 18:05:32,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16470 to 10188. [2021-06-05 18:05:32,289 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:05:32,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10188 states to 10188 states and 26184 transitions. [2021-06-05 18:05:32,303 INFO L78 Accepts]: Start accepts. Automaton has 10188 states and 26184 transitions. Word has length 184 [2021-06-05 18:05:32,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:05:32,303 INFO L482 AbstractCegarLoop]: Abstraction has 10188 states and 26184 transitions. [2021-06-05 18:05:32,303 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:05:32,303 INFO L276 IsEmpty]: Start isEmpty. Operand 10188 states and 26184 transitions. [2021-06-05 18:05:32,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 18:05:32,310 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:05:32,310 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:05:32,310 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-06-05 18:05:32,311 INFO L430 AbstractCegarLoop]: === Iteration 28 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:05:32,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:05:32,311 INFO L82 PathProgramCache]: Analyzing trace with hash 913127371, now seen corresponding path program 19 times [2021-06-05 18:05:32,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:05:32,311 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306241476] [2021-06-05 18:05:32,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:05:32,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:05:32,875 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-06-05 18:05:33,033 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-05 18:05:33,211 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-05 18:05:34,389 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 18:05:37,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:05:37,169 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:05:37,169 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306241476] [2021-06-05 18:05:37,169 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306241476] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:05:37,169 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:05:37,169 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 18:05:37,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880061050] [2021-06-05 18:05:37,170 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 18:05:37,170 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:05:37,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 18:05:37,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2566, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 18:05:37,171 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:05:39,640 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 48 [2021-06-05 18:05:40,096 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 52 [2021-06-05 18:05:40,566 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 55 [2021-06-05 18:05:41,099 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 57 [2021-06-05 18:05:41,962 WARN L205 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 82 [2021-06-05 18:05:42,822 WARN L205 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 80 [2021-06-05 18:05:45,172 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-06-05 18:05:45,433 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-06-05 18:05:46,677 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-05 18:05:48,407 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 81 [2021-06-05 18:05:50,062 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2021-06-05 18:05:52,613 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:05:54,992 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:05:57,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:05:57,088 INFO L93 Difference]: Finished difference Result 18020 states and 46463 transitions. [2021-06-05 18:05:57,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2021-06-05 18:05:57,089 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:05:57,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:05:57,108 INFO L225 Difference]: With dead ends: 18020 [2021-06-05 18:05:57,108 INFO L226 Difference]: Without dead ends: 17600 [2021-06-05 18:05:57,109 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5235 ImplicationChecksByTransitivity, 16364.8ms TimeCoverageRelationStatistics Valid=1757, Invalid=17149, Unknown=0, NotChecked=0, Total=18906 [2021-06-05 18:05:57,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17600 states. [2021-06-05 18:05:57,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17600 to 10500. [2021-06-05 18:05:57,236 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:05:57,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10500 states to 10500 states and 27024 transitions. [2021-06-05 18:05:57,250 INFO L78 Accepts]: Start accepts. Automaton has 10500 states and 27024 transitions. Word has length 184 [2021-06-05 18:05:57,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:05:57,250 INFO L482 AbstractCegarLoop]: Abstraction has 10500 states and 27024 transitions. [2021-06-05 18:05:57,250 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:05:57,250 INFO L276 IsEmpty]: Start isEmpty. Operand 10500 states and 27024 transitions. [2021-06-05 18:05:57,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 18:05:57,258 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:05:57,258 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:05:57,258 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-06-05 18:05:57,258 INFO L430 AbstractCegarLoop]: === Iteration 29 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:05:57,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:05:57,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1490581689, now seen corresponding path program 20 times [2021-06-05 18:05:57,258 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:05:57,259 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850657893] [2021-06-05 18:05:57,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:05:57,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:05:57,963 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-06-05 18:05:58,162 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-05 18:05:58,376 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-05 18:06:01,922 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:01,922 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:06:01,922 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850657893] [2021-06-05 18:06:01,922 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850657893] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:06:01,922 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:06:01,922 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 18:06:01,922 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261932455] [2021-06-05 18:06:01,922 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 18:06:01,922 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:06:01,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 18:06:01,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2555, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 18:06:01,923 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:06:03,926 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 48 [2021-06-05 18:06:04,379 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 52 [2021-06-05 18:06:04,795 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 55 [2021-06-05 18:06:05,212 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 57 [2021-06-05 18:06:05,964 WARN L205 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 82 [2021-06-05 18:06:06,690 WARN L205 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 80 [2021-06-05 18:06:09,695 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-06-05 18:06:10,045 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-06-05 18:06:11,264 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2021-06-05 18:06:11,582 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-05 18:06:12,066 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2021-06-05 18:06:12,658 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 67 [2021-06-05 18:06:13,431 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 71 [2021-06-05 18:06:14,443 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 71 [2021-06-05 18:06:14,771 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2021-06-05 18:06:15,104 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2021-06-05 18:06:17,737 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2021-06-05 18:06:18,438 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2021-06-05 18:06:18,709 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2021-06-05 18:06:19,230 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 18:06:19,595 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2021-06-05 18:06:20,074 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2021-06-05 18:06:21,572 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2021-06-05 18:06:21,846 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 18:06:22,430 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2021-06-05 18:06:23,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:06:23,764 INFO L93 Difference]: Finished difference Result 15114 states and 39033 transitions. [2021-06-05 18:06:23,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2021-06-05 18:06:23,765 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:06:23,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:06:23,779 INFO L225 Difference]: With dead ends: 15114 [2021-06-05 18:06:23,779 INFO L226 Difference]: Without dead ends: 14694 [2021-06-05 18:06:23,780 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4714 ImplicationChecksByTransitivity, 16065.1ms TimeCoverageRelationStatistics Valid=1645, Invalid=15647, Unknown=0, NotChecked=0, Total=17292 [2021-06-05 18:06:23,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14694 states. [2021-06-05 18:06:23,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14694 to 10500. [2021-06-05 18:06:23,902 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:06:23,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10500 states to 10500 states and 27024 transitions. [2021-06-05 18:06:23,916 INFO L78 Accepts]: Start accepts. Automaton has 10500 states and 27024 transitions. Word has length 184 [2021-06-05 18:06:23,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:06:23,916 INFO L482 AbstractCegarLoop]: Abstraction has 10500 states and 27024 transitions. [2021-06-05 18:06:23,916 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:06:23,917 INFO L276 IsEmpty]: Start isEmpty. Operand 10500 states and 27024 transitions. [2021-06-05 18:06:23,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 18:06:23,924 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:06:23,924 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:23,924 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-06-05 18:06:23,924 INFO L430 AbstractCegarLoop]: === Iteration 30 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:06:23,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:06:23,925 INFO L82 PathProgramCache]: Analyzing trace with hash 473197579, now seen corresponding path program 21 times [2021-06-05 18:06:23,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:06:23,925 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942749388] [2021-06-05 18:06:23,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:06:23,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2021-06-05 18:10:00,400 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:10:00,404 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:10:00,404 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:10:00,405 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:10:00,406 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:10:00,407 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:10:00,408 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:10:00,409 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:10:00,409 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:10:00,410 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:10:00,411 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:10:00,412 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:10:00,412 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:10:00,417 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:10:00,418 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:10:00,421 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:10:00,423 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:10:00,424 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:10:00,424 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:10:00,425 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:10:00,425 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:10:00,433 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:10:00,433 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:10:00,433 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:10:00,434 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:10:00,434 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:10:00,434 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:10:00,434 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:10:00,435 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:10:00,435 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:10:00,435 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:10:00,442 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:10:00,442 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:10:00,443 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:10:00,443 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:10:00,443 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:10:00,443 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:10:00,443 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:10:00,443 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:10:00,444 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:10:00,444 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:10:00,444 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:10:00,444 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:10:00,444 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:10:00,444 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 18:10:00,446 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-06-05 18:10:00,446 WARN L547 AbstractCegarLoop]: Verification canceled [2021-06-05 18:10:00,446 INFO L301 ceAbstractionStarter]: Result for error location t2Thread1of1ForFork1 was TIMEOUT (3/5) [2021-06-05 18:10:00,447 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 18:10:00,447 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 18:10:00,447 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 18:10:00,447 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 18:10:00,447 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 18:10:00,447 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 18:10:00,447 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 18:10:00,448 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 18:10:00,448 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == t1======== [2021-06-05 18:10:00,451 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 247 places, 257 transitions, 536 flow [2021-06-05 18:10:00,451 WARN L547 AbstractCegarLoop]: Verification canceled [2021-06-05 18:10:00,451 INFO L301 ceAbstractionStarter]: Result for error location t1 was TIMEOUT (4/5) [2021-06-05 18:10:00,452 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 18:10:00,452 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 18:10:00,453 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 18:10:00,453 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 18:10:00,453 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 18:10:00,453 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 18:10:00,453 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 18:10:00,453 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 18:10:00,453 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == t2======== [2021-06-05 18:10:00,454 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 247 places, 257 transitions, 536 flow [2021-06-05 18:10:00,454 WARN L547 AbstractCegarLoop]: Verification canceled [2021-06-05 18:10:00,455 INFO L301 ceAbstractionStarter]: Result for error location t2 was TIMEOUT (5/5) [2021-06-05 18:10:00,455 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-05 18:10:00,457 WARN L196 ceAbstractionStarter]: Timeout [2021-06-05 18:10:00,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 06:10:00 BasicIcfg [2021-06-05 18:10:00,457 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 18:10:00,457 INFO L168 Benchmark]: Toolchain (without parser) took 770354.11 ms. Allocated memory was 337.6 MB in the beginning and 6.1 GB in the end (delta: 5.7 GB). Free memory was 299.5 MB in the beginning and 3.3 GB in the end (delta: -3.0 GB). Peak memory consumption was 2.7 GB. Max. memory is 16.0 GB. [2021-06-05 18:10:00,457 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 337.6 MB. Free memory was 317.8 MB in the beginning and 317.8 MB in the end (delta: 65.6 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 18:10:00,457 INFO L168 Benchmark]: CACSL2BoogieTranslator took 593.37 ms. Allocated memory is still 337.6 MB. Free memory was 299.3 MB in the beginning and 271.9 MB in the end (delta: 27.4 MB). Peak memory consumption was 28.7 MB. Max. memory is 16.0 GB. [2021-06-05 18:10:00,458 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.55 ms. Allocated memory is still 337.6 MB. Free memory was 271.9 MB in the beginning and 268.5 MB in the end (delta: 3.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-06-05 18:10:00,458 INFO L168 Benchmark]: Boogie Preprocessor took 62.40 ms. Allocated memory is still 337.6 MB. Free memory was 268.5 MB in the beginning and 266.4 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:10:00,458 INFO L168 Benchmark]: RCFGBuilder took 714.19 ms. Allocated memory is still 337.6 MB. Free memory was 266.4 MB in the beginning and 218.2 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:10:00,458 INFO L168 Benchmark]: TraceAbstraction took 768916.26 ms. Allocated memory was 337.6 MB in the beginning and 6.1 GB in the end (delta: 5.7 GB). Free memory was 217.4 MB in the beginning and 3.3 GB in the end (delta: -3.1 GB). Peak memory consumption was 2.6 GB. Max. memory is 16.0 GB. [2021-06-05 18:10:00,458 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.19 ms. Allocated memory is still 337.6 MB. Free memory was 317.8 MB in the beginning and 317.8 MB in the end (delta: 65.6 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 593.37 ms. Allocated memory is still 337.6 MB. Free memory was 299.3 MB in the beginning and 271.9 MB in the end (delta: 27.4 MB). Peak memory consumption was 28.7 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 61.55 ms. Allocated memory is still 337.6 MB. Free memory was 271.9 MB in the beginning and 268.5 MB in the end (delta: 3.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 62.40 ms. Allocated memory is still 337.6 MB. Free memory was 268.5 MB in the beginning and 266.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 714.19 ms. Allocated memory is still 337.6 MB. Free memory was 266.4 MB in the beginning and 218.2 MB in the end (delta: 48.2 MB). Peak memory consumption was 48.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 768916.26 ms. Allocated memory was 337.6 MB in the beginning and 6.1 GB in the end (delta: 5.7 GB). Free memory was 217.4 MB in the beginning and 3.3 GB in the end (delta: -3.1 GB). Peak memory consumption was 2.6 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: 25423.8ms, OverallIterations: 11, TraceHistogramMax: 1, EmptinessCheckTime: 238.5ms, AutomataDifference: 14872.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1121.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 3197 SDtfs, 11722 SDslu, 25106 SDs, 0 SdLazy, 9227 SolverSat, 580 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4526.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 331 GetRequests, 34 SyntacticMatches, 8 SemanticMatches, 289 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2352 ImplicationChecksByTransitivity, 10528.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: 4015.1ms AutomataMinimizationTime, 11 MinimizatonAttempts, 9458 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 60.0ms SsaConstructionTime, 380.3ms SatisfiabilityAnalysisTime, 4515.0ms InterpolantComputationTime, 1166 NumberOfCodeBlocks, 1166 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1155 ConstructedInterpolants, 0 QuantifiedInterpolants, 10984 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 402 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1020.4ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 28.7ms, AutomataDifference: 121.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 852.3ms, 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.4ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.3ms SsaConstructionTime, 3.6ms SatisfiabilityAnalysisTime, 7.2ms 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: 742180.5ms, OverallIterations: 30, TraceHistogramMax: 1, EmptinessCheckTime: 263.0ms, AutomataDifference: 416108.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 703.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 12522 SDtfs, 72590 SDslu, 293848 SDs, 0 SdLazy, 145257 SolverSat, 3764 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 141708.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3607 GetRequests, 518 SyntacticMatches, 123 SemanticMatches, 2966 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101793 ImplicationChecksByTransitivity, 347490.3ms 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: 4245.4ms AutomataMinimizationTime, 29 MinimizatonAttempts, 101880 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 93.6ms SsaConstructionTime, 725.9ms SatisfiabilityAnalysisTime, 103304.1ms InterpolantComputationTime, 5088 NumberOfCodeBlocks, 5088 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 5059 ConstructedInterpolants, 0 QuantifiedInterpolants, 378503 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t1 with 1 thread instances CFG has 5 procedures, 402 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 4.2ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 3.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - 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.0ms, 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