/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/concurrent/pthreads/distributed_search2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7a177ad [2020-11-09 16:11:13,874 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-09 16:11:13,876 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-09 16:11:13,931 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-09 16:11:13,932 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-09 16:11:13,936 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-09 16:11:13,939 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-09 16:11:13,946 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-09 16:11:13,949 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-09 16:11:13,954 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-09 16:11:13,955 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-09 16:11:13,957 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-09 16:11:13,957 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-09 16:11:13,960 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-09 16:11:13,962 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-09 16:11:13,963 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-09 16:11:13,964 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-09 16:11:13,968 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-09 16:11:13,976 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-09 16:11:13,984 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-09 16:11:13,988 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-09 16:11:13,989 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-09 16:11:13,990 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-09 16:11:13,991 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-09 16:11:13,998 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-09 16:11:13,999 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-09 16:11:13,999 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-09 16:11:14,001 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-09 16:11:14,002 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-09 16:11:14,003 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-09 16:11:14,003 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-09 16:11:14,004 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-09 16:11:14,005 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-09 16:11:14,006 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-09 16:11:14,007 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-09 16:11:14,007 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-09 16:11:14,008 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-09 16:11:14,008 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-09 16:11:14,009 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-09 16:11:14,022 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-09 16:11:14,023 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-09 16:11:14,024 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-11-09 16:11:14,077 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-09 16:11:14,077 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-09 16:11:14,082 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-09 16:11:14,082 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-09 16:11:14,082 INFO L138 SettingsManager]: * Use SBE=true [2020-11-09 16:11:14,082 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-09 16:11:14,083 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-09 16:11:14,083 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-09 16:11:14,083 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-09 16:11:14,083 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-09 16:11:14,085 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-09 16:11:14,085 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-09 16:11:14,085 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-09 16:11:14,085 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-09 16:11:14,085 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-09 16:11:14,085 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-09 16:11:14,086 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-09 16:11:14,086 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-09 16:11:14,086 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-09 16:11:14,086 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-09 16:11:14,087 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-09 16:11:14,087 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 16:11:14,087 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-09 16:11:14,087 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-11-09 16:11:14,087 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-09 16:11:14,088 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-09 16:11:14,088 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-09 16:11:14,088 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-11-09 16:11:14,088 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-11-09 16:11:14,088 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-09 16:11:14,089 INFO L138 SettingsManager]: * Interpolant automaton=MCR 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 [2020-11-09 16:11:14,468 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-09 16:11:14,502 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-09 16:11:14,505 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-09 16:11:14,506 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-09 16:11:14,507 INFO L275 PluginConnector]: CDTParser initialized [2020-11-09 16:11:14,508 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/pthreads/distributed_search2.c [2020-11-09 16:11:14,597 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c514fb29f/c40beb397d3441d186dd0e84ad959882/FLAGa7fc01f16 [2020-11-09 16:11:15,142 INFO L306 CDTParser]: Found 1 translation units. [2020-11-09 16:11:15,143 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/concurrent/pthreads/distributed_search2.c [2020-11-09 16:11:15,143 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2020-11-09 16:11:15,144 WARN L117 ultiparseSymbolTable]: System include stdio.h could not be resolved by CDT -- only built-in system includes are available. [2020-11-09 16:11:15,184 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c514fb29f/c40beb397d3441d186dd0e84ad959882/FLAGa7fc01f16 [2020-11-09 16:11:15,508 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c514fb29f/c40beb397d3441d186dd0e84ad959882 [2020-11-09 16:11:15,512 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-09 16:11:15,520 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-09 16:11:15,522 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-09 16:11:15,523 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-09 16:11:15,527 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-09 16:11:15,530 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:11:15" (1/1) ... [2020-11-09 16:11:15,544 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b06d7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:11:15, skipping insertion in model container [2020-11-09 16:11:15,544 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:11:15" (1/1) ... [2020-11-09 16:11:15,554 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-09 16:11:15,577 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-09 16:11:15,776 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 16:11:15,784 INFO L203 MainTranslator]: Completed pre-run [2020-11-09 16:11:15,808 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 16:11:15,823 INFO L208 MainTranslator]: Completed translation [2020-11-09 16:11:15,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:11:15 WrapperNode [2020-11-09 16:11:15,824 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-09 16:11:15,825 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-09 16:11:15,826 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-09 16:11:15,826 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-09 16:11:15,834 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:11:15" (1/1) ... [2020-11-09 16:11:15,842 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:11:15" (1/1) ... [2020-11-09 16:11:15,875 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-09 16:11:15,876 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-09 16:11:15,876 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-09 16:11:15,876 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-09 16:11:15,886 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:11:15" (1/1) ... [2020-11-09 16:11:15,886 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:11:15" (1/1) ... [2020-11-09 16:11:15,889 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:11:15" (1/1) ... [2020-11-09 16:11:15,890 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:11:15" (1/1) ... [2020-11-09 16:11:15,897 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:11:15" (1/1) ... [2020-11-09 16:11:15,902 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:11:15" (1/1) ... [2020-11-09 16:11:15,904 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:11:15" (1/1) ... [2020-11-09 16:11:15,907 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-09 16:11:15,908 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-09 16:11:15,908 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-09 16:11:15,908 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-09 16:11:15,909 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:11:15" (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 [2020-11-09 16:11:15,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-09 16:11:15,989 INFO L130 BoogieDeclarations]: Found specification of procedure search_worker [2020-11-09 16:11:15,990 INFO L138 BoogieDeclarations]: Found implementation of procedure search_worker [2020-11-09 16:11:15,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-09 16:11:15,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-09 16:11:15,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-09 16:11:15,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-09 16:11:15,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-09 16:11:15,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-09 16:11:15,993 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-09 16:11:16,778 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-09 16:11:16,779 INFO L298 CfgBuilder]: Removed 7 assume(true) statements. [2020-11-09 16:11:16,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:11:16 BoogieIcfgContainer [2020-11-09 16:11:16,781 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-09 16:11:16,783 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-09 16:11:16,783 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-09 16:11:16,787 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-09 16:11:16,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 04:11:15" (1/3) ... [2020-11-09 16:11:16,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f52a7ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:11:16, skipping insertion in model container [2020-11-09 16:11:16,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:11:15" (2/3) ... [2020-11-09 16:11:16,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f52a7ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:11:16, skipping insertion in model container [2020-11-09 16:11:16,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:11:16" (3/3) ... [2020-11-09 16:11:16,791 INFO L111 eAbstractionObserver]: Analyzing ICFG distributed_search2.c [2020-11-09 16:11:16,808 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-09 16:11:16,809 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-09 16:11:16,813 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-09 16:11:16,814 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-09 16:11:16,849 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork0_#in~params.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,850 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork0_#in~params.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,850 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork0_~params.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,850 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork0_~params.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,851 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork0_#in~params.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,851 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork0_#in~params.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,851 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork0_~params.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,851 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork0_~params.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,851 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork0_~params.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,852 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork0_~params.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,852 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork0_~bounds~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,852 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork0_~bounds~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,852 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork0_~params.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,852 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork0_~params.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,852 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork0_~bounds~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,853 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork0_~bounds~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,853 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork0_~bounds~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,853 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork0_~bounds~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,853 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork0_#t~mem0| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,854 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork0_~bounds~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,854 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork0_~bounds~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,854 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork0_#t~mem0| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,854 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork0_#t~mem0| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,854 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork0_~lower~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,855 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork0_#t~mem0| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,855 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork0_~lower~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,855 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork0_#t~mem0| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,855 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork0_#t~mem0| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,855 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork0_~bounds~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,856 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork0_~bounds~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,856 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,856 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork0_~bounds~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,856 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork0_~bounds~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,856 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,857 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,857 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork0_~upper~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,857 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,857 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork0_~upper~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,857 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,858 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,858 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork0_~lower~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,858 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,858 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork0_~lower~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,858 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,859 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork0_~upper~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,859 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,859 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork0_~upper~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,859 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,860 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork0_~upper~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,860 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,860 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork0_~upper~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,860 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,860 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,861 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,861 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,861 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,861 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,861 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,862 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,862 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,862 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,862 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,862 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,863 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,863 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,863 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,863 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,864 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,864 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,864 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,864 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,864 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,865 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,865 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,865 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,865 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,866 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,866 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,866 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,866 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,867 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork1_#in~params.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,867 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork1_#in~params.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,867 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork1_~params.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,867 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork1_~params.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,867 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork1_#in~params.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,868 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork1_#in~params.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,868 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork1_~params.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,868 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork1_~params.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,868 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork1_~params.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,868 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork1_~params.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,869 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork1_~bounds~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,869 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork1_~bounds~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,869 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork1_~params.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,869 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork1_~params.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,869 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork1_~bounds~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,869 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork1_~bounds~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,870 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork1_~bounds~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,870 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork1_~bounds~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,870 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork1_#t~mem0| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,870 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork1_~bounds~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,871 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork1_~bounds~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,871 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork1_#t~mem0| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,871 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork1_#t~mem0| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,871 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork1_~lower~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,871 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork1_#t~mem0| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,872 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork1_~lower~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,872 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork1_#t~mem0| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,872 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork1_#t~mem0| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,872 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork1_~bounds~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,872 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork1_~bounds~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,873 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork1_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,873 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork1_~bounds~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,873 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork1_~bounds~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,873 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork1_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,874 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork1_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,874 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork1_~upper~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,874 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork1_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,874 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork1_~upper~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,874 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork1_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,875 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork1_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,875 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork1_~lower~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,875 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,875 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork1_~lower~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,875 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,876 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork1_~upper~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,876 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,876 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork1_~upper~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,876 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,877 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork1_~upper~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,877 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,877 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork1_~upper~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,877 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,878 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,878 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,878 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,878 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,878 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,879 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,879 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,879 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,879 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,880 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,880 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,880 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,880 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,880 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,881 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,881 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,881 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,881 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,882 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,882 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,882 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,882 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,882 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,883 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,883 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,883 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,883 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,883 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,886 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,886 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork0_~params.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,886 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,886 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,886 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,887 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork0_~bounds~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,887 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,887 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork0_~params.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,887 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork0_~bounds~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,887 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,888 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork0_~lower~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,888 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork0_#t~mem0| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,888 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork0_~upper~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,899 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,899 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork1_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,899 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork1_~params.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,900 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork1_#t~mem0| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,900 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,900 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,900 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork1_~bounds~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,900 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,901 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork1_~params.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,901 WARN L313 ript$VariableManager]: TermVariabe |search_workerThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,901 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork1_~bounds~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,901 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork1_~lower~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,901 WARN L313 ript$VariableManager]: TermVariabe search_workerThread1of1ForFork1_~upper~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:11:16,908 INFO L149 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2020-11-09 16:11:16,922 INFO L253 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2020-11-09 16:11:16,945 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-09 16:11:16,946 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-09 16:11:16,946 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-09 16:11:16,946 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-11-09 16:11:16,946 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-09 16:11:16,946 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-09 16:11:16,946 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-09 16:11:16,946 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-09 16:11:16,961 INFO L128 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-11-09 16:11:16,962 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 138 transitions, 298 flow [2020-11-09 16:11:16,965 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 138 transitions, 298 flow [2020-11-09 16:11:16,967 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 135 places, 138 transitions, 298 flow [2020-11-09 16:11:17,041 INFO L129 PetriNetUnfolder]: 9/138 cut-off events. [2020-11-09 16:11:17,041 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-11-09 16:11:17,048 INFO L84 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 138 events. 9/138 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 159 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 71. Up to 3 conditions per place. [2020-11-09 16:11:17,052 INFO L116 LiptonReduction]: Number of co-enabled transitions 1920 [2020-11-09 16:11:21,302 WARN L194 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-11-09 16:11:21,444 WARN L194 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-11-09 16:11:21,601 WARN L194 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-11-09 16:11:21,741 WARN L194 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-11-09 16:11:22,580 WARN L194 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2020-11-09 16:11:22,774 WARN L194 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2020-11-09 16:11:23,206 WARN L194 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2020-11-09 16:11:23,396 WARN L194 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-11-09 16:11:23,405 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 11, 1] term [2020-11-09 16:11:23,406 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:11:23,742 WARN L194 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-11-09 16:11:23,745 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 11, 1] term [2020-11-09 16:11:23,746 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 16:11:23,748 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 11, 1] term [2020-11-09 16:11:23,748 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:11:23,750 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 11, 1] term [2020-11-09 16:11:23,750 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:11:23,753 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:11:24,278 WARN L194 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2020-11-09 16:11:24,833 WARN L194 SmtUtils]: Spent 551.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 119 [2020-11-09 16:11:25,061 WARN L194 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-11-09 16:11:25,582 WARN L194 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 119 [2020-11-09 16:11:25,793 WARN L194 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-11-09 16:11:26,047 WARN L194 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-11-09 16:11:26,283 WARN L194 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2020-11-09 16:11:26,549 WARN L194 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-11-09 16:11:26,819 WARN L194 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2020-11-09 16:11:26,828 INFO L131 LiptonReduction]: Checked pairs total: 4237 [2020-11-09 16:11:26,828 INFO L133 LiptonReduction]: Total number of compositions: 125 [2020-11-09 16:11:26,835 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 31 places, 30 transitions, 82 flow [2020-11-09 16:11:26,850 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 126 states. [2020-11-09 16:11:26,852 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states. [2020-11-09 16:11:26,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 16:11:26,862 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:11:26,862 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:11:26,863 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-11-09 16:11:26,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:11:26,869 INFO L82 PathProgramCache]: Analyzing trace with hash -878946956, now seen corresponding path program 1 times [2020-11-09 16:11:26,888 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:11:26,888 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244568795] [2020-11-09 16:11:26,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:11:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:11:27,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:11:27,119 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244568795] [2020-11-09 16:11:27,120 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:11:27,121 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 16:11:27,121 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [878480350] [2020-11-09 16:11:27,122 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:11:27,131 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:11:27,159 INFO L252 McrAutomatonBuilder]: Finished intersection with 46 states and 80 transitions. [2020-11-09 16:11:27,160 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:11:27,305 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:11:27,306 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 16:11:27,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:11:27,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 16:11:27,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-09 16:11:27,325 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 5 states. [2020-11-09 16:11:27,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:11:27,420 INFO L93 Difference]: Finished difference Result 126 states and 313 transitions. [2020-11-09 16:11:27,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 16:11:27,422 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-11-09 16:11:27,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:11:27,434 INFO L225 Difference]: With dead ends: 126 [2020-11-09 16:11:27,434 INFO L226 Difference]: Without dead ends: 104 [2020-11-09 16:11:27,435 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-09 16:11:27,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-11-09 16:11:27,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2020-11-09 16:11:27,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-11-09 16:11:27,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 267 transitions. [2020-11-09 16:11:27,483 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 267 transitions. Word has length 16 [2020-11-09 16:11:27,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:11:27,485 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 267 transitions. [2020-11-09 16:11:27,485 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 16:11:27,485 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 267 transitions. [2020-11-09 16:11:27,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 16:11:27,487 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:11:27,487 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:11:27,487 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-09 16:11:27,487 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-11-09 16:11:27,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:11:27,488 INFO L82 PathProgramCache]: Analyzing trace with hash 351436872, now seen corresponding path program 1 times [2020-11-09 16:11:27,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:11:27,490 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355574142] [2020-11-09 16:11:27,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:11:27,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:11:27,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:11:27,656 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355574142] [2020-11-09 16:11:27,657 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:11:27,657 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 16:11:27,657 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1988067132] [2020-11-09 16:11:27,657 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:11:27,663 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:11:27,674 INFO L252 McrAutomatonBuilder]: Finished intersection with 43 states and 74 transitions. [2020-11-09 16:11:27,675 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:11:27,810 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:11:27,811 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 16:11:27,811 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:11:27,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 16:11:27,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 16:11:27,813 INFO L87 Difference]: Start difference. First operand 104 states and 267 transitions. Second operand 3 states. [2020-11-09 16:11:27,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:11:27,842 INFO L93 Difference]: Finished difference Result 170 states and 444 transitions. [2020-11-09 16:11:27,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 16:11:27,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-11-09 16:11:27,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:11:27,845 INFO L225 Difference]: With dead ends: 170 [2020-11-09 16:11:27,845 INFO L226 Difference]: Without dead ends: 163 [2020-11-09 16:11:27,846 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 15 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 16:11:27,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2020-11-09 16:11:27,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 140. [2020-11-09 16:11:27,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-11-09 16:11:27,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 372 transitions. [2020-11-09 16:11:27,867 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 372 transitions. Word has length 16 [2020-11-09 16:11:27,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:11:27,867 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 372 transitions. [2020-11-09 16:11:27,867 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 16:11:27,867 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 372 transitions. [2020-11-09 16:11:27,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-09 16:11:27,870 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:11:27,870 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:11:27,871 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-09 16:11:27,871 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-11-09 16:11:27,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:11:27,871 INFO L82 PathProgramCache]: Analyzing trace with hash 443469900, now seen corresponding path program 1 times [2020-11-09 16:11:27,878 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:11:27,878 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777936915] [2020-11-09 16:11:27,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:11:28,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:11:28,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:11:28,172 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777936915] [2020-11-09 16:11:28,172 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985254865] [2020-11-09 16:11:28,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-09 16:11:28,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:11:28,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 68 conjunts are in the unsatisfiable core [2020-11-09 16:11:28,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-09 16:11:28,312 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:11:28,602 WARN L194 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 30 [2020-11-09 16:11:28,604 INFO L348 Elim1Store]: treesize reduction 141, result has 26.9 percent of original size [2020-11-09 16:11:28,604 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 240 treesize of output 272 [2020-11-09 16:11:28,609 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 2, 1] term [2020-11-09 16:11:28,610 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:11:28,613 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-09 16:11:28,616 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:11:28,617 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:11:28,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:11:28,632 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:11:28,636 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:11:28,636 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:11:28,644 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-09 16:11:28,857 WARN L194 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 30 [2020-11-09 16:11:28,858 INFO L348 Elim1Store]: treesize reduction 141, result has 26.9 percent of original size [2020-11-09 16:11:28,859 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 240 treesize of output 272 [2020-11-09 16:11:28,861 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 2, 1] term [2020-11-09 16:11:28,862 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:11:28,864 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-09 16:11:28,865 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:11:28,867 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:11:28,870 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:11:28,872 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:11:28,873 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:11:28,874 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:11:28,880 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-09 16:11:29,057 WARN L194 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 30 [2020-11-09 16:11:29,058 INFO L348 Elim1Store]: treesize reduction 141, result has 26.9 percent of original size [2020-11-09 16:11:29,059 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 240 treesize of output 272 [2020-11-09 16:11:29,061 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 2, 1] term [2020-11-09 16:11:29,062 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:11:29,063 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:11:29,065 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-09 16:11:29,067 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:11:29,068 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:11:29,069 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:11:29,074 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-09 16:11:29,882 WARN L194 SmtUtils]: Spent 807.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 68 [2020-11-09 16:11:29,883 INFO L625 ElimStorePlain]: treesize reduction 1767, result has 13.1 percent of original size [2020-11-09 16:11:29,897 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2020-11-09 16:11:29,900 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-11-09 16:11:30,203 WARN L194 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2020-11-09 16:11:30,206 INFO L625 ElimStorePlain]: treesize reduction 91, result has 64.2 percent of original size [2020-11-09 16:11:30,216 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2020-11-09 16:11:30,218 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-11-09 16:11:30,347 WARN L194 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2020-11-09 16:11:30,348 INFO L625 ElimStorePlain]: treesize reduction 81, result has 46.7 percent of original size [2020-11-09 16:11:30,353 INFO L603 QuantifierPusher]: Distributing 5 conjuncts over 4 disjuncts [2020-11-09 16:11:30,355 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-09 16:11:30,356 INFO L244 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:240, output treesize:71 [2020-11-09 16:11:30,359 INFO L603 QuantifierPusher]: Distributing 5 conjuncts over 4 disjuncts [2020-11-09 16:11:30,410 INFO L603 QuantifierPusher]: Distributing 5 conjuncts over 4 disjuncts [2020-11-09 16:11:30,797 WARN L194 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2020-11-09 16:11:30,817 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-09 16:11:30,850 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-09 16:11:30,877 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-09 16:11:30,896 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:11:30,901 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 16:11:30,929 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-09 16:11:30,931 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-09 16:11:30,950 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-09 16:11:30,964 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-09 16:11:30,986 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-09 16:11:31,000 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-09 16:11:31,016 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-09 16:11:31,029 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-09 16:11:31,042 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-09 16:11:31,057 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-09 16:11:31,078 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-09 16:11:31,100 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-09 16:11:31,118 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-09 16:11:31,165 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-09 16:11:31,178 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-09 16:11:31,192 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-09 16:11:31,268 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 16:11:31,270 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 37 [2020-11-09 16:11:31,271 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-09 16:11:31,335 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 16:11:31,336 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 26 treesize of output 64 [2020-11-09 16:11:31,337 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-09 16:11:31,382 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 16:11:31,383 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 37 [2020-11-09 16:11:31,384 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-09 16:11:31,486 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 16:11:31,487 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 31 treesize of output 99 [2020-11-09 16:11:31,488 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-11-09 16:11:31,584 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 16:11:31,585 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 31 treesize of output 99 [2020-11-09 16:11:31,587 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-11-09 16:11:31,691 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 16:11:31,692 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 31 treesize of output 99 [2020-11-09 16:11:31,694 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-11-09 16:11:31,764 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 16:11:31,765 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 26 treesize of output 64 [2020-11-09 16:11:31,766 INFO L547 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-11-09 16:11:31,805 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 16:11:31,806 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 37 [2020-11-09 16:11:31,806 INFO L547 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-11-09 16:11:31,855 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 16:11:31,855 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 26 treesize of output 64 [2020-11-09 16:11:31,856 INFO L547 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2020-11-09 16:11:33,089 WARN L194 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 90 DAG size of output: 84 [2020-11-09 16:11:33,090 INFO L625 ElimStorePlain]: treesize reduction 36, result has 95.4 percent of original size [2020-11-09 16:11:33,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-09 16:11:33,116 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2020-11-09 16:11:33,117 INFO L547 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2020-11-09 16:11:33,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-09 16:11:33,144 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2020-11-09 16:11:33,145 INFO L547 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2020-11-09 16:11:33,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-09 16:11:33,178 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2020-11-09 16:11:33,179 INFO L547 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2020-11-09 16:11:33,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-09 16:11:33,203 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2020-11-09 16:11:33,204 INFO L547 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2020-11-09 16:11:33,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-09 16:11:33,235 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2020-11-09 16:11:33,236 INFO L547 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2020-11-09 16:11:33,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-09 16:11:33,260 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2020-11-09 16:11:33,261 INFO L547 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2020-11-09 16:11:33,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-09 16:11:33,284 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2020-11-09 16:11:33,285 INFO L547 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2020-11-09 16:11:33,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-09 16:11:33,311 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2020-11-09 16:11:33,312 INFO L547 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2020-11-09 16:11:33,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-09 16:11:33,331 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2020-11-09 16:11:33,332 INFO L547 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2020-11-09 16:11:33,871 WARN L194 SmtUtils]: Spent 538.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-11-09 16:11:33,872 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 16:11:33,904 INFO L547 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 18 dim-0 vars, and 9 xjuncts. [2020-11-09 16:11:33,904 INFO L244 ElimStorePlain]: Needed 19 recursive calls to eliminate 8 variables, input treesize:835, output treesize:739 [2020-11-09 16:11:34,893 WARN L194 SmtUtils]: Spent 934.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 55 [2020-11-09 16:11:35,027 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 9, 1] term [2020-11-09 16:11:35,027 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:11:41,795 WARN L194 SmtUtils]: Spent 6.70 s on a formula simplification that was a NOOP. DAG size: 65 [2020-11-09 16:11:41,808 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:11:42,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:11:42,127 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-09 16:11:42,128 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 8] total 11 [2020-11-09 16:11:42,128 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1084529082] [2020-11-09 16:11:42,128 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:11:42,132 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:11:42,146 INFO L252 McrAutomatonBuilder]: Finished intersection with 60 states and 111 transitions. [2020-11-09 16:11:42,147 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:11:42,317 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [1253#(and (or (= |ULTIMATE.start_main_~#haystack~0.offset| 0) (not (= ~search_needle~0 (select (select |#memory_int| ~search_haystack~0.base) (+ ~search_haystack~0.offset (* search_workerThread1of1ForFork1_~i~0 4)))))) (or (not (= ~search_needle~0 (select (select |#memory_int| ~search_haystack~0.base) (+ ~search_haystack~0.offset (* search_workerThread1of1ForFork1_~i~0 4))))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#haystack~0.base|) (* search_workerThread1of1ForFork1_~i~0 4)) ULTIMATE.start_main_~needle~0)))] [2020-11-09 16:11:42,317 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 16:11:42,318 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:11:42,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 16:11:42,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-11-09 16:11:42,319 INFO L87 Difference]: Start difference. First operand 140 states and 372 transitions. Second operand 6 states. [2020-11-09 16:11:42,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:11:42,559 INFO L93 Difference]: Finished difference Result 202 states and 539 transitions. [2020-11-09 16:11:42,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 16:11:42,560 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-11-09 16:11:42,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:11:42,563 INFO L225 Difference]: With dead ends: 202 [2020-11-09 16:11:42,563 INFO L226 Difference]: Without dead ends: 158 [2020-11-09 16:11:42,564 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2020-11-09 16:11:42,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-11-09 16:11:42,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 110. [2020-11-09 16:11:42,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-11-09 16:11:42,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 290 transitions. [2020-11-09 16:11:42,585 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 290 transitions. Word has length 19 [2020-11-09 16:11:42,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:11:42,586 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 290 transitions. [2020-11-09 16:11:42,586 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 16:11:42,586 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 290 transitions. [2020-11-09 16:11:42,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-09 16:11:42,589 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:11:42,589 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:11:42,804 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-11-09 16:11:42,805 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-11-09 16:11:42,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:11:42,806 INFO L82 PathProgramCache]: Analyzing trace with hash -799546606, now seen corresponding path program 1 times [2020-11-09 16:11:42,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:11:42,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593774705] [2020-11-09 16:11:42,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:11:42,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:11:43,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:11:43,464 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593774705] [2020-11-09 16:11:43,465 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:11:43,465 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-09 16:11:43,465 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1766912282] [2020-11-09 16:11:43,465 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:11:43,469 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:11:43,479 INFO L252 McrAutomatonBuilder]: Finished intersection with 50 states and 86 transitions. [2020-11-09 16:11:43,479 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:11:44,254 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [1696#(and (or (< (select (select |#memory_int| |search_workerThread1of1ForFork1_#in~params.base|) |search_workerThread1of1ForFork1_#in~params.offset|) (select (select |#memory_int| |search_workerThread1of1ForFork1_#in~params.base|) (+ |search_workerThread1of1ForFork1_#in~params.offset| 4))) (= search_workerThread1of1ForFork0_~i~0 0)) (or (= (mod ~search_found~0 256) 0) (= search_workerThread1of1ForFork0_~i~0 0)) (or (<= search_workerThread1of1ForFork0_~upper~0 0) (< (select (select |#memory_int| |search_workerThread1of1ForFork1_#in~params.base|) |search_workerThread1of1ForFork1_#in~params.offset|) (select (select |#memory_int| |search_workerThread1of1ForFork1_#in~params.base|) (+ |search_workerThread1of1ForFork1_#in~params.offset| 4))) (not (= ~search_found~0 (* 256 (div ~search_found~0 256)))))), 1697#(and (or (<= (select (select |#memory_int| search_workerThread1of1ForFork0_~bounds~0.base) (+ search_workerThread1of1ForFork0_~bounds~0.offset 4)) 0) (< (select (select |#memory_int| |search_workerThread1of1ForFork1_#in~params.base|) |search_workerThread1of1ForFork1_#in~params.offset|) (select (select |#memory_int| |search_workerThread1of1ForFork1_#in~params.base|) (+ |search_workerThread1of1ForFork1_#in~params.offset| 4))) (not (= ~search_found~0 (* 256 (div ~search_found~0 256))))) (or (= (mod ~search_found~0 256) 0) (= search_workerThread1of1ForFork0_~lower~0 0)) (or (= search_workerThread1of1ForFork0_~lower~0 0) (< (select (select |#memory_int| |search_workerThread1of1ForFork1_#in~params.base|) |search_workerThread1of1ForFork1_#in~params.offset|) (select (select |#memory_int| |search_workerThread1of1ForFork1_#in~params.base|) (+ |search_workerThread1of1ForFork1_#in~params.offset| 4))))), 1698#(and (= (mod ~search_found~0 256) 0) (< (select (select |#memory_int| |ULTIMATE.start_search_~#bounds2~0.base|) |ULTIMATE.start_search_~#bounds2~0.offset|) (select (select |#memory_int| |ULTIMATE.start_search_~#bounds2~0.base|) (+ |ULTIMATE.start_search_~#bounds2~0.offset| 4)))), 1699#(and (or (= (mod ~search_found~0 256) 0) (= search_workerThread1of1ForFork0_~i~0 0)) (or (< (select (select |#memory_int| |ULTIMATE.start_search_~#bounds2~0.base|) |ULTIMATE.start_search_~#bounds2~0.offset|) (select (select |#memory_int| |ULTIMATE.start_search_~#bounds2~0.base|) (+ |ULTIMATE.start_search_~#bounds2~0.offset| 4))) (= search_workerThread1of1ForFork0_~i~0 0)) (or (not (= (mod ~search_found~0 256) 0)) (<= search_workerThread1of1ForFork0_~upper~0 search_workerThread1of1ForFork0_~i~0) (< (select (select |#memory_int| |ULTIMATE.start_search_~#bounds2~0.base|) |ULTIMATE.start_search_~#bounds2~0.offset|) (select (select |#memory_int| |ULTIMATE.start_search_~#bounds2~0.base|) (+ |ULTIMATE.start_search_~#bounds2~0.offset| 4))))), 1700#(and (or (= search_workerThread1of1ForFork0_~lower~0 0) (< (select (select |#memory_int| |ULTIMATE.start_search_~#bounds2~0.base|) |ULTIMATE.start_search_~#bounds2~0.offset|) (select (select |#memory_int| |ULTIMATE.start_search_~#bounds2~0.base|) (+ |ULTIMATE.start_search_~#bounds2~0.offset| 4)))) (or (= (mod ~search_found~0 256) 0) (= search_workerThread1of1ForFork0_~lower~0 0)) (or (<= (select (select |#memory_int| search_workerThread1of1ForFork0_~bounds~0.base) (+ search_workerThread1of1ForFork0_~bounds~0.offset 4)) 0) (not (= ~search_found~0 (* 256 (div ~search_found~0 256)))) (< (select (select |#memory_int| |ULTIMATE.start_search_~#bounds2~0.base|) |ULTIMATE.start_search_~#bounds2~0.offset|) (select (select |#memory_int| |ULTIMATE.start_search_~#bounds2~0.base|) (+ |ULTIMATE.start_search_~#bounds2~0.offset| 4))))), 1692#(and (= (mod ~search_found~0 256) 0) (< search_workerThread1of1ForFork1_~i~0 search_workerThread1of1ForFork1_~upper~0)), 1693#(and (or (< search_workerThread1of1ForFork1_~i~0 search_workerThread1of1ForFork1_~upper~0) (= search_workerThread1of1ForFork0_~i~0 0)) (or (= (mod ~search_found~0 256) 0) (= search_workerThread1of1ForFork0_~i~0 0)) (or (< search_workerThread1of1ForFork1_~i~0 search_workerThread1of1ForFork1_~upper~0) (<= search_workerThread1of1ForFork0_~upper~0 0) (not (= ~search_found~0 (* 256 (div ~search_found~0 256)))))), 1694#(and (or (< search_workerThread1of1ForFork1_~i~0 search_workerThread1of1ForFork1_~upper~0) (= search_workerThread1of1ForFork0_~lower~0 0)) (or (= (mod ~search_found~0 256) 0) (= search_workerThread1of1ForFork0_~lower~0 0)) (or (< search_workerThread1of1ForFork1_~i~0 search_workerThread1of1ForFork1_~upper~0) (<= (select (select |#memory_int| search_workerThread1of1ForFork0_~bounds~0.base) (+ search_workerThread1of1ForFork0_~bounds~0.offset 4)) 0) (not (= ~search_found~0 (* 256 (div ~search_found~0 256)))))), 1695#(and (= (mod ~search_found~0 256) 0) (< (select (select |#memory_int| |search_workerThread1of1ForFork1_#in~params.base|) |search_workerThread1of1ForFork1_#in~params.offset|) (select (select |#memory_int| |search_workerThread1of1ForFork1_#in~params.base|) (+ |search_workerThread1of1ForFork1_#in~params.offset| 4))))] [2020-11-09 16:11:44,255 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-09 16:11:44,255 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:11:44,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-09 16:11:44,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2020-11-09 16:11:44,258 INFO L87 Difference]: Start difference. First operand 110 states and 290 transitions. Second operand 19 states. [2020-11-09 16:11:44,804 WARN L194 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2020-11-09 16:11:44,999 WARN L194 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-11-09 16:11:45,244 WARN L194 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-11-09 16:11:45,513 WARN L194 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-11-09 16:11:45,775 WARN L194 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-11-09 16:11:46,163 WARN L194 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 85 [2020-11-09 16:11:46,367 WARN L194 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-11-09 16:11:46,687 WARN L194 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-09 16:11:47,058 WARN L194 SmtUtils]: Spent 280.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-11-09 16:11:47,231 WARN L194 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2020-11-09 16:11:47,466 WARN L194 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-11-09 16:11:47,967 WARN L194 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 99 [2020-11-09 16:11:48,215 WARN L194 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2020-11-09 16:11:48,701 WARN L194 SmtUtils]: Spent 372.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2020-11-09 16:11:49,036 WARN L194 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 77 [2020-11-09 16:11:49,439 WARN L194 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-11-09 16:11:49,878 WARN L194 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 95 [2020-11-09 16:11:50,523 WARN L194 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 108 [2020-11-09 16:11:50,802 WARN L194 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2020-11-09 16:11:51,233 WARN L194 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 84 [2020-11-09 16:11:51,478 WARN L194 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-11-09 16:11:51,806 WARN L194 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-11-09 16:11:52,372 WARN L194 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 104 [2020-11-09 16:11:52,680 WARN L194 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 65 [2020-11-09 16:11:53,160 WARN L194 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-11-09 16:11:53,480 WARN L194 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 80 [2020-11-09 16:11:53,829 WARN L194 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 73 [2020-11-09 16:11:54,390 WARN L194 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 77 [2020-11-09 16:11:54,749 WARN L194 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 66 [2020-11-09 16:11:55,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:11:55,199 INFO L93 Difference]: Finished difference Result 326 states and 898 transitions. [2020-11-09 16:11:55,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2020-11-09 16:11:55,199 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 20 [2020-11-09 16:11:55,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:11:55,202 INFO L225 Difference]: With dead ends: 326 [2020-11-09 16:11:55,202 INFO L226 Difference]: Without dead ends: 290 [2020-11-09 16:11:55,204 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=635, Invalid=2121, Unknown=0, NotChecked=0, Total=2756 [2020-11-09 16:11:55,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2020-11-09 16:11:55,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 130. [2020-11-09 16:11:55,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2020-11-09 16:11:55,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 351 transitions. [2020-11-09 16:11:55,218 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 351 transitions. Word has length 20 [2020-11-09 16:11:55,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:11:55,218 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 351 transitions. [2020-11-09 16:11:55,218 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-09 16:11:55,218 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 351 transitions. [2020-11-09 16:11:55,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-09 16:11:55,220 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:11:55,220 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:11:55,220 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-09 16:11:55,220 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-11-09 16:11:55,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:11:55,221 INFO L82 PathProgramCache]: Analyzing trace with hash -598861718, now seen corresponding path program 2 times [2020-11-09 16:11:55,227 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:11:55,227 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305688189] [2020-11-09 16:11:55,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:11:55,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:11:55,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:11:55,799 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305688189] [2020-11-09 16:11:55,800 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827230081] [2020-11-09 16:11:55,800 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-09 16:11:55,893 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-09 16:11:55,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-09 16:11:55,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 58 conjunts are in the unsatisfiable core [2020-11-09 16:11:55,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-09 16:11:55,928 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2020-11-09 16:11:55,930 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-11-09 16:11:55,994 INFO L625 ElimStorePlain]: treesize reduction 22, result has 67.6 percent of original size [2020-11-09 16:11:56,001 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-11-09 16:11:56,002 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-09 16:11:56,025 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 16:11:56,026 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-09 16:11:56,027 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:42 [2020-11-09 16:11:56,158 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 16:11:56,159 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 52 [2020-11-09 16:11:56,160 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-09 16:11:56,234 INFO L625 ElimStorePlain]: treesize reduction 16, result has 78.1 percent of original size [2020-11-09 16:11:56,244 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:11:56,247 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-11-09 16:11:56,248 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:53, output treesize:57 [2020-11-09 16:11:56,252 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:11:56,987 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:11:57,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:11:57,087 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:11:57,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:11:57,150 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:11:57,151 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:11:58,238 WARN L194 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 44 DAG size of output: 31 [2020-11-09 16:11:58,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:11:58,488 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-09 16:11:58,488 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 16 [2020-11-09 16:11:58,488 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1460800655] [2020-11-09 16:11:58,488 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:11:58,498 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:11:58,510 INFO L252 McrAutomatonBuilder]: Finished intersection with 61 states and 109 transitions. [2020-11-09 16:11:58,511 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:11:59,425 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [2432#(and (or (not (= (select (select |#memory_int| |ULTIMATE.start_search_~#searcher1~0.base|) |ULTIMATE.start_search_~#searcher1~0.offset|) search_workerThread1of1ForFork0_thidvar0)) (= |ULTIMATE.start_main_~#haystack~0.offset| 0)) (or (not (= (select (select |#memory_int| |ULTIMATE.start_search_~#searcher1~0.base|) |ULTIMATE.start_search_~#searcher1~0.offset|) search_workerThread1of1ForFork0_thidvar0)) (= search_workerThread1of1ForFork0_~i~0 0)) (or (not (= (select (select |#memory_int| |ULTIMATE.start_search_~#searcher1~0.base|) |ULTIMATE.start_search_~#searcher1~0.offset|) search_workerThread1of1ForFork0_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#haystack~0.base|) 0) ULTIMATE.start_main_~needle~0))), 2433#(and (or (not (= search_workerThread1of1ForFork0_~i~0 0)) (= |ULTIMATE.start_main_~#haystack~0.offset| 0)) (or (not (= (select (select |#memory_int| |ULTIMATE.start_search_~#searcher1~0.base|) |ULTIMATE.start_search_~#searcher1~0.offset|) search_workerThread1of1ForFork0_thidvar0)) (= search_workerThread1of1ForFork0_~i~0 0)) (or (not (= search_workerThread1of1ForFork0_~i~0 0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#haystack~0.base|) 0) ULTIMATE.start_main_~needle~0))), 2434#(and (or (not (= search_workerThread1of1ForFork0_~i~0 0)) (= ULTIMATE.start_main_~needle~0 ~search_needle~0)) (or (not (= search_workerThread1of1ForFork0_~i~0 0)) (= |ULTIMATE.start_main_~#haystack~0.offset| 0)) (or (not (= (select (select |#memory_int| |ULTIMATE.start_search_~#searcher1~0.base|) |ULTIMATE.start_search_~#searcher1~0.offset|) search_workerThread1of1ForFork0_thidvar0)) (= search_workerThread1of1ForFork0_~i~0 0)) (or (not (= search_workerThread1of1ForFork0_~i~0 0)) (= |ULTIMATE.start_main_~#haystack~0.base| ~search_haystack~0.base)) (or (not (= search_workerThread1of1ForFork0_~i~0 0)) (= (+ ~search_haystack~0.offset (* 4 search_workerThread1of1ForFork0_~i~0)) 0))), 2435#(and (or (= search_workerThread1of1ForFork0_~lower~0 (select (select |#memory_int| |ULTIMATE.start_search_~#searcher1~0.base|) |ULTIMATE.start_search_~#searcher1~0.offset|)) (= search_workerThread1of1ForFork0_~lower~0 0)) (= |ULTIMATE.start_main_~#haystack~0.offset| 0) (= ULTIMATE.start_main_~needle~0 ~search_needle~0) (= |ULTIMATE.start_main_~#haystack~0.base| ~search_haystack~0.base) (or (= search_workerThread1of1ForFork0_~lower~0 0) (= search_workerThread1of1ForFork0_thidvar0 0)) (= ~search_haystack~0.offset 0)), 2436#(and (= |ULTIMATE.start_main_~#haystack~0.offset| 0) (= ULTIMATE.start_main_~needle~0 ~search_needle~0) (or (= (select (select |#memory_int| |ULTIMATE.start_search_~#searcher1~0.base|) |ULTIMATE.start_search_~#searcher1~0.offset|) (select (select |#memory_int| |search_workerThread1of1ForFork0_#in~params.base|) |search_workerThread1of1ForFork0_#in~params.offset|)) (= (select (select |#memory_int| |search_workerThread1of1ForFork0_#in~params.base|) |search_workerThread1of1ForFork0_#in~params.offset|) 0)) (= |ULTIMATE.start_main_~#haystack~0.base| ~search_haystack~0.base) (= ~search_haystack~0.offset 0) (or (= (select (select |#memory_int| |search_workerThread1of1ForFork0_#in~params.base|) |search_workerThread1of1ForFork0_#in~params.offset|) 0) (= search_workerThread1of1ForFork0_thidvar0 0))), 2430#(and (or (not (= (select (select |#memory_int| |ULTIMATE.start_search_~#searcher1~0.base|) |ULTIMATE.start_search_~#searcher1~0.offset|) search_workerThread1of1ForFork0_thidvar0)) (= |ULTIMATE.start_main_~#haystack~0.offset| 0)) (or (not (= (select (select |#memory_int| |ULTIMATE.start_search_~#searcher1~0.base|) |ULTIMATE.start_search_~#searcher1~0.offset|) search_workerThread1of1ForFork0_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#haystack~0.base|) 0) ULTIMATE.start_main_~needle~0)) (or (not (= (select (select |#memory_int| |ULTIMATE.start_search_~#searcher1~0.base|) |ULTIMATE.start_search_~#searcher1~0.offset|) search_workerThread1of1ForFork0_thidvar0)) (= ~search_result~0 0))), 2431#(and (or (= |ULTIMATE.start_main_~#haystack~0.offset| 0) (not (= search_workerThread1of1ForFork0_thidvar0 |ULTIMATE.start_search_#t~mem6|))) (or (not (= search_workerThread1of1ForFork0_thidvar0 |ULTIMATE.start_search_#t~mem6|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#haystack~0.base|) 0) ULTIMATE.start_main_~needle~0)) (or (not (= search_workerThread1of1ForFork0_thidvar0 |ULTIMATE.start_search_#t~mem6|)) (= search_workerThread1of1ForFork0_~i~0 0)))] [2020-11-09 16:11:59,425 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-09 16:11:59,426 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:11:59,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-09 16:11:59,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=527, Unknown=1, NotChecked=0, Total=600 [2020-11-09 16:11:59,428 INFO L87 Difference]: Start difference. First operand 130 states and 351 transitions. Second operand 18 states. [2020-11-09 16:11:59,884 WARN L194 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2020-11-09 16:12:00,039 WARN L194 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2020-11-09 16:12:00,311 WARN L194 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2020-11-09 16:12:00,617 WARN L194 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2020-11-09 16:12:00,942 WARN L194 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2020-11-09 16:12:01,296 WARN L194 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2020-11-09 16:12:01,638 WARN L194 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2020-11-09 16:12:02,065 WARN L194 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2020-11-09 16:12:02,415 WARN L194 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2020-11-09 16:12:02,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:12:02,662 INFO L93 Difference]: Finished difference Result 329 states and 900 transitions. [2020-11-09 16:12:02,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-09 16:12:02,663 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 20 [2020-11-09 16:12:02,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:12:02,670 INFO L225 Difference]: With dead ends: 329 [2020-11-09 16:12:02,670 INFO L226 Difference]: Without dead ends: 311 [2020-11-09 16:12:02,671 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 30 SyntacticMatches, 15 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=225, Invalid=1106, Unknown=1, NotChecked=0, Total=1332 [2020-11-09 16:12:02,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2020-11-09 16:12:02,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 188. [2020-11-09 16:12:02,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-11-09 16:12:02,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 523 transitions. [2020-11-09 16:12:02,700 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 523 transitions. Word has length 20 [2020-11-09 16:12:02,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:12:02,700 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 523 transitions. [2020-11-09 16:12:02,701 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-09 16:12:02,701 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 523 transitions. [2020-11-09 16:12:02,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-09 16:12:02,705 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:12:02,705 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:12:02,922 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-09 16:12:02,922 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-11-09 16:12:02,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:12:02,924 INFO L82 PathProgramCache]: Analyzing trace with hash 914665954, now seen corresponding path program 3 times [2020-11-09 16:12:02,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:12:02,926 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889164339] [2020-11-09 16:12:02,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:12:02,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:12:03,141 WARN L194 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2020-11-09 16:12:03,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:12:03,529 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889164339] [2020-11-09 16:12:03,529 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:12:03,529 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-09 16:12:03,529 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [470157535] [2020-11-09 16:12:03,529 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:12:03,534 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:12:03,541 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 72 transitions. [2020-11-09 16:12:03,542 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:12:04,129 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [3176#(and (= (mod ~search_found~0 256) 0) (< search_workerThread1of1ForFork1_~i~0 search_workerThread1of1ForFork1_~upper~0)), 3177#(and (= (mod ~search_found~0 256) 0) (< (select (select |#memory_int| |search_workerThread1of1ForFork1_#in~params.base|) |search_workerThread1of1ForFork1_#in~params.offset|) (select (select |#memory_int| |search_workerThread1of1ForFork1_#in~params.base|) (+ |search_workerThread1of1ForFork1_#in~params.offset| 4)))), 3178#(and (or (< search_workerThread1of1ForFork1_~i~0 search_workerThread1of1ForFork1_~upper~0) (= search_workerThread1of1ForFork0_~i~0 0)) (or (= (mod ~search_found~0 256) 0) (= search_workerThread1of1ForFork0_~i~0 0)) (or (< search_workerThread1of1ForFork1_~i~0 search_workerThread1of1ForFork1_~upper~0) (<= search_workerThread1of1ForFork0_~upper~0 0) (not (= ~search_found~0 (* 256 (div ~search_found~0 256)))))), 3179#(and (or (< (select (select |#memory_int| |search_workerThread1of1ForFork1_#in~params.base|) |search_workerThread1of1ForFork1_#in~params.offset|) (select (select |#memory_int| |search_workerThread1of1ForFork1_#in~params.base|) (+ |search_workerThread1of1ForFork1_#in~params.offset| 4))) (= search_workerThread1of1ForFork0_~i~0 0)) (or (= (mod ~search_found~0 256) 0) (= search_workerThread1of1ForFork0_~i~0 0)) (or (<= search_workerThread1of1ForFork0_~upper~0 0) (< (select (select |#memory_int| |search_workerThread1of1ForFork1_#in~params.base|) |search_workerThread1of1ForFork1_#in~params.offset|) (select (select |#memory_int| |search_workerThread1of1ForFork1_#in~params.base|) (+ |search_workerThread1of1ForFork1_#in~params.offset| 4))) (not (= ~search_found~0 (* 256 (div ~search_found~0 256)))))), 3180#(and (= (mod ~search_found~0 256) 0) (< (select (select |#memory_int| |ULTIMATE.start_search_~#bounds2~0.base|) |ULTIMATE.start_search_~#bounds2~0.offset|) (select (select |#memory_int| |ULTIMATE.start_search_~#bounds2~0.base|) (+ |ULTIMATE.start_search_~#bounds2~0.offset| 4)))), 3181#(and (or (= (mod ~search_found~0 256) 0) (= search_workerThread1of1ForFork0_~i~0 0)) (or (< (select (select |#memory_int| |ULTIMATE.start_search_~#bounds2~0.base|) |ULTIMATE.start_search_~#bounds2~0.offset|) (select (select |#memory_int| |ULTIMATE.start_search_~#bounds2~0.base|) (+ |ULTIMATE.start_search_~#bounds2~0.offset| 4))) (= search_workerThread1of1ForFork0_~i~0 0)) (or (not (= (mod ~search_found~0 256) 0)) (<= search_workerThread1of1ForFork0_~upper~0 search_workerThread1of1ForFork0_~i~0) (< (select (select |#memory_int| |ULTIMATE.start_search_~#bounds2~0.base|) |ULTIMATE.start_search_~#bounds2~0.offset|) (select (select |#memory_int| |ULTIMATE.start_search_~#bounds2~0.base|) (+ |ULTIMATE.start_search_~#bounds2~0.offset| 4)))))] [2020-11-09 16:12:04,129 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-09 16:12:04,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:12:04,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-09 16:12:04,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2020-11-09 16:12:04,130 INFO L87 Difference]: Start difference. First operand 188 states and 523 transitions. Second operand 16 states. [2020-11-09 16:12:04,630 WARN L194 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2020-11-09 16:12:04,887 WARN L194 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-11-09 16:12:05,128 WARN L194 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-11-09 16:12:05,556 WARN L194 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2020-11-09 16:12:05,885 WARN L194 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2020-11-09 16:12:06,200 WARN L194 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2020-11-09 16:12:06,547 WARN L194 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2020-11-09 16:12:06,987 WARN L194 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 95 [2020-11-09 16:12:07,233 WARN L194 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-11-09 16:12:07,594 WARN L194 SmtUtils]: Spent 313.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2020-11-09 16:12:07,947 WARN L194 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2020-11-09 16:12:08,165 WARN L194 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-11-09 16:12:08,370 WARN L194 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-11-09 16:12:08,975 WARN L194 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 108 [2020-11-09 16:12:09,276 WARN L194 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2020-11-09 16:12:09,665 WARN L194 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 82 [2020-11-09 16:12:09,902 WARN L194 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-11-09 16:12:10,179 WARN L194 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-11-09 16:12:10,465 WARN L194 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-11-09 16:12:10,950 WARN L194 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2020-11-09 16:12:11,140 WARN L194 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2020-11-09 16:12:11,638 WARN L194 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 88 [2020-11-09 16:12:11,901 WARN L194 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2020-11-09 16:12:12,420 WARN L194 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2020-11-09 16:12:12,984 WARN L194 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 92 [2020-11-09 16:12:13,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:12:13,550 INFO L93 Difference]: Finished difference Result 527 states and 1501 transitions. [2020-11-09 16:12:13,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-11-09 16:12:13,550 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 20 [2020-11-09 16:12:13,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:12:13,556 INFO L225 Difference]: With dead ends: 527 [2020-11-09 16:12:13,556 INFO L226 Difference]: Without dead ends: 479 [2020-11-09 16:12:13,557 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=506, Invalid=1656, Unknown=0, NotChecked=0, Total=2162 [2020-11-09 16:12:13,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2020-11-09 16:12:13,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 186. [2020-11-09 16:12:13,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-11-09 16:12:13,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 516 transitions. [2020-11-09 16:12:13,570 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 516 transitions. Word has length 20 [2020-11-09 16:12:13,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:12:13,570 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 516 transitions. [2020-11-09 16:12:13,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-09 16:12:13,571 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 516 transitions. [2020-11-09 16:12:13,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-09 16:12:13,572 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:12:13,572 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:12:13,572 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-09 16:12:13,573 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-11-09 16:12:13,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:12:13,573 INFO L82 PathProgramCache]: Analyzing trace with hash 639184670, now seen corresponding path program 4 times [2020-11-09 16:12:13,576 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:12:13,576 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953347417] [2020-11-09 16:12:13,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:12:13,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:12:13,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:12:13,823 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953347417] [2020-11-09 16:12:13,823 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361792674] [2020-11-09 16:12:13,823 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-09 16:12:13,917 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-09 16:12:13,917 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-09 16:12:13,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 63 conjunts are in the unsatisfiable core [2020-11-09 16:12:13,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-09 16:12:13,925 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:12:13,946 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2020-11-09 16:12:13,948 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-11-09 16:12:13,963 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2020-11-09 16:12:13,964 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-11-09 16:12:13,980 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2020-11-09 16:12:13,981 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2020-11-09 16:12:14,287 WARN L194 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2020-11-09 16:12:14,288 INFO L625 ElimStorePlain]: treesize reduction 66, result has 74.4 percent of original size [2020-11-09 16:12:14,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-09 16:12:14,323 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2020-11-09 16:12:14,324 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-11-09 16:12:14,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-09 16:12:14,354 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2020-11-09 16:12:14,355 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-11-09 16:12:14,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-09 16:12:14,371 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2020-11-09 16:12:14,372 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-11-09 16:12:14,520 WARN L194 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2020-11-09 16:12:14,520 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 16:12:14,522 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2020-11-09 16:12:14,523 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:207, output treesize:180 [2020-11-09 16:12:14,715 WARN L194 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-11-09 16:12:14,922 WARN L194 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-11-09 16:12:15,157 WARN L194 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2020-11-09 16:12:15,162 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-09 16:12:15,165 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:12:15,170 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:12:15,175 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-09 16:12:15,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:12:15,188 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-09 16:12:15,195 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:12:15,199 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-09 16:12:15,215 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-09 16:12:15,222 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-09 16:12:15,229 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-09 16:12:15,236 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-09 16:12:15,244 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-09 16:12:15,251 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-09 16:12:15,259 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-09 16:12:15,266 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-09 16:12:15,277 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-09 16:12:15,286 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-09 16:12:15,292 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-09 16:12:15,298 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-09 16:12:15,306 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-09 16:12:15,312 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-09 16:12:15,320 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-09 16:12:15,326 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-09 16:12:15,335 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:12:15,339 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-09 16:12:15,345 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:12:15,350 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-09 16:12:15,356 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:12:15,361 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-09 16:12:15,380 INFO L443 ElimStorePlain]: Different costs {30=[v_prenex_43], 42=[|v_#memory_int_123|]} [2020-11-09 16:12:15,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-09 16:12:15,545 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 16:12:15,545 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 52 treesize of output 142 [2020-11-09 16:12:15,552 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-09 16:12:15,554 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 16:12:15,555 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-11-09 16:12:15,556 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-09 16:12:15,561 WARN L340 FreeRefinementEngine]: Global settings require throwing the following exception [2020-11-09 16:12:15,774 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-09 16:12:15,776 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: variable got div captured at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer$DerHelperMcsbr.solveForSubject(DualJunctionDer.java:426) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer$DerHelperMcsbr.solveForSubject(DualJunctionDer.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer$IDerHelper.findBestReplacementSbr(DualJunctionDer.java:305) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer$IDerHelper.tryToEliminateSbr(DualJunctionDer.java:319) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer.tryToEliminateOne(DualJunctionDer.java:223) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer.tryExhaustivelyToEliminate(DualJunctionDer.java:190) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer.tryToEliminateOne(DualJunctionDer.java:174) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer.tryExhaustivelyToEliminate(DualJunctionDer.java:141) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer.tryToEliminate(DualJunctionDer.java:119) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:740) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:703) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:620) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:336) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:199) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:408) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:199) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:408) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:199) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:408) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:199) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:711) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:296) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:604) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:517) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:239) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:313) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:106) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:378) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-11-09 16:12:15,786 INFO L168 Benchmark]: Toolchain (without parser) took 60271.74 ms. Allocated memory was 162.5 MB in the beginning and 338.7 MB in the end (delta: 176.2 MB). Free memory was 136.1 MB in the beginning and 301.8 MB in the end (delta: -165.7 MB). Peak memory consumption was 197.9 MB. Max. memory is 8.0 GB. [2020-11-09 16:12:15,787 INFO L168 Benchmark]: CDTParser took 0.71 ms. Allocated memory is still 125.8 MB. Free memory was 100.5 MB in the beginning and 100.4 MB in the end (delta: 69.8 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-09 16:12:15,788 INFO L168 Benchmark]: CACSL2BoogieTranslator took 302.00 ms. Allocated memory is still 162.5 MB. Free memory was 135.5 MB in the beginning and 126.0 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-11-09 16:12:15,788 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.85 ms. Allocated memory is still 162.5 MB. Free memory was 126.0 MB in the beginning and 124.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-09 16:12:15,789 INFO L168 Benchmark]: Boogie Preprocessor took 30.88 ms. Allocated memory is still 162.5 MB. Free memory was 124.4 MB in the beginning and 123.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-09 16:12:15,789 INFO L168 Benchmark]: RCFGBuilder took 873.38 ms. Allocated memory is still 162.5 MB. Free memory was 123.0 MB in the beginning and 129.9 MB in the end (delta: -7.0 MB). Peak memory consumption was 11.8 MB. Max. memory is 8.0 GB. [2020-11-09 16:12:15,790 INFO L168 Benchmark]: TraceAbstraction took 59002.64 ms. Allocated memory was 162.5 MB in the beginning and 338.7 MB in the end (delta: 176.2 MB). Free memory was 129.2 MB in the beginning and 301.8 MB in the end (delta: -172.6 MB). Peak memory consumption was 191.3 MB. Max. memory is 8.0 GB. [2020-11-09 16:12:15,796 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.71 ms. Allocated memory is still 125.8 MB. Free memory was 100.5 MB in the beginning and 100.4 MB in the end (delta: 69.8 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 302.00 ms. Allocated memory is still 162.5 MB. Free memory was 135.5 MB in the beginning and 126.0 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 49.85 ms. Allocated memory is still 162.5 MB. Free memory was 126.0 MB in the beginning and 124.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 30.88 ms. Allocated memory is still 162.5 MB. Free memory was 124.4 MB in the beginning and 123.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 873.38 ms. Allocated memory is still 162.5 MB. Free memory was 123.0 MB in the beginning and 129.9 MB in the end (delta: -7.0 MB). Peak memory consumption was 11.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 59002.64 ms. Allocated memory was 162.5 MB in the beginning and 338.7 MB in the end (delta: 176.2 MB). Free memory was 129.2 MB in the beginning and 301.8 MB in the end (delta: -172.6 MB). Peak memory consumption was 191.3 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1124 VarBasedMoverChecksPositive, 23 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 82 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 9.8s, 135 PlacesBefore, 31 PlacesAfterwards, 138 TransitionsBefore, 30 TransitionsAfterwards, 1920 CoEnabledTransitionPairs, 7 FixpointIterations, 70 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 11 ConcurrentYvCompositions, 4 ChoiceCompositions, 125 TotalNumberOfCompositions, 4237 MoverChecksTotal - ExceptionOrErrorResult: AssertionError: variable got div captured de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: variable got div captured: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer$DerHelperMcsbr.solveForSubject(DualJunctionDer.java:426) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...